Recursive lists of clusters: a dynamic data structure for range queries in metric spaces

Authors:
Margarida Mamede
Affiliations:
CITI / Departamento de Informática, Faculdade de Ciências e Tecnologia da UNL, Caparica, Portugal
Venue:
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Year:
2005

Citing 12
Cited 2

An algorithm for finding nearest neighbours in (approximately) constant average time

Pattern Recognition Letters
Data structures and algorithms for nearest neighbor search in general metric spaces

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Some approaches to best-match file searching

Communications of the ACM
Searching in metric spaces

ACM Computing Surveys (CSUR)
How to improve the pruning ability of dynamic metric access methods

Proceedings of the eleventh international conference on Information and knowledge management
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Near Neighbor Search in Large Metric Spaces

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Fully Dynamic Spatial Approximation Trees

SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Proximity Matching Using Fixed-Queries Trees

CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
An Effective Clustering Algorithm to Index High Dimensional Metric Spaces

SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
D-Index: Distance Searching Index for Metric Data Sets

Multimedia Tools and Applications
A compact space decomposition for effective metric indexing

Pattern Recognition Letters

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

Journal of Discrete Algorithms
Integrating multi-objective genetic algorithm based clustering and data partitioning for skyline computation

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a novel data structure for solving the range query problem in generic metric spaces. It can be seen as a dynamic version of the List of Clusters data structure of Chávez and Navarro. Experimental results show that, with respect to range queries, it outperforms the original data structure when the database dimension is below 12. Moreover, the building process is much more efficient, for any size and any dimension of the database.