Extreamly large Hashtable

Has anyone created an extreamly large Hashtable? I need to create a
simple look up table key/value of some information.

I'm assuming that if it is in memory it will be faster then looking
this value up in a database.

The problem is I have about 4,000,000 rows of data. Assuming I have
enough memory to hold it, will a hashtable break being that large? Will
it be fast? Each row will only be about 10k in size.

Is there a better way?

Thanks,
AJS

.

Relevant Pages