A minimal B+Tree implementation for key-value storage.
Just Compile
./demo_build.sh
Compile and run
./demo_build.sh run
Compile and debug
./demo_build.sh debug
./test_build.sh
./coverage_build.sh
- Use ncurses libary to deal with user input.
- Implement delay write for insertion and deletion.
- Implement a more efficent way to deal with dump.
- Seperate node structure in memory and disk.