https://github.com/begeekmyfriend/bplustree

A minimal but extreme fast B+ tree indexing structure demo for billions of key-value storage
https://github.com/begeekmyfriend/bplustree

algorithm bplustree btree c data-structure storage tree tree-structure

Last synced: 3 days ago
JSON representation

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

• Host: GitHub
• URL: https://github.com/begeekmyfriend/bplustree
• Owner: begeekmyfriend
• License: mit
• Created: 2014-09-26T09:58:35.000Z (over 10 years ago)
• Default Branch: disk-io
• Last Pushed: 2023-01-04T10:45:30.000Z (about 2 years ago)
• Last Synced: 2024-10-29T17:48:56.311Z (3 months ago)
• Topics: algorithm, bplustree, btree, c, data-structure, storage, tree, tree-structure
• Language: C
• Homepage:
• Size: 219 KB
• Stars: 1,863
• Watchers: 78
• Forks: 315
• Open Issues: 2
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

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*` for this testing every time because the configuration (i.e block size and order etc.) in those index files is immutable!

```shell

./coverage_build.sh

```