Analysis of New Variants of Coalesced Hashing.
Wen-Chin Chen, Jeffrey Scott Vitter:
Analysis of New Variants of Coalesced Hashing.
ACM Trans. Database Syst. 9(4): 616-645(1984)@article{DBLP:journals/tods/ChenV84,
author = {Wen-Chin Chen and
Jeffrey Scott Vitter},
title = {Analysis of New Variants of Coalesced Hashing},
journal = {ACM Trans. Database Syst.},
volume = {9},
number = {4},
year = {1984},
pages = {616-645},
ee = {http://doi.acm.org/10.1145/1994.2205, db/journals/tods/ChenV84.html},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
Abstract
The coalesced hashing method has been shown to be very fast for dynamic information
storage and retrieval. This paper analyzes in a uniform way the performance of
coalesced hashing and its variants, thus settling some open questions in the literature.
In all the variants, the range of the hash function is called the address region, and
extra space reserved for storing colliders is called the cellar. We refer to the
unmodified method, which was analyzed previously, as late-insertion coalesced hashing.
In this paper we analyze late insertion and two new variations called early insertion
and varied insertion. When there is no cellar, the early-insertion method is better
than late insertion; however, past experience has indicated that it might be worse when
there is a cellar. Our analysis confirms that it is worse. The varied-insertion method
was introduced as a means of combining the advantages of late insertion and early
insertion. This paper shows that varied insertion requires fewer probes per search,
on the average, than do the other variants.
Each of these three coalesced hashing methods has a parameter that relates the sizes
of the address region and the cellar. Techniques in this paper are designed for tuning
the parameter in order to achieve optimum search times. We conclude with a list
of open problems.
Copyright © 1984 by the ACM,
Inc., used by permission. Permission to make
digital or hard copies is granted provided that
copies are not made or distributed for profit or
direct commercial advantage, and that copies show
this notice on the first page or initial screen of
a display along with the full citation.
CDROM Version: Load the CDROM "Volume 3 Issue 1, TODS 1976-1990" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 2" and ...
BibTeX
Addendum
Wen-Chin Chen, Jeffrey Scott Vitter:
Addendum to "Analysis of Some New Variants of Coalesced Hashing".
ACM Trans. Database Syst. 10(1): 127(1985) BibTeX
References
- [1]
- Wen-Chin Chen, Jeffrey Scott Vitter:
Analysis of Early-Insertion Standard Coalesced Hashing.
SIAM J. Comput. 12(4): 667-676(1983) BibTeX
- [2]
- ...
- [3]
- ...
- [4]
- Gary D. Knott:
Direct-Chaining with Coalescing Lists.
J. Algorithms 5(1): 7-21(1984) BibTeX
- [5]
- Donald E. Knuth:
The Art of Computer Programming, Volume III: Sorting and Searching.
Addison-Wesley 1973, ISBN 0-201-03803-X
BibTeX
- [6]
- Jeffrey Scott Vitter, Wen-Chin Chen:
Optimum Algorithms for a Model of Direct Chaining.
SIAM J. Comput. 14(2): 490-499(1985) BibTeX
- [7]
- Jeffrey Scott Vitter:
Deletion Algorithms for Hashing That Preserve Randomness.
J. Algorithms 3(3): 261-275(1982) BibTeX
- [8]
- Jeffrey Scott Vitter:
Implementations for Coalesced Hashing.
Commun. ACM 25(12): 911-926(1982) BibTeX
- [9]
- Jeffrey Scott Vitter:
Analysis of the Search Performance of Coalesced Hashing.
J. ACM 30(2): 231-258(1983) BibTeX
- [10]
- Francis A. Williams:
Handling Identifiers as Internal Symbols in Language Processors.
Commun. ACM 2(6): 21-24(1959) BibTeX
Referenced by
- William D. Ruchte, Alan L. Tharp:
Linear Hashing with Priority Splitting: A Method for Improving the Retrieval Performance of Linear Hashing.
ICDE 1987: 2-9
- Wen-Chin Chen, Jeffrey Scott Vitter:
Addendum to "Analysis of Some New Variants of Coalesced Hashing".
ACM Trans. Database Syst. 10(1): 127(1985)
BibTeX
ACM SIGMOD Anthology - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
TODS, ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Tue Jun 24 18:38:55 2008