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.
On hash techniques in a paged environment
1980
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_421769-doc_149824.pdf
solo utenti autorizzati
Descrizione: On hash techniques in a paged environment
Tipologia:
Versione Editoriale (PDF)
Dimensione
1.94 MB
Formato
Adobe PDF
|
1.94 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
