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_build.sh

Note: You need to delete the existing /tmp/coverage.index first for this testing!

./coverage_build.sh