Affiliation:
1. Heidelberg Scientific Center, Niederlassung Heidelberg, Germany
Abstract
A method is presented for building minimal perfect hash functions, i.e., functions which allow single probe retrieval from minimally sized tables of identifier sets. A proof of existence for minimal perfect hash functions of a special type (reciprocal type) is given. Two algorithms for determining hash functions of reciprocal type are presented and their practical limitations are discussed. Further, some application results are given and compared with those of earlier approaches for perfect hashing.
Publisher
Association for Computing Machinery (ACM)
Reference7 articles.
1. Minimal perfect hash functions made simple
2. The external language KLIPA for the URAL-2 digital computer
3. Jaeschke G. Minimal perfect hashing. Tech. Rept. TR 80.02.003 IBM Heidelberg Scientific Center Niederlassung Heidelberg Germany. Jaeschke G. Minimal perfect hashing. Tech. Rept. TR 80.02.003 IBM Heidelberg Scientific Center Niederlassung Heidelberg Germany.
4. Hashing functions
Cited by
57 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献