|
|
|
| Come for the quick hacks, stay for the epiphanies. | |
| PerlMonks |
Re: Best way to look-up a string amongst 100 million of its peersby akho (Hermit) |
| on Mar 25, 2008 at 20:58 UTC ( [id://676240]=note: print w/replies, xml ) | Need Help?? |
|
Bloom filters may be of use; you will need to check all positive answers in some other way (or rely on probabilities), but they may speed up the process.
A CPAN search yields several implementations, yet I am not familiar with any of them.
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||