论文信息 - GPERF: A Perfect Hash Function Generator

GPERF: A Perfect Hash Function Generator

Perfect hash functions are a time and space efficient implementation ofstatic search sets . A static search set is an abstract data type (ADT) with operations initialize, insert, and retrieve. Static search sets are common in system software applications. Typical static search sets include compiler and interpreter reserved words, assembler instruction mnemonics, shell interpreter built-in commands, and CORBA IDL compilers. Search set elements are called k ywords.

Douglas C. Schmidt | D. Schmidt

[1] Doug Lea,et al. libg++, The GNU C++ Library , 1988, C++ Conference.

[2] Gerhard Jaeschke. Reciprocal hashing: a method for generating minimal perfect hashing functions , 1981, CACM.

[3] Chin-Chen Chang. A scheme for constructing ordered minimal perfect hashing functions , 1986, Inf. Sci..

[4] Alan L. Tharp,et al. Near‐perfect hashing of large word sets , 1989, Softw. Pract. Exp..

[5] R. Nigel Horspool,et al. Practical Perfect Hashing , 1985, Comput. J..

[6] Curtis R. Cook,et al. A letter oriented minimal perfect hashing function , 1982, SIGP.

[7] Robert E. Tarjan,et al. Dynamic perfect hashing , 1988 .

[8] Friedhelm Meyer auf der Heide,et al. Dynamic perfect hashing: upper and lower bounds , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[9] Thomas J. Sager. A polynomial time generator for minimal perfect hash functions , 1985, CACM.

[10] Murray Hill,et al. Yacc: Yet Another Compiler-Compiler , 1978 .

[11] Richard J. Cichelli. Minimal perfect hash functions made simple , 1980, CACM.

[12] Renzo Sprugnoli,et al. Perfect hashing functions , 1977, Commun. ACM.

[13] Bjarne Stroustrup,et al. C++ Programming Language , 1986, IEEE Softw..

[14] Bjarne Stroustrup,et al. The C++ programming language (2nd ed.) , 1991 .