M-tree: An Efficient Access Method for Similarity Search in Metric Spaces (1997)

by Paolo Ciaccia , Marco Patella , Pavel Zezula
Citations:560 - 39 self

Documents Related by Co-Citation

2384 R-trees: A Dynamic Index Structure for Spatial Searching – Antonin Guttman - 1984
1067 The R*-tree: an efficient and robust access method for points and rectangles – Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger - 1990
520 Nearest Neighbor Queries – Nick Roussopoulos, Stephen Kelley, Frederic Vincent - 1995
545 The X-tree: An Index Structure for High-Dimensional Data – Stefan Berchtold, Daniel A. Keim, Hans-Peter Kriegel - 1996
638 An algorithm for finding best matches in logarithmic expected time – Jerome H. Friedman, Jon Louis Bentley, Raphael Ari Finkel - 1977
315 Similarity Indexing with the SS-tree – David A. White, Ramesh Jain - 1996
401 The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries – Norio Katayama, et al. - 1997
818 An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions – Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu - 1994
1248 The Design and Analysis of Spatial Data Structures – H Samet - 1989