Bplustree

A minimal but extreme fast B+ tree indexing structure demo for billions of key-value storage

From begeekmyfriend·Updated June 22, 2026·View on GitHub·

A minimal B+Tree implementation for millions (even billions) of key-value storage based on Posix. The project is written primarily in C, distributed under the MIT License license, first published in 2014. It has gained significant community traction with 1,879 stars and 316 forks on GitHub. Key topics include: algorithm, bplustree, btree, c, data-structure.

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

shell
./demo_build.sh

Code Coverage Test

Note: 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!