Processing M-trees with parallel resources

Processing M-trees with parallel resources

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 obtai...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Zezula, P., Savino, P., Rabitti, F., Amato, G., Ciaccia, P.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Central Processing Unit
Concurrent computing
Costs
Extraterrestrial measurements
Indexing
Multimedia databases
Parallel processing
Shape measurement
Streaming media
Testing
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
DOI:10.1109/RIDE.1998.658289