Abstract
The performance of techniques for hash tables management in paged environments is examined. Classical methods as open addressing and chaining are considered as well as some new techniques performed on doubly linked chained hash tables. A comparison and an evaluation of the efficiency of the above methods are made in regard to the average search length, the average memory access and, more important, the average page faults.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. J. Denning,Virtual Memory, Comput. Surveys2 (1970), 153–189.
P. Freeman,Software System Design (1975), SRA Chicago.
G. D. Knott,Hashing Functions, Comput J.18 (1975), 265–279.
D. F. Knuth,The Art of Computer Programming,3 Sorting and Searching, (1973), Addison Wesley, Reading.
W. D. Maureer andT. G. Lewis,Hash Table Methods, Comput. Surveys7 (1975). 5–20.
R. Morris,Scatter Storage Techniques, Comm. ACM11 (1968), 38–44.
P. Brinch Hansen,Operating Systems Principles, (1973), Prentice Hall, Engelwood Cliffs.
W. W. Peterson,Addressing for Random-access Storage, IBM J. Res. Develop.1 (1975), 130–146.
R. L. Rivest,On Self-organizing Sequential Heuristics, Comm. ACM19 (1976), 63–67.
N. Santoro,Full Table Search by Polynomial Functions, Information Processing Lett5 (1976), 72–74.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Romani, F., Santoro, N. On hash techniques in a paged environment. Calcolo 16, 289–303 (1979). https://doi.org/10.1007/BF02575931
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02575931