IDistance: An adaptive B +-tree based indexing method for nearest neighbor search

ACM Transactions on Database Systems

Volumn 30, Issue 2, 2005, Pages 364-397

  Jagadish, H V ^a   Ooi, Beng Chin ^b   Tan, Kian Lee ^b   Yu, Cui ^c   Zhang, Rui ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c MONMOUTH UNIVERSITY   (United States)

Author keywords

Additional Key Words and Phrases: Indexing; KNN; Nearest neighbor queries

Indexed keywords

DATA-PARTITIONING STRATEGY; HIGH-DIMENSIONAL METRIC SPACE; K-NEAREST NEIGHBOR (KNN); SPACE-PARTITIONING STRATEGY;

DATA PROCESSING; DATA TRANSFER; OPTIMIZATION; TREES (MATHEMATICS);

INDEXING (OF INFORMATION);

EID: 23944466912     PISSN: 03625915     EISSN: None     Source Type: Journal    
DOI: 10.1145/1071610.1071612     Document Type: Review

References (37)

1. AGGARWAL, C., PROCOPIUC, C., WOLF, J., YU, P., AND PARK, J. 1999. Fast algorithm for projected clustering. In Proceedings of the ACM SIGMOD International Conference on Management of Data.
2. ARYA, S., MOUNT, D., NETANYAHU, N., SILVERMAN, R., AND WU, A. 1994. An optimal algorithm for approximate nearest neighbor searching. In Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 573-582.
3. ARYA, S., MOUNT, D., NETANYAHU, N., SILVERMAN, R., AND WU, A. 1998. An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM 45, 6, 891-923.
4. BERCHTOLD, S., BÖHM, C., JAGADISH, H., KRIEGEL, H., AND SANDER, J. 2000. Independent quantization: An index compression technique for high-dimensional data spaces. In Proceedings of the International Conference on Data Engineering. 577-588.
5. BERCHTOLD, S., BÖHM, C., AND KRIEGEL, H.-P. 1998a. The pyramid-technique: Towards breaking the curse of dimensionality. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 142-153.
6. BERCHTOLD, S., ERTL, B., KEIM, D., KRIEGEL, H.-P., AND SEIDL, T. 1998b. Fast nearest neighbor search in high-dimensional space. In Proceedings of the International Conference on Data Engineering. 209-218.
7. BERCHTOLD, S., KEIM, D., AND KRIEGEL, H. 1996. The X-tree: An index structure for high-dimensional data. In Proceedings of the International Conference on Very Large Data Bases. 28-37.
8. BEYER, K., GOLDSTEIN, J., RAMAKRISHNAN, R., AND SHAFT, U. 1999. When is nearest neighbors meaningful? In Proceedings of the International Conference on Database Theory.
9. BÖHM, C., BERCHTOLD, S., AND KEIM, D. 2001. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Comput. Surv. 33, 3, 322-373.
10. BOZKAYA, T. AND OZSOYOGLU, M. 1997. Distance-based indexing for high-dimensional metric spaces. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 357-368.
11. CHAKRABARTI, K. AND MEHROTRA, S. 1999. The hybrid tree: An index structure for high dimensional feature spaces. In Proceedings of the International Conference on Data Engineering. 322-331.
12. CHAKBABARTI, K AND MEHROTRA, S. 2000. Local dimensionality reduction: a new approach to indexing high dimensional spaces. In Proceedings of the International Conference on Very Large Databases. 89-100.
13. CIACCIA, P., PATELLA, M., AND ZEZULA, P. 1997. M-trees: An efficient access method for similarity search in metric space. In Proceedings of the International Conference on Very Large Data Bases. 426-435.
14. GUI, B., OOI, B. C., SU, J. W., AND TAN, K. L. 2003. Contorting high dimensional data for efficient main memory processing. In Proceedings of the ACM SIGMOD Conference. 479-490.
15. GUI, B., OOI, B. G., SU, J. W., AND TAN, K. L. 2004. Indexing high-dimensional data for efficient in-memory similarity search. In IEEE Trans. Knowl. Data Eng. to appear.
16. FALOUTSOS, C. AND LIN, K.-I. 1995. Fastmap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 163-174.
17. FILHO, R. F. S., TRAINA, A., AND FALOUTSOS, C. 2001. Similarity search without tears: The omni family of all-purpose access methods. In Proceedings of the International Conference on Data Engineering. 623-630.
18. GOLDSTEIN, J. AND RAMAKRISHNAN, R. 2000. Contrast plots and p-sphere trees: space vs. time in nearest neighbor searches. In Proceedings of the International Conference on Very Large Databases. 429-440.
19. GUHA, S., RASTOGI, R., AND SHIM, K. 1998. Cure: an efficient clustering algorithm for large databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data.
20. GUTTMAN, A. 1984. R-trees: A dynamic index structure for spatial searching. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 47-57.
21. +-tree based indexing method for nearest neighbor search. Tech. Rep. www.comp.nus.edu.sg/~ooibc, National University of Singapore.
22. JOLLIFFE, I. T. 1986. Principle Component Analysis. Springer-Verlag.
23. KATAMAYA, N. AND SATOH, S. 1997. The SR-tree: An index structure for high-dimensional nearest neighbor queries. In Proceedings of the ACM SIGMOD International Conference on Management of Data.
24. KOUDAS, N., OOI, B. C., TAN, K.-L., AND ZHANG, R. 2004. Approximate NN queries on streams with guaranteed error/performance bounds. In Proceedings of the International Conference on Very Large Data Bases. 804-815.
25. KRUSKAL, J. B. 1956. On the shortest spanning subtree of a graph and the travelling salesman problem. In Proceedings of the American Mathematical Society 7, 48-50.
26. LIN, K., JAGADISH, H., AND FALOUTSOS, C. 1995. The TV-tree: An index structure for high-dimensional data. VLDB Journal 3, 4, 517-542.
27. MACQUEEN, J. 1967. Some methods for classification and analysis of multivariate observations. In Fifth Berkeley Symposium on Mathematical statistics and probability. University of California Press, 281-297.
28. OOI, B. C., TAN, K. L., YU, C., AND BRESSAN, S. 2000. Indexing the edge: a simple and yet efficient approach to high-dimensional indexing. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. 166-174.
29. PAGEL, B.-U., KORN, F., AND FALOUTSOS, C. 2000. Deflating the dimensionality curse using multiple fractal dimensions. In Proceedings of the International Conference on Data Engineering.
30. RAMAKRISHNAN, R. AND GEHRKE, J. 2000. Database Management Systems. McGraw-Hill.
31. SAKURAI, Y., YOSHIKAWA, M., AND UEMURA, S. 2000. The a-tree: An index structure for high-dimensional spaces using relative approximation. In Proceedings of the International Conference on Very Large Data Bases. 516-526.
32. TAO, Y., FALOUTSOS, C., AND PAPADIAS, D. 2003. The power-method: A comprehensive estimation technique for multi-dimensional queries. In Proceedings of the Conference on Information and Knowledge Management.
33. TRAINA, A., SEEGER, B., AND FALOUTSOS, C. 2000. Slim-trees: high performance metric trees minimizing overlap between nodes. In Advances in Database Technology - EDBT 2000, International Conference on Extending Database Technology, Konstanz, Germany, March 27-31, 2000, Proceedings. Lecture Notes in Computer Science, vol. 1777. Springer-Verlag, 51-65.
34. WEBER, R., SCHEK, H., AND BLOTT, S. 1998. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proceedings of the International Conference on Very Large Data Bases. 194-205.
35. WHITE, D. AND JAIN, R. 1996. Similarity indexing with the SS-tree. In Proceedings of the International Conference on Data Engineering. 516-523.
36. YU, C., OOI, B. C., TAN, K. L., AND JAGADISH, H. 2001. Indexing the distance: an efficient method to knn processing. In Proceedings of the International Conference on Very Large Data Bases. 421-430.
37. ZHANG, T., RAMAKRISHNAN, R., AND LIVNY, M. 1996. Birch: an efficient data clustering method for very large databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data.