Statistical behavior of fast hashing of variable length test strings

Authors:
Jacques Savoy
Affiliations:
-
Venue:
ACM SIGIR Forum
Year:
1990

Citing 11
Cited 0

File organization for database design

File organization for database design
Fast hashing of variable-length text strings

Communications of the ACM
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Minimal perfect hash functions made simple

Communications of the ACM
Perfect hashing functions: a single probe retrieving method for static sets

Communications of the ACM
Additional results on key-to-address transform techniques: a fundamental performance study on large existing formatted files

Communications of the ACM
Key-to-address transform techniques: a fundamental performance study on large existing formatted files

Communications of the ACM
The linear quotient hash code

Communications of the ACM
Data Structure Techniques

Data Structure Techniques
Smalltalk-80: The Language

Smalltalk-80: The Language

Quantified Score

Hi-index	0.00

Visualization

Abstract

In information retrieval, we often have to store and search for a particular record into a large amount of information. For example, during a document indexing process or when a program is trying to spell a text, a dictionary has to be used in an efficient way. A solution to that problem resides in using a hash table. However, if we known many algorithms for manipulating or accessing hash tables [Knuth 73], [Standish 80], [Wiederhold 87], the main problem is to define a "good" hash function for a variable-length string. In order to answer that question our main goals are to present some concrete algorithms and to study their statistical behavior.