Just a note

[Thomas Weholt]

> Also, please have a look at bplustree.py which
> provides many of the advantages of berkeley db but in a pure python
> implementation.

And once again the re-occurring question when talking about pure python
implementations of things like these :

1. speed ??
2. size ??

Like I mentioned I`ll be storing huge amounts of data. HUGE !!! Not huge
entries/pickled objects, but many small. It`s my impression that pure
python approaches to problems like this ( I`m thinking of pickle vs.
cPickle) is slow when compared to similar solutions programmed in C/C++.

Thomas