in reply to multiple hash compare, find, create
The fastest way to intersect two hashes are hash slices.
See Using hashes for set operations...
28 million keys sounds weird this should lead to ~ 2.8 GB of memory consumption.
Reorganizing such hashes into nested hashes is recommended if you can bundle accesses to the same sub hash.
See Re: write hash to disk after memory limit
Cheers Rolf
(addicted to the Perl Programming Language :)
Wikisyntax for the Monastery
FootballPerl is like chess, only without the dice
|
|---|