• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

A Perfect Hash Function Generator

Cached

  • Download as a PDF

Download Links

  • [128.252.165.44]
  • [www.cs.wustl.edu]
  • [www.informatik.uni-siegen.de]
  • [www.cs.wustl.edu]
  • [www.lads.com]
  • [sunsite.bcc.bilkent.edu.tr]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Douglas Schmidt Schmidt
Citations:49 - 34 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Schmidt_aperfect,
    author = {Douglas Schmidt Schmidt},
    title = {A Perfect Hash Function Generator},
    year = {}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

gperf is a "software-tool generating-tool" designed to automate the generation of perfect hash functions. This paper describes the features, algorithms, and object-oriented design and implementation strategies incorporated in gperf.Italso presents the results from an empirical comparison between gperf-generated recognizers and other popular techniques for reserved word lookup. gperf is distributed with the GNU libg++ library and is used to generate the keyword recognizers for the GNU C and GNU C++ compilers. 1 Introduction Perfect hash functions are a time and space efficient implementation of static search sets, which are ADTs with operations like initialize, insert,andretrieve. Static search sets are common in system software applications. Typical static search sets include compiler and interpreter reserved words, assembler instruction mnemonics, and shell interpreter builtin commands. Search set elements are called keywords.Key- words are inserted into the set once, usually at c...

Citations

4647 Design Patterns: Elements of Reusable Object-Oriented Software - Gamma, Helm, et al. - 1994
130 ACE: an object-oriented framework for developing distributed applications - Schmidt - 1994
123 Dynamic perfect hashing: Upper and lower bounds - Dietzfelbinger, Karlin, et al. - 1994
95 The C++ Programming Language, 2nd edition - Stroustrup - 1991
83 The C++ Programming Language, 3rd Edition - Stroustrup - 1997
74 Using and porting - Stallman - 1993
46 Evaluating the Performance of Demultiplexing Strategies for Real-time CORBA - Gokhale, Schmidt - 1997
17 Perfect hashing functions: a single probe retrieving method for static sets - Sprugnoli - 1977
16 libg++, the GNU C++ library - Lea - 1988
15 Minimal Perfect Hash Functions Made Simple - Cichelli - 1980
13 A polynomial time generator for minimal perfect hash functions - SAGER - 1985
7 Reciprocal Hashing: A Method for Generating Minimal Perfect Hashing Functions - Jaeschke - 1981
6 A letter oriented minimal perfect hashing function - Cook, Oldehoeft - 1982
5 Practical Perfect Hashing - Cormack, Horspool, et al. - 1985
3 Using tries to eliminate pattern collisions in perfect hashing - Tharp, Brain - 1994
3 Dynamic Perfect Hashing - Dietzfelbinger, Karlin, et al. - 1994
2 The Art of Computer Programming, vol. 1: Searching and Sorting - Knuth - 1973
2 Near-perfect Hashing of Large Word Sets - Brain, Tharp - 1989
2 Tools for Automating the Migration from DCE to CORBA - Gokhale, Schmidt, et al. - 1997
1 A Letter Oriented Minimal Perfect Hashing - Cook, Oldehoeft - 1982
1 A Scheme for Constructing Ordered Minimal Perfect Hashing Functions - Chang - 1986
1 GPERF: A Perfect HashFunction Generator - Schmidt - 1990
1 A Polynomial Time Generator for Minimal Perfect Hash Functions - Kegler - 1986
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University