btree4j
btree4j copied to clipboard
Disk-based B+-tree written in Pure Java
Bumps [junit](https://github.com/junit-team/junit4) from 4.12 to 4.13.1. Release notes Sourced from junit's releases. JUnit 4.13.1 Please refer to the release notes for details. JUnit 4.13 Please refer to the release notes...
Why don't you remove unnecessary nodes when they become under-occupied? How are you going to deal with a large number of useless branch nodes in tree?
[BTreeNode.write](https://github.com/myui/btree4j/blob/master/src/main/java/btree4j/BTree.java#L1019) and read operation should be atomic for a better Durability (sudden shutdown etc). To do that, undo log is required.
Since log4j is deprecated, use SLF4j or java.util.logging for the logging scheme.
The only thing that remained is that the _getFirstNode_ method doesn't let go of nodes properly. Which prevents them from being cleared of the tree and produces memory leak. I...
This feature adds the ability to delete all values greater than or equal to a specified value. Its time complexity is of O(log(n)).
Change the package structure as - top-level - core - memcache Based on my past work https://github.com/myui/gridool/tree/master/gridool/src/memcached/src/gridool/memcached or https://github.com/netty/netty/tree/master/codec-memcache/src/main/java/io/netty/handler/codec/memcache https://github.com/couchbase/couchbase-jvm-core/tree/master/src/main/java/com/couchbase/client/deps/io/netty/handler/codec/memcache
why need convert to byte ? since 129 convert to -127. how to identify 129 and -127 ?
for (int i = 0; i < 1000; i++) { Value k = new Value(i); btree.addValue(k, i); } IndexConditionBW bw = new IndexConditionBW(new Value(100), new Value(128)); btree.search(bw, callback) will throw...