Abstract
A hash table is a data structure allowing for fast insertions, searches, and deletions of data items. The table itself is just an array H, and the principle of hashing is to define a function h such that h(k) produces an index to array H, where k is the key of a data item. The following examples illustrate the meaning of the terms “data item” and “key.”
Preview
Unable to display preview. Download preview PDF.
Bibliography
- Czech, Z. J., et al (1992) “An Optimal Algorithm for Generating Minimal Perfect Hash Functions,” Information Processing Letters 43:257–264.MathSciNetMATHCrossRefGoogle Scholar
- Fox, E. A. et al. (1991) “Order Preserving Minimal Perfect Hash Functions and Information Retrieval,” ACM Transactions on Information Systems 9(2):281–308.CrossRefGoogle Scholar
- Havas, G. et al. (1993) Graphs, Hypergraphs and Hashing in Proceedings of the Inter-national Workshop on Graph-Theoretic Concepts in Computer Science (WG’93), Berlin, Springer-Verlag.Google Scholar
Copyright information
© Springer Science+Business Media New York 1998