Title :
A simple perfect hashing method for static sets
Author :
Ramakrishna, M.V.
Author_Institution :
Dept. of Comput. Sci., Michigan State Univ., East Lansing, MI, USA
Abstract :
Perfect hashing refers to hashing without collisions. There are a number of methods proposed in the literature for determining perfect hashing functions for a given key set. Direct perfect hashing methods are those which do not involve auxiliary table lookup. This paper proposes a direct perfect hashing method using random functions. This method is shown to be as good as any other in performance, and simple to use
Keywords :
file organisation; key set; random functions; simple perfect hashing method; static sets; Computer science; Data structures; Information retrieval; Sorting; Table lookup;
Conference_Titel :
Computing and Information, 1992. Proceedings. ICCI '92., Fourth International Conference on
Conference_Location :
Toronto, Ont.
Print_ISBN :
0-8186-2812-X
DOI :
10.1109/ICCI.1992.227626
