btree4j

A efficient B+-tree implementation written in pure Java

License

License

GroupId

GroupId

io.github.myui
ArtifactId

ArtifactId

btree4j
Last Version

Last Version

0.9.1
Release Date

Release Date

Type

Type

jar
Description

Description

btree4j
A efficient B+-tree implementation written in pure Java
Project URL

Project URL

https://github.com/myui/btree4j
Project Organization

Project Organization

Makoto Yui
Source Code Management

Source Code Management

https://github.com/myui/btree4j

Download btree4j

How to add to project

<!-- https://jarcasting.com/artifacts/io.github.myui/btree4j/ -->
<dependency>
    <groupId>io.github.myui</groupId>
    <artifactId>btree4j</artifactId>
    <version>0.9.1</version>
</dependency>
// https://jarcasting.com/artifacts/io.github.myui/btree4j/
implementation 'io.github.myui:btree4j:0.9.1'
// https://jarcasting.com/artifacts/io.github.myui/btree4j/
implementation ("io.github.myui:btree4j:0.9.1")
'io.github.myui:btree4j:jar:0.9.1'
<dependency org="io.github.myui" name="btree4j" rev="0.9.1">
  <artifact name="btree4j" type="jar" />
</dependency>
@Grapes(
@Grab(group='io.github.myui', module='btree4j', version='0.9.1')
)
libraryDependencies += "io.github.myui" % "btree4j" % "0.9.1"
[io.github.myui/btree4j "0.9.1"]

Dependencies

compile (3)

Group / Artifact Type Version
log4j : log4j jar 1.2.17
commons-cli : commons-cli jar 1.2
commons-logging : commons-logging jar 1.0.4

provided (1)

Group / Artifact Type Version
com.google.code.findbugs : jsr305 jar 3.0.2

test (3)

Group / Artifact Type Version
junit : junit jar 4.12
org.openjdk.jmh : jmh-core jar 1.20
org.openjdk.jmh : jmh-generator-annprocess jar 1.20

Project Modules

There are no modules declared in this project.

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.1</version>
</dependency>

Find usage in unit tests.

Features and Strength

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

  • Implementes Prefix B+-tree in which prefixes are selected carefully to minimize their length. In prefix B+-tree, key prefixes are managed by a TRIE-like smart algorithm.

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.

Versions

Version
0.9.1
0.9.0