in reply to Best way to look-up a string amongst 100 million of its peers

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.

  • Comment on Re: Best way to look-up a string amongst 100 million of its peers