The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries (1997)

Cached

Download Links

by Norio Katayama, et al.
Citations:375 - 3 self

Documents Related by Co-Citation

2201 R-trees: A Dynamic Index Structure for Spatial Searching – Antonin Guttman - 1984
298 Similarity Indexing with the SS-tree – David A. White, Ramesh Jain - 1996
184 A cost model for nearest neighbor search in high-dimensional data space – Stefan Berchtold, Christian Böhm - 1997
505 The X-tree: An Index Structure for High-Dimensional Data – Stefan Berchtold, Daniel A. Keim, Hans-Peter Kriegel - 1996
487 A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces – Roger Weber, Hans-J. Schek, Stephen Blott - 1998
587 An algorithm for finding best matches in logarithmic expected time – Jerome H. Friedman, Jon Louis Bentley, Raphael Ari Finkel - 1977
482 Nearest Neighbor Queries – Nick Roussopoulos, Stephen Kelley, Frederic Vincent - 1995
508 M-tree: An Efficient Access Method for Similarity Search in Metric Spaces – Paolo Ciaccia, Marco Patella, Pavel Zezula - 1997
411 FastMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets – Christos Faloutsos, King-Ip (David) Lin - 1995
786 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
380 The K-D-B Tree: A Search Structure for Large Multidimensional Indexes – J Robinson - 1981
30 Faloutsos C.: ‘The TV-Tree: An Index Structure for High-Dimensional – K Lin, H V Jagadish - 1995
154 Beyond uniformity and independence: Analysis of r-trees using the concept of fractal dimension – Christos Faloutsos, Ibrahim Kamel - 1994
177 The pyramid-technique: Towards breaking and the curse of dimensionality – Stefan Berchtold, Christian Bhm, Hans-peter Kriegel - 1998
100 Dimensionality Reduction for Similarity Searching in Dynamic Databases – K. V. Ravi Kanth, Divyakant Agrawal, Amr El Abbadi, Ambuj Singh - 1998
976 The R*-tree: an efficient and robust access method for points and rectangles – Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger - 1990
179 Ranking in Spatial Databases – Gísli Hjaltason, Hanan Samet - 1995
184 Hilbert R-tree: An improved R-tree using fractals – Ibrahim Kamel, Christos Faloutsos - 1994
12 Ramakrishnan R, Shaft U. When is “nearest neighbor” meaningful – K Beyer, J Goldstein - 1998