You could also try using a key-value store.
I am using pytc, a Python API for Tokyo Cabinet. It seems to figure
out quite nicely when to go to disk, and when to use memory. But I
have not done extensive tests.
Here is some example code for using pytc:
http://github.com/turian/pytc-example/tree/m
On Jun 29, 9:13 am, mclovin wrote:
> Is there something like it that is more flexible?
Have you seen the stdlib module 'shelve'?
http://docs.python.org/library/shelve.html
It creates a persistent file-based dictionary, which can hold any type
of object as long as it can be pickled.
I really li
In article <9efff087-bd6e-49fb-ad30-a955a64b8...@j32g2000yqh.googlegroups.com>,
mclovin wrote:
>
>I need to have a dictionary of about 8 gigs (well the data it is
>processing is around 4gb). so naturally i am running into memory
>errors.
>
>So i looked around and found bsddb which acts like a dic
Hello all,
I need to have a dictionary of about 8 gigs (well the data it is
processing is around 4gb). so naturally i am running into memory
errors.
So i looked around and found bsddb which acts like a dictionary object
only offloads the data from the RAM to the HDD, however that only
supports st
