C++ template containers with optimized memory consumption
-
Updated
Nov 2, 2024 - C++
C++ template containers with optimized memory consumption
An embedded key-value store library specialized for building state machine and log store
GPU B-Tree with support for versioning (snapshots).
A B-Tree implementation of sweep line algorithm for segment intersection
Persistent key-value store database library.
Key-Value Storage Database
This project, part of the Data Structures course, applies advanced data structure concepts to manage airplanes, pilots, and flight routes using C++. It employs B-trees, AVL trees, hash tables, directed graphs, and sparse matrices. Reports are generated with Graphviz, showcasing the practical implementation of various data structures.
The algorithms were written as part of the Algorithms and Data Structures class at UMCS.
🏅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
An LSM-tree database with B+ tree indexing, LRU page caching, and Bloom filters
Source codes for the Data Structures and Algorithms in C++ and Java book
Redemptive C++ implementation of a B Tree data structure. A revenge journey through data structures.
This contains a C++ code that implements a B-Tree data structure. A B-Tree is a self-balancing tree that can store and retrieve data efficiently. It is commonly used in databases and file systems.
Struct-DB : Efficient database management system utilizing data structures to optimize performance
Code done for the Data Structure class on UFSC
Some advanced data structures' implementations in C++
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."