Abstract
A new search method in hash table is presented: collisions are resolved by a pseudorandom function depending on the key, in such a way that the search is free from clustering and at a comparable cost with respect to previous methods.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Bibliografia
A. F. Ackermann,Quadratic search for hash tables of size p n, Comm. ACM (17)3 (1974), 164.
J. R. Bell,The quadratic quotient method: a hash code eliminating secondary clustering, Comm. ACM (13)2 (1970), 107–109.
J. R. Bell, C. H. Kaman,The linear quotient hash code, Comm. ACM (13)11 (1970), 675–677.
A. C. Day,Full table quadratic searching for scatter storage, Comm. ACM (13)8 (1970), 481–482.
D. E. Knuth,The art of computer programming, Vol. II; Seminumerical algorithms, (1969), Addison-Wesley, Reading, Mass.
D. E. Knuth,The art of computer programming, Voll. III: Sorting and searching, (1973), Addison-Wesley, Reading, Mass.
D. H. Lehmer,Proc. 2nd Symposium on large-scale digital computing machinery, (1951), Harvard University Press, Cambridge.
F. Luccio,Weighted increment linear search for scatter tables, Comm. ACM (14)4 (1971), 1045–1047.
W. D. Maurer, T. G. Lewis,Hash table methods, Comput. Surveys, (7)1 (1975), 5–19.
R. Morris,Scatter storage techniques, Comm. ACM (11)1 (1968), 38–43.
C. E. Radke,The use of quadratic residue research, Comm. ACM (13)2 (1970), 103–105.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ancona, M., Antoy, S. Ricerca random pesata in tavole hash. Calcolo 15, 225–231 (1978). https://doi.org/10.1007/BF02575914
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02575914