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

Name		Name	Last commit message	Last commit date
Latest commit History 120 Commits
cmake		cmake
lib		lib
tests		tests
CMakeLists.txt		CMakeLists.txt
LICENSE		LICENSE
README.md		README.md
coverage_build.sh		coverage_build.sh
demo_build.sh		demo_build.sh
package.json		package.json