PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Zezula P., Savino P., Rabitti F., Amato G., Ciaccia P. Processing M-trees with parallel resources. In: RIDE'98; Eighth International Workshop on Research Issues in data Engineering: Continuous-Media Databases and Applications. Proceedings (Orlando, Florida 1998), 147-154. IEEE Computer Society, 1998. 1998.
 
 
Abstract
(English)
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 way how to deal with the CPU parallelism is also proposed and its speedup and scaleup experimentally tested.
Subject M-trees
Parallel Resources
H.3 INFORMATION STORAGE AND RETRIEVAL


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional