A minimal B+Tree implementation for millions (even billions) of key-value storage based on Posix.
in-memory for learning and debugging.
./demo_build.shNote: Do NOT load an existing index file with same name for this testing!
./coverage_build.sh
forked from begeekmyfriend/bplustree
-
Notifications
You must be signed in to change notification settings - Fork 0
A minimal B+ tree algo demo for millions (even billions) of key-value storage
License
samuel-cc-4451/bplustree
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A minimal B+ tree algo demo for millions (even billions) of key-value storage
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published
Languages
- C 85.4%
- CMake 12.5%
- Python 1.7%
- Shell 0.4%