Re^2: Optimizing Iterating over a giant hash


There's more than one way to do things
	PerlMonks

Re^2: Optimizing Iterating over a giant hash

by patrick.j (Acolyte)

on May 23, 2010 at 17:19 UTC ( [id://841272]=note: print w/replies, xml )

Need Help??

in reply to Re: Optimizing Iterating over a giant hash
in thread Optimizing Iterating over a giant hash

There is, on the one hand, a Core-Module Called FileDB, wich enables you to ,simply saying, put a HASH on disk, but every access to the HASH then is a Filesystem-I/O operation (wich means it is slow). There is another Module at CPAN, called BerkeleyDB, but the documentation has many TODOs in it.

Comment on Re^2: Optimizing Iterating over a giant hash

Replies are listed 'Best First'.

Re^3: Optimizing Iterating over a giant hash
by Anonymous Monk on May 23, 2010 at 21:48 UTC

There is another Module at CPAN, called BerkeleyDB, but the documentation has many TODOs in it.

The TODOs are 100% for redundant documentation. Like it says The reader is expected to be familiar with the Berkeley DB documentation. Where the interface provided here is identical to the Berkeley DB library and the... http://www.oracle.com/technology/products/berkeley-db/db/index.html

perl examples at http://search.cpan.org/dist/BerkeleyDB/MANIFEST

[reply]

In Section Seekers of Perl Wisdom