Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
G. Jaeschke (1981) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: