From: Martin Ankerl <martin.ankerl@...>
Date: 2005-05-11T15:05:27+09:00
Subject: Re: String Hashing Algorithms

> At work, we have some (young) code which is currently doing a lot of
> string compares, which needs to be really fast. We're about to try
> using hashes of the strings to represent each string instead, but
> instead of a traditional hash table (which 'chains' collisions for the
> same key) we're going to require that no two (different) strings may
> share the same hash key.

If you know all possible strings in advance, you might want to generate 
a perfect hash:
http://burtleburtle.net/bob/hash/perfect.html

martinus