The Study of a New Perfect Hash Scheme
- 1 May 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-9 (3) , 305-313
- https://doi.org/10.1109/tse.1983.236866
Abstract
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.Keywords
This publication has 15 references indexed in Scilit:
- The Study of a New Perfect Hash SchemeIEEE Transactions on Software Engineering, 1983
- Reciprocal hashingCommunications of the ACM, 1981
- Minimal perfect hash functions made simpleCommunications of the ACM, 1980
- Hash Table MethodsACM Computing Surveys, 1975
- Key-to-address transform techniquesCommunications of the ACM, 1971
- Random access file organization for indirectly addressed recordsPublished by Association for Computing Machinery (ACM) ,1969
- Scatter storage techniquesCommunications of the ACM, 1968
- File organization and addressingIBM Systems Journal, 1963
- An indirect chaining method for addressing on secondary keysCommunications of the ACM, 1961
- Addressing for Random-Access StorageIBM Journal of Research and Development, 1957