System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

Reducing the storage requirements of a perfect hash function

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Di Felice, P. ; Dept. of Electr. Eng., l'Aquila Univ.

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 paper gives empirical evidence about the effectiveness of a strategy that is suitable for significantly reducing the memory requirements of the order-preserving minimal perfect hash function proposed by Z.J. Czech et al. (Inf. Proc. Lett., vol. 43, pp. 257-64, Oct. 1992)

Published in:

Knowledge and Data Engineering, IEEE Transactions on  (Volume:10 ,  Issue: 6 )