Geek Answers Handbook

Finding a disk-bound b-tree example

Maybe my google-foo is simply not up to the tobacco, but I want to play with the b-tree alogory tied to the disk. Since most of the training programs and examples are in RAM, they assume RAM, in which changing the nodes in the tree is quite simple, but instead of intensively rewriting I / O or using memory-mapped files, I can't think of a good approach.

The theory would be fine, C # or Java would be even better.

EDIT: Sorry for the lack of clarity. I am not looking for a product or code base to use, but an example or illustrative code base to better understand how I could build a b-tree with disk support.

+5
source share
2 answers

One of the fastest key databases (which also contains a key database that works with B + Trees) is the Tokyo cabinet (or the Kyoto cabinet) :). I worked with it when I compared B + Trees, and the code is easy to understand. It is written in C, but also has Java bindings ... Tokyo office: http://fallabs.com/tokyocabinet/

And Berkley DB also works with the B + tree. However, when I tested the Berkley DB, it was very slow compared to the Tokyo cabinet, though ... http://www.oracle.com/technetwork/database/berkeleydb/overview/index.html

+2
source

First, see the top 2, 3, 4, and 5 google results .

-, stackoverflow .

-, MSSQL , , ( , , ). MSSQL, , , , 8k = .

-, . , , , , .

+1

More articles:


All Articles