Reducing the storage requirements of a perfect hash function

Authors
Di Felice, P Madama, U
Citation
P. Di Felice et U. Madama, Reducing the storage requirements of a perfect hash function, IEEE KNOWL, 10(6), 1998, pp. 1005-1007
Citations number
4
Categorie Soggetti
AI Robotics and Automatic Control
Journal title
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
ISSN journal
10414347 → ACNP
Volume
10
Issue
6
Year of publication
1998
Pages
1005 - 1007
Database
ISI
SICI code
1041-4347(199811/12)10:6<1005:RTSROA>2.0.ZU;2-I
Abstract
The amount of memory required by perfect hash functions at retrieval time i s one of the primary issues to be taken into account when looking for such functions. This correspondence gives empirical evidence about the effective ness of a strategy suitable to significantly reduce the memory requirements of the order preserving minimal perfect hash function proposed by Czech et at. [3].