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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Mamede, M. (2005). Recursive lists of clusters: A dynamic data structure for range queries in metric spaces. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3733 LNCS, pp. 843–853). https://doi.org/10.1007/11569596_86
Mendeley helps you to discover research relevant for your work.