C++ template containers with optimized memory consumption
-
Updated
Jun 10, 2024 - C++
C++ template containers with optimized memory consumption
This library provides a persistent block accessible disk-resident b+tree, page table and a linked_page_list.
A lightweight C library of portability wrappers and data structures
ConcurrentSortedDictionary implementation in (c#, .NET 7) . It is implemented using a concurrent B+Tree
GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
Benchmarking Rust storage engines
the champagne of beta embedded databases
This repository contains the three projects completed as part of a data structures and algorithms course.
Repositorio de la materia de Programación IV
A B-Tree implementation of sweep line algorithm for segment intersection
🏅State-of-the-art learned data structure that enables fast lookup, predecessor, range searches and updates in arrays of billions of items using orders of magnitude less space than traditional indexes
GPU B-Tree with support for versioning (snapshots).
An embedded key-value store library specialized for building state machine and log store
Independent data structure headers.
Add a description, image, and links to the b-tree topic page so that developers can more easily learn about it.
To associate your repository with the b-tree topic, visit your repo's landing page and select "manage topics."