Re^4: Memory overhead of blessed hashes

> If the hash table is large enough, and accesses do not result in scanning the entire table, portions of the hash table can be swapped out by the OS, even if other parts of the table are held in memory due to frequent access.

Well in theory, but if it comes to hashes that's pretty unlikely.

If one part of a hash is much more frequently accessed than another one, then the hashing function can't be very good.

Or it's always only the same key. :)

Anyway I once had stunning results after transforming a giant hash into a two tier HoH and letting the algorithm concentrating on always a very small group of second tier hashes.

Cheers Rolf
_{(addicted to the Perl Programming Language :)

Wikisyntax for the Monastery}

Comment on Re^4: Memory overhead of blessed hashes