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.
-
Updated
Aug 5, 2023 - C++
#
b-tree-implementation
Here are 8 public repositories matching this topic...
Some advanced data structures' implementations in C++
bloom-filters
cpp
trie
dynamic-table
red-black-tree
count-min-sketch
interval-tree
binomial-heap
segment-tree
b-tree
advanced-data-structures
rb-tree
b-tree-implementation
binary-counter
amortized-analysis
multipop-stack
b-tree-cpp
-
Updated
Dec 12, 2022 - C++
Implementation of External Memory Fractal Tree (a variant of the Buffered Repository Tree) in C++ through the STXXL library.
-
Updated
Jan 24, 2021 - C++
Extendable C++ implementation of B+Tree data structure
-
Updated
Dec 29, 2020 - C++
This course mainly introduces the theory and application of database systems, including: 1. Introduction and architecture of database systems 2. ER data schema 3. File storage structure 4. Relational data schema 5. SQL query language 6. Conversion between ER data model and relational data model 7. Database normalization 8. Optimized query 9. Tra…
-
Updated
Jun 15, 2022 - C++
Distributed System Data Base implemented in C++ using B-Trees to manage and manipulate the death rate dataset efficiently.
-
Updated
Jan 30, 2023 - C++
C++ implementation of AVL tree and B tree - 기록용!
avl-tree
cplusplus
tree-structure
b-tree
avl-tree-implementations
b-tree-implementation
hyu
avl-tree-code
midnight-tree
-
Updated
Mar 10, 2021 - C++
Redemptive C++ implementation of a B Tree data structure. A revenge journey through data structures.
-
Updated
Aug 18, 2023 - C++
Improve this page
Add a description, image, and links to the b-tree-implementation topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the b-tree-implementation topic, visit your repo's landing page and select "manage topics."