Author:
Corral Antonio,Cañadas Joaquin,Vassilakopoulos Michael
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. S. Arya, D.M. Mount, N. S. Netanyahu, R. Silverman and A. Y. Wu: “An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions”, Journal of the ACM, Vol.45, No.6, pp.891–923, 1998.
2. B. Braunmuller, M. Ester, H.P. Kriegel and J. Sander: “Efficiently Supporting Multiple Similarity Queries for Mining in Metric Databases”, Proceedings ICDE Conference, pp.256–267, 2000.
3. K. S. Beyer, J. Goldstein, R. Ramakrishnan and U. Shaft: “When Is “Nearest Neighbor” Meaningful?”, Proceedings 7th ICDT Conference, pp.217–235, 1999.
4. N. Beckmann, H.P. Kriegel, R. Schneider and B. Seeger: “The R*-tree: and Efficient and Robust Access Method for Points and Rectangles”, Proceedings 1990 ACM SIGMOD Conference, pp.322–331, 1990.
5. S. Berchtold, D. Kiem and H.P. Kriegel: “The X-tree: An Index Structure for High-Dimensional Data”, Proceedings 22nd VLDB Conference, pp.28–39, 1996.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献