Does anyone know where to find a B+Tree on-disk implementation? I went through google forward and backward and unfortunately I couldn't find anything sensible. Other threads have suggested to maybe take the tree from sqlite, sqljet or bdb but these trees are nested in the whole database and you can't really "just" filter out the B+Tree. I'm really looking for only a on-disk B+Tree... without any fancy things around.
8
votes
That's all I found - bplusdotnet.sourceforge.net - just because nobody answered so far and can't tell, if this is a on-disk implementation or if it can be adapted to be one. (It says '.NET' but there is a java implementation too!)
- Andreas Dolk
thanks for your link! looks quite good. at least it has created some files on disk when I run the test tree file. I will give a feedback after having a deeper look into it.
- mkn
3 Answers
6
votes
5
votes
I've implemented disk-based B+-tree in the past. https://github.com/myui/xbird/blob/master/xbird-open/main/src/java/xbird/storage/index/BIndexFile.java
Find usage in https://github.com/myui/xbird/blob/master/xbird-open/main/test/java/xbird/storage/index/BIndexMultiValueFileTest.java
1
votes
If you need it for real usage rather than for educational purposes (studying B+Tree data structure, etc.), LMDBJava is probably the best solution, available in Java now. It's not B+Tree exactly, but also a sorted key-value store, so practically the same as B+Tree.
