How should I go about optimizing a hash table for a given population?
<p>Say I have a population of key-value pairs which I plan to store in a hash table.  The population is fixed and will never change.  What optimizations are available to me to make the hash table as fast as possible?  Which optimizations should I concentrate on?  This is assuming I have a lot of space.  There will be a reasonable number of pairs (say no more than 100,000).</p>

<p><strong>EDIT:</strong> I want to optimize look up.  I don't care how long it takes to build.</p>
