Loading...
Optimum Algorithms for a Model of Direct Chaining
Vitter, Jeffrey Scott Chen, Wen-Chin
Vitter, Jeffrey Scott
Chen, Wen-Chin
Citations
Altmetric:
Abstract
Direct chaining is a popular and efficient class of hashing algorithms. In this paper we study
optimum algorithms among direct chaining methods, under the restrictions that the records in the hash table are not moved after they are inserted, that for each chain the relative ordering of the records in the chain does not change after more insertions, and that only one link field is used per table slot. The varied-insertion coalesced hashing method (VICH), which is proposed and analyzed in [CV84], is conjectured to be optimum
among all direct chaining algorithms in this class. We give strong evidence in favor of the conjecture by showing that VICH is optimum under fairly general conditions.
Description
Date
1985-05
Journal Title
Journal ISSN
Volume Title
Publisher
Society for Industrial and Applied Mathematics
Research Projects
Organizational Units
Journal Issue
Keywords
Algorithm analysis, Searching, Information retrieval, Hashing, Coalesced hashing, Data structures, Optimality
Citation
J. S. Vitter and W.-C. Chen. “Optimum Algorithms for a Model of Direct Chaining,” SIAM Journal on Computing, 14(2), May 1985, 490–499. http://dx.doi.org/10.1137/0214036