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: Do NOT load an existing index file with same name for this testing!
./coverage_build.sh
A minimal B+ tree indexing structure demo for millions (even billions) of key-value storage
CMIT
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: Do NOT load an existing index file with same name for this testing!
./coverage_build.sh