Awesome Open Source
Awesome Open Source


A minimal B+Tree implementation for millions (even billions) of key-value storage based on Posix.


in-memory for learning and debugging.



Code Coverage Test

Note: You need to rm /tmp/coverage.index* first for this testing!


Get A Weekly Email With Trending Projects For These Topics
No Spam. Unsubscribe easily at any time.
C (273,634
Algorithms (10,487
Data Structures (6,080
Storage (1,657
Tree (1,597
Tree Structure (357
Related Projects