A B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree generalizes the binary search tree, allowing for nodes with more than two children.
For more info Click .
The implementation depends on Google's snappy library for fast compression.
make MODE=release
optionally, you can execute test suite:
make check
#include <stdlib.h> #include <stdio.h> #include "bplus.h" int main(void) { bp_db_t db; /* Open database */ bp_open(&db, "/tmp/1.bp"); /* Set some value */ bp_sets(&db, "key", "value"); /* Get some value */ bp_value_t value; bp_gets(&db, "key", &value); fprintf(stdout, "%s\n", value.value); free(value.value) /* Close database */ bp_close(&db); }
One-threaded read/write (in non-empty database):
100000 items in db
write : 9865.357599 ops/sec
read : 57383.402903 ops/sec
Multi-threaded read (2 cores, 4 threads):
100000 items in db
get : 128841.821540 ops/sec
Compaction/Removal:
500000 items in db
compact: 23.143330s
remove : 16827.957592 ops/sec
And bulk insertion ~ 120000 items/sec .
make MODE=debug # build with enabled assertions make SNAPPY=0 # build without snappy (no compression will be used)
bplus-tree is freely redistributable under MIT X License.
Use of this source code is governed by a MIT license that can be found
in the LICENSE file.