# bplustree

**Repository Path**: begeekmyfriend/bplustree

## Basic Information

- **Project Name**: bplustree
- **Description**: A minimal B+ tree algorithm demo for key-value storage
- **Primary Language**: C
- **License**: MIT
- **Default Branch**: disk-io
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 9
- **Forks**: 1
- **Created**: 2015-04-01
- **Last Updated**: 2025-08-15

## Categories & Tags

**Categories**: sample-code

**Tags**: None

## README

# B+Tree
A minimal B+Tree implementation for millions (even billions) of key-value storage based on Posix.

## Branch
[in-memory](https://github.com/begeekmyfriend/bplustree/tree/in-memory) for learning and debugging.

## Demo
```shell
./demo_build.sh
```

## Code Coverage Test

**Note:** You need to `rm /tmp/coverage.index*` first for this testing!

```shell
./coverage_build.sh
```