Perfect Hash Functions for LargeWeb Repositories

We describe a new practical algorithm for finding perfect hash functions with no specifi-cation space at all, suitable for key sets ranging in size from small to very large. The method is ableto find perfect hash functions for various sizes of key sets in linear time. The perfect hash functionsproduced are optimal in terms of time (perfect) and require at most computation of h1(k) and h2(k); two simple auxiliary pseudorandom functions