This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Study of a New Perfect Hash Scheme
May 1983 (vol. 9 no. 3)
pp. 305-313
M.W. Du, Institute of Computer Engineering, National Chiao Tung University
A new approach is proposed for the design of perfect hash functions. The algorithms developed can be effectively applied to key sets of large size. The basic ideas employed in the construction are rehash and segmentation. Analytic results are given which are applicable when problem sizes are small. Extensive experiments have been performed to test the approach for problems of larger size.
Index Terms:
segmentation, Hashing, perfect hash functions, rehash
Citation:
M.W. Du, T.M. Hsieh, K.F. Jea, D.W. Shieh, "The Study of a New Perfect Hash Scheme," IEEE Transactions on Software Engineering, vol. 9, no. 3, pp. 305-313, May 1983, doi:10.1109/TSE.1983.236866
Usage of this product signifies your acceptance of the Terms of Use.