The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental 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
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
Analysis of the Search Performance of Coalesced Hashing
Journal of the ACM (JACM)
Handling identifies as internal symbols in language processors
Communications of the ACM
Database Design
The analysis of hashing algorithms.
The analysis of hashing algorithms.
Analysis of coalesced hashing
Analysis of new variants of coalesced hashing
ACM Transactions on Database Systems (TODS)
A probability model for overflow sufficiency in small hash tables
Communications of the ACM
The P2 algorithm for dynamic calculation of quantiles and histograms without storing observations
Communications of the ACM
IBM Systems Journal
A compendium of key search references
ACM SIGIR Forum
Analysis of the Search Performance of Coalesced Hashing
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Data structures from an empirical standpoint
Journal of Computing Sciences in Colleges
| Hi-index | 48.25 |
The coalesced hashing method is one of the faster searching methods known today. This paper is a practical study of coalesced hashing for use by those who intend to implement or further study the algorithm. Techniques are developed for tuning an important parameter that relates the sizes of the address region and the cellar in order to optimize the average running times of different implementations. A value for the parameter is reported that works well in most cases. Detailed graphs explain how the parameter can be tuned further to meet specific needs. The resulting tuned algorithm outperforms several well-known methods including standard coalesced hashing, separate (or direct) chaining, linear probing, and double hashing. A variety of related methods are also analyzed including deletion algorithms, a new and improved insertion strategy called varied-insertion, and applications to external searching on secondary storage devices.