Skip to content
A minimal but extreme fast B+ tree indexing structure demo for billions of key-value storage
Branch: disk-io
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
cmake Imvprove code coverage percentage Jun 3, 2015
lib Update Jan 28, 2018
tests Update Jan 28, 2018
CMakeLists.txt
LICENSE
README.md
coverage_build.sh Update test case May 2, 2016
demo_build.sh Improve testcase Mar 19, 2016
package.json

README.md

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 delete the existing /tmp/coverage.index first for this testing!

./coverage_build.sh
You can’t perform that action at this time.
You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session.