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
Hi-index | 0.00 |
Searching for similar objects in metric-space databases can be efficiently solved by using index data structures. A number of alternative sequential indexes have been proposed in the literature. This paper proposes the parallelization of a recent pivot-based index data structure which can efficiently accommodate on-line updates and reduces the number of object-to-object comparisons during searches. We present algorithms for index construction and query processing.