Writing a key-value store

Question

I am looking to write a Key/value store (probably in python) mostly just for experience, and because it\'s something I think that is a very useful product. I have a couple of qu

Answer 1

First up, I know this question quite old.

I'm the creator of aodbm ( http://sf.net/projects/aodbm/ ), which is a key-value store library. aodbm uses immutable B+Trees to store your data. So whenever a modification is made a new tree is appended to the end of the file. This probably sounds like a horrendous waste of space, but seeing as the vast majority of nodes from the previous tree are referenced, the overhead is actually quite low. Very little of an entire tree is kept in memory at any given time (at most O(log n)).