Fast Hashing of Variable-Length Text Strings

Communications of the ACM

Volumn 33, Issue 6, 1990, Pages 677-680

  Pearson, Peter K ^a  

^a LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

Author keywords

scatter; storage

Indexed keywords

DATA PROCESSING--DATA REDUCTION AND ANALYSIS; DATA STORAGE, DIGITAL--EFFICIENCY;

CONTENT ANALYSIS; CRYPTOGRAPHIC CHECKSUMS; HASHING FUNCTIONS; MESSAGE AUTHENTICATION CODES; SCATTER STORAGE;

COMPUTER PROGRAMMING;

EID: 0025436178     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/78973.78978     Document Type: Article

References (6)

1. Cichelli, R. J. Minimal perfect hash functions made simple. Commun. ACM 23, 1 (Jan. 1980), 17.
2. Knott, G. D. Hashing functions. Comput. J. 18, 3 (1974), 265-278.
3. Knuth, D. E. The Art of Computer Programming. Vol. III, Searching and Sorting. Addison-Wesley, Reading, Mass., 1973.
4. Meyer, C., and Matyas, S. Cryptography. John Wiley & Sons, New York, 1982.
5. Sprugnoli, R. Perfect hashing functions: A single probe retrieving method for static sets. Commun. ACM 20, 11 (Nov. 1977), 841.
6. Ullman, J. D. A note on the efficiency of hashing functions. J. ACM 19, 3 (July 1972), 569-575.