A minimal B+Tree implementation for millions (even billions) of key-value storage based on Posix.
in-memory for learning and debugging.
./demo_build.sh
Note: You need to rm /tmp/coverage.index*
first for this testing!
./coverage_build.sh
A minimal B+Tree implementation for millions (even billions) of key-value storage based on Posix.
in-memory for learning and debugging.
./demo_build.sh
Note: You need to rm /tmp/coverage.index*
first for this testing!
./coverage_build.sh