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 (14,730
algorithm (493
storage (249
tree (178
data-structure (50
tree-structure (41

Find Open Source By Browsing 7,000 Topics Across 59 Categories