Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight

Re^2: Space Efficiency of Hashes

by Anonymous Monk
on Mar 16, 2005 at 03:45 UTC ( #439852=note: print w/replies, xml ) Need Help??

in reply to Re: Space Efficiency of Hashes
in thread Space Efficiency of Hashes

Thanks (and to Joost as well): this indicates that I'll max out under 2 GB of RAM, leaving plenty free for other stuff running. I didn't think of just going ahead and testing overhead like that, but it seems a really obvious way to approach it in retrospect! Thanks for the enlightenment.

Replies are listed 'Best First'.
Re^3: Space Efficiency of Hashes
by nsome (Novice) on Mar 16, 2005 at 14:30 UTC
    You can also use Tie::SubsrHash and max memory required for you program will be around 300 MB.
      Nice approach. Fixed-sized records would never come to my mind. Correct name is Tie::SubstrHash.


Log In?

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://439852]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (4)
As of 2022-08-19 07:31 GMT
Find Nodes?
    Voting Booth?

    No recent polls found