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

Something like DBM::Deep or even plain old DB_File should be able to handle this pretty well. Read the list in once, create the hash on disk, and then you can query it fairly quickly without ever having to read the original list again.

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

Replies are listed 'Best First'.
Re^2: Best way to look-up a string amongst 100 million of its peers by Anonymous Monk on Mar 26, 2008 at 06:42 UTC
DBM::Deep is definetly the wrong choice	[reply]
Re^3: Best way to look-up a string amongst 100 million of its peers by BrowserUk (Patriarch) on Mar 26, 2008 at 07:30 UTC
I'm not saying you are wrong, but would you care to elaborate why? Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error. "Science is about questioning the status quo. Questioning authority". In the absence of evidence, opinion is indistinguishable from prejudice. "Too many [] have been sedated by an oppressive environment of political correctness and risk aversion."	[reply]