Not enough information.
Just the existance in your list or is there some associated piece of data?
Will they be completely random? Or will they come in related bunches?
A single instance of a long running application doing thoudands of lookups per run.
Many concurrent instances doing one or a dozen lookups per invocation; eg. a CGI?
The obvious answer is "as fast as possible", but for example, in a cgi app, there are inherent network delays of up to a few seconds, so if (the one or dozen) lookups per run takes milliseconds rather microseconds, your users will not notice.
On the other hand, if the user has to wait for 50,000 lookups, the difference would be significant.
Can that format change?
In reply to Re: Best way to look-up a string amongst 100 million of its peers
by BrowserUk
in thread Best way to look-up a string amongst 100 million of its peers
by anson
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |