Big dictionary manipulation

[Alan Kennedy]

Thomas Güttler:

>> Objects are passed by reference in python. You only get problems
>> if your structure is bigger than your physical memory. If that's the
>> case, you can have a look at BTrees.

Jason Creighton:

> LOL! BTrees can be bigger than your phsical memory? :-)

What's funny about that?

BTrees can be as large as you can find storage for. To conduct any operation
with btrees, i.e. insertion, deletion, only requires that you have a single node
of the tree in memory at a time. They are used all the time in relational
databases, for example.

Perhaps you're confusing btrees with their less sophisticated cousins, "binary
trees"?

http://www.wikipedia.org/wiki/Binary_tree
http://www.wikipedia.org/wiki/B-tree

And even if you were, your comments don't apply to binary trees either. Any
node-base structure such as a tree can be made to work from disk instead of
memory.

regards,

-- 
alan kennedy
-----------------------------------------------------
check http headers here: http://xhaus.com/headers
email alan:              http://xhaus.com/mailto/alan