1097-024X/asset/olbannerleft.jpg?v=1&s=2d7d001211f2c40f177a231141601e9f52afc1f3)
1097-024X/asset/olbannerright.jpg?v=1&s=3aec7891a8ba78b361ead9743adfc0b6eae6369a)
Article
Near-perfect hashing of large word sets
Article first published online: 30 OCT 2006
DOI: 10.1002/spe.4380191005
Copyright © 1989 John Wiley & Sons, Ltd
1097-024X/asset/cover.gif?v=1&s=5a70ecca2928358eca4ff75b9921d0552ffb6539 "Software: Practice and Experience")
Additional Information
How to Cite
Brain, M. D. and Tharp, A. L. (1989), Near-perfect hashing of large word sets. Software: Practice and Experience, 19: 967–978. doi: 10.1002/spe.4380191005
Publication History
- Issue published online: 30 OCT 2006
- Article first published online: 30 OCT 2006
- Manuscript Revised: 7 MAR 1989
- Manuscript Received: 19 AUG 1988
- Abstract
- References
- Cited By
Keywords:
- Perfect hashing;
- Minimal perfect hashing;
- Hashing;
- Cichelli's algorithm
Abstract
This article presents a procedure for constructing a near-perfect hashing function. The procedure, which is a modification of Cichelli's algorithm, builds the near-perfect hashing function sufficiently fast to allow larger word sets to be used than were previously possible. The improved procedure is the result of examining the original algorithm for the causes of its sluggish performance and then modifying them. In doing so an attempt was made to preserve the basic simplicity of th original algorithm. The improved performance comes at the expense of more storage. The six modifications used to improve performance are explained in detail and experimental results are given for word sets of varying sizes.