Practical minimal perfect hash functions for large databases
- 2 January 1992
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 35 (1) , 105-121
- https://doi.org/10.1145/129617.129623
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Order-preserving minimal perfect hash functions and information retrievalACM Transactions on Information Systems, 1991
- Near-perfect hashing of large word setsSoftware: Practice and Experience, 1989
- File organization using composite perfect hashingACM Transactions on Database Systems, 1989
- Dynamic hashing schemesACM Computing Surveys, 1988
- Letter-oriented reciprocal hashing schemeInformation Sciences, 1986
- The study of an ordered minimal perfect hashing schemeCommunications of the ACM, 1984
- Reciprocal hashingCommunications of the ACM, 1981
- Minimal perfect hash functions made simpleCommunications of the ACM, 1980
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- Perfect hashing functionsCommunications of the ACM, 1977