一个极简但极快的 B+ 树索引结构演示,用于存储数十亿个键值
A minimal B+Tree implementation for millions (even billions) of key-value storage based on Posix.
in-memory for learning and debugging.
./demo_build.shNote: You need to rm /tmp/coverage.index* for this testing every time because the configuration (i.e block size and order etc.) in those index files is immutable!
./coverage_build.sh暂无开放 Issues，或尚未同步最近议题。