Issue No. 06 - November/December (1998 vol. 10)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.738363
<p><b>Abstract</b>—The <it>amount of memory</it> required by <it>perfect hash functions</it> at retrieval time is one of the primary issues to be taken into account when looking for such functions. This correspondence gives empirical evidence about the effectiveness of a strategy suitable to significantly reduce the memory requirements of the <it>order preserving minimal perfect hash function</it> proposed by Czech et al. [<ref rid="bibk10053" type="bib">3</ref>].</p>
Perfect hash function, memory requirements, array packing.
Paolino Di Felice, Ugo Madama, "Reducing the Storage Requirements of a Perfect Hash Function", IEEE Transactions on Knowledge & Data Engineering, vol. 10, no. , pp. 1005-1007, November/December 1998, doi:10.1109/69.738363