The simplest thing that could possible work would be to create a hash tied to a file and read it all into that. That is so simple that you can very quickly assess whether that solution is fast enough or not.
In reply to Re: Best way to look-up a string amongst 100 million of its peers
by stiller
in thread Best way to look-up a string amongst 100 million of its peers
by anson
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |