/bplustree

A minimal but extreme fast B+ tree indexing structure demo for billions of key-value storage

Primary LanguageCMIT LicenseMIT

B+Tree

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

Branch

in-memory for learning and debugging.

Demo

./demo_build.sh

Code Coverage Test

Note: You need to rm /tmp/coverage.index* for this testing every time because the configuration (i.e block size and order etc.) in those index files is immutable!

./coverage_build.sh