This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Reducing the Storage Requirements of a Perfect Hash Function
November/December 1998 (vol. 10 no. 6)
pp. 1005-1007

Abstract—The amount of memory required by perfect hash functions 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 order preserving minimal perfect hash function proposed by Czech et al. [3].

[1] M.D. Brain and A.L. Tharp, "Using Tries to Eliminate Pattern Collisions in Perfect Hashing," IEEE Trans. Knowledge and Data Eng., vol. 6, no. 2, pp. 239-247, Apr. 1994.
[2] M.D. Brain and A.L. Tharp, "Perfect Hashing Using Sparse Matrix Packing," Information Systems, vol. 15, no. 3, pp. 281-290, Fall 1990.
[3] Z.J. Czech, G. Havas, and B.S. Majewski, "An Optimal Algorithm for Generating Minimal Perfect Hash Functions," Information Processing Letters, vol. 43, pp. 257-264, Oct. 1992.
[4] Grolier Multimedia Encyclopedia, version 7.03, Grolier Electronic Publishing, 1995.

Index Terms:
Perfect hash function, memory requirements, array packing.
Citation:
Paolino Di Felice, Ugo Madama, "Reducing the Storage Requirements of a Perfect Hash Function," IEEE Transactions on Knowledge and Data Engineering, vol. 10, no. 6, pp. 1005-1007, Nov.-Dec. 1998, doi:10.1109/69.738363
Usage of this product signifies your acceptance of the Terms of Use.