begeekmyfriend/bplustree

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

1,874

127 commits

updated Jan 4, 2023

See the code

README

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 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

algorithm

bplustree

btree

data-structure

storage

tree

tree-structure

Significant stargazers

Ash Vardanian

1,456 followers · starred Apr 2020

Charles Leifer

2,244 followers · starred Jan 2018

Yuan Wang

140 followers · starred Jan 2018

lokax

26 followers · starred Oct 2022

Similar repos

oscarlab/Be-Tree

A simple, reference implementation of a B^e-tree

170

bgamari/b-tree

Haskell on-disk B* tree implementation

115

google/btree

BTree provides a simple, ordered, in-memory data structure for Go programs.

4,165

OrangeTide/btree

lock free modified prefix B+tree append-only database

117

antirez/otree

a simple btree implementation with automatic space reclaiming

282

microsoft/bf-tree

Bf-Tree is a modern read-write-optimized concurrent larger-than-memory range index in Rust from MS…

1,076

NicolasLM/bplustree

An on-disk B+tree for Python 3

768

loro-dev/generic-btree

It’s a pure safe BTree that can be used to build your own special-purpose btree data structure