btree4j: Disk-based Prefix B+-tree written in Pure Java ======================================================= Donate Build Status License Maven Central

What's Btree4j

Btree4j is a disk-based Prefix B+-tree written in Pure Java.

It's pretty fast and 100k ops/sec is expected even on laptop.

Using btree4j

<dependency>
    <groupId>io.github.myui</groupId>
    <artifactId>btree4j</artifactId>
    <version>0.9.0</version>
</dependency>

Find usage in unit tests.

Features and Strength

Applied many improvements over the original Xindice's implementation as follows:

Rudolf Bayer and Karl Unterauer. "Prefix B-trees", Proc. ACM Trans. Database Syst. 2, 1, pp.11-26), March 1977. [DOI]

Sponsors

No sponsors yet. Will you be the first?

GitHub Sponsors donate button

It will be my motivation to continue working on this project.

Credits

Copyright 2006 and onwards Makoto Yui
Copyright 1999-2007 The Apache Software Foundation

This software is originally developed for XBird based on Apache Xindice.