Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re^2: Optimizing Iterating over a giant hash

by patrick.j (Acolyte)
on May 23, 2010 at 17:19 UTC ( #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

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://841272]
help
Chatterbox?
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (5)
As of 2016-12-10 10:57 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    On a regular basis, I'm most likely to spy upon:













    Results (161 votes). Check out past polls.