DocumentCode
2936621
Title
Processing M-trees with parallel resources
Author
Zezula, P. ; Savino, P. ; Rabitti, F. ; Amato, G. ; Ciaccia, P.
Author_Institution
Ist. di Elaborazione dell´´Inf., CNR, Pisa, Italy
fYear
1998
fDate
23-24 Feb 1998
Firstpage
147
Lastpage
154
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 tested
Keywords
database management systems; indexing; multimedia computing; tree data structures; I/O speedup; M-tree processing; database technology; indexing structure; multimedia data; object declustering techniques; parallel metric tree indexes; parallel resources; scaleup; Central Processing Unit; Concurrent computing; Costs; Extraterrestrial measurements; Indexing; Multimedia databases; Parallel processing; Shape measurement; Streaming media; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Research Issues In Data Engineering, 1998. 'Continuous-Media Databases and Applications'. Proceedings., Eighth International Workshop on
Conference_Location
Orlando, FL
Print_ISBN
0-8186-8389-9
Type
conf
DOI
10.1109/RIDE.1998.658289
Filename
658289
Link To Document