/bplustree

A minimal B+ tree algo demo for key-value storage

Primary LanguageCMIT LicenseMIT

B+Tree

A minimal B+Tree implementation for key-value storage.

Demo

Just Compile

./demo_build.sh

Compile and run

./demo_build.sh run

Compile and debug

./demo_build.sh debug

General Test

./test_build.sh

Code Coverage Test

./coverage_build.sh

Todo list

  1. Use ncurses libary to deal with user input.
  2. Implement delay write for insertion and deletion.
  3. Implement a more efficent way to deal with dump.
  4. Seperate node structure in memory and disk.