title: Pure Python persistent key and value based container (a hash like interface) with large file system support?
body: <p>I am looking for a (possibly) pure Python library for persistent hash table (btree or b+tree which would provide following features</p>
  
  <ol>
  <li>Large file support (possibly in terabytes)</li>
  <li>Fast enough and low memory footprint (looking for a descent balance between speed and memory)</li>
  <li>Low cost of management</li>
  <li>Reliability i.e. doesn't corrupt file once the content is written through the file system</li>
  <li>Lastly a pure Python implementation. I am OK if it has C library but I am looking for a cross platform solution</li>
  </ol>
  
  <p>I have looked into solutions like redis, shelve, tokyo cabinet. Tokyo cabinet is impressive and has a Python binding in the making at <a href="http://code.google.com/p/python-tokyocabinet/" rel="nofollow noreferrer">http://code.google.com/p/python-tokyocabinet/</a>, but its Windows port is a work in progress.</p>
  
  <p>Thanks for some good suggestions. I am currently exploring SQLite3 with Python. I got suggestions to use database engine but am more inclined towards a lean and mean persistent b+tree implementations</p>