The problem of the design and implementation of parallel metric tree indexes, called M-trees, is elaborated. Four different object declustering techniques are proposed and tested in order to get a sufficient evidence needed for specifying the pros and cons of their application. In general, the obtained I/O speedup and scaleup levels are high. A method for dealing with the CPU parallelism is also proposed and its speedup and scaleup experimentally tested
Sommario non disponibile.
Processing m-trees with parallel resources
Savino P;Rabitti F;Amato G;
1998
Abstract
The problem of the design and implementation of parallel metric tree indexes, called M-trees, is elaborated. Four different object declustering techniques are proposed and tested in order to get a sufficient evidence needed for specifying the pros and cons of their application. In general, the obtained I/O speedup and scaleup levels are high. A method for dealing with the CPU parallelism is also proposed and its speedup and scaleup experimentally testedFile in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_217790-doc_50941.pdf
solo utenti autorizzati
Descrizione: Processing m-trees with parallel resources
Tipologia:
Versione Editoriale (PDF)
Dimensione
2.38 MB
Formato
Adobe PDF
|
2.38 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.
