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.
|Autori:||Romani F; Santoro N|
|Titolo:||On Hash Techniques in a Paged Environment|
|Anno del prodotto:||1979|
|Digital Object Identifier (DOI):||10.1007/BF02575931|
|Appare nelle tipologie:||1.1 Articolo in rivista|