Efficient parallelization of spatial approximation trees

Authors:
Mauricio Marín;Nora Reyes
Affiliations:
Computer Cs. Department, University of Magallanes, Chile;Computer Cs. Department, University of San Luis, Argentina
Venue:
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
Year:
2005

Citing 6
Cited 4

A bridging model for parallel computation

Communications of the ACM
Multidimensional access methods

ACM Computing Surveys (CSUR)
Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases

ACM Computing Surveys (CSUR)
Fully Dynamic Spatial Approximation Trees

SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Searching in metric spaces by spatial approximation

The VLDB Journal — The International Journal on Very Large Data Bases
Improved Deletions in Dynamic Spatial Approximation Trees

SCCC '03 Proceedings of the XXIII International Conference of the Chilean Computer Science Society

A Search Engine Index for Multimedia Content

Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Parallel query processing on distributed clustering indexes

Journal of Discrete Algorithms
Solving similarity joins and range queries in metric spaces with the list of twin clusters

Journal of Discrete Algorithms
Sync/Async parallel search for the efficient design and construction of web search engines

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes the parallelization of the Spatial Approximation Tree. This data structure has been shown to be an efficient index structure for solving range queries in high-dimensional metric space databases. We propose a method for load balancing the work performed by the processors. The method is self-tuning and is able to dynamically follow changes in the work-load generated by user queries. Empirical results with different databases show efficient performance in practice. The algorithmic design is based on the use of the bulk-synchronous model of parallel computing.