Implement a presistent B-Tree

I'm interested to implement a presistent B-Tree using either c++ or java, as I need to store some path expressions e.g. //scientist/person/... /[Albert Einstein].

I tried goo开发者_如何学Gogle, but I was not satisfied. Some hints on this would be very helpful, or any ideas as where to start with. The BTree must be stored on the the disk however.

Avoid using pointers, instead use index from a base address. This way you can simply mmap the btree into memory and use the base address along with the index as a lookup.

If using windows look at mapview of file instead.

Did you look at qdbm?