Abstract
A new method for more equitable comparison of various hash table techniques is presented. It is applied to some popular techniques: open addressing, coalescent chaining and separate chaining. Another method, indexed sub-tables, is also examined with more details and shown to present some interesting features.
Similar content being viewed by others
References
C. Bays,A note on when to chain overflow items within a direct-access table, CACM vol. 16,1 (1973), 46–47.
C. Bays,Some techniques for structuring chained hash tables, The Computer Journal vol. 16,2 (1973), 126–131.
I. F. Blake and A. G. Konheim,Big buckets are (are not) better!, JACM vol. 24,4 (1977), 591–606.
R. P. Brent,Reducing the retrieval time of scatter storage techniques, CACM vol. 16,2 (1973), 105–109.
R. Devillers and G. Louchard,Hashing techniques — a global approach, Technical Report 67, Laboratoire d'Informatique Théorique, Université Libre de Bruxelles, Brussels, Belgium.
J. A. Feldman and J. R. Low,Comment on Brent's scatter storage algorithm, CACM vol. 16,11 (1973), 703.
D. E. Knuth,The Art of Computer Programming, vol. 3:Sorting and Searching, Addison-Wesley (1973).
F. A. Williams,Handling identifiers as internal symbols in language processors, CACM vol. 2,6 (1959), 21–24.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Devillers, R., Louchard, G. Hashing techniques, a global approach. BIT 19, 302–311 (1979). https://doi.org/10.1007/BF01930984
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01930984