Indexing the distance: An efficient method to KNN processing

VLDB 2001 - Proceedings of 27th International Conference on Very Large Data Bases

Volumn , Issue , 2001, Pages 421-430

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

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA HANDLING; DEGREES OF FREEDOM (MECHANICS); INDEXING (MATERIALS WORKING); TREES (MATHEMATICS);

DATA DISTRIBUTION; DIMENSIONAL SPACES; HIGH DIMENSIONAL SPACES; INDEX STRUCTURE; K NEAREST NEIGHBOR (KNN); RANGE SEARCH; REFERENCE POINTS; TREE STRUCTURES;

NEAREST NEIGHBOR SEARCH;

EID: 84944319598     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. S. Berchtold, C. Bo″hm, and H-P. Kriegel. The pyramid-technique: Towards breaking the curse of dimensionality. In Proc. 1998 ACM SIGMOD International Conference on Management of Data, pages 142-153. 1998.
2. S. Berchtold, C. Bohm, H.P. Kriegel, J. Sander, and H.V. Jagadish. Independent quantization: An index compression technique for high-dimensional data spaces. In Proc. 16th International Conference on Data Engineering, pages 577-588. 2000.
3. S. Berchtold, D.A. Keim, and H.P. Kriegel. The X-tree: An index structure for high-dimensional data. In Proc. 22nd International Conference on Very Large Data Bases, pages 28-37. 1996.
4. E. Bertino and et. al. Indexing Techniques for Advanced Database Systems. Kluwer Academic, 1997.
5. K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is nearest neighbors meaningful? In Proc. International Conference on Database Theory, 1999.
6. T. Bozkaya and M. Ozsoyoglu. Distance-based indexing for high-dimensional metric spaces. In Proc. 1997 ACM SIGMOD International Conference on Management of Data, pages 357-368. 1997.
7. K. Chakrabarti and S. Mehrotra. Local dimensionality reduction: a new approach to indexing high dimensional spaces. In Proc. 26th International Conference on Very Large Databases, pages 89-100, 2000.
8. P. Ciaccia, M. Patella, and P. Zezula. M-trees: An efficient access method for similarity search in metric space. In Proc. 23rd International Conference on Very Large Data Bases, pages 426-435. 1997.
9. J. Goldstein and R. Ramakrishnan. Contrast plots and p-sphere trees: space vs. time in nearest neighbor searches. In Proc. 26th International Conference on Very Large Databases, pages 429-440, 2000.
10. S. Guha, R. Rastogi, and K. Shim. Cure: an efficient clustering algorithm for large databases. In Proc. 1998 ACM SIGMOD International Conference on Management of Data. 1998.
11. A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proc. 1984 ACM SIGMOD International Conference on Management of Data, pages 47-57. 1984.
12. N. Katamaya and S. Satoh. The SR-tree: An index structure for high-dimensional nearest neighbor queries. In Proc. 1997 ACM SIGMOD International Conference on Management of Data. 1997.
13. B. C. Ooi, K. L. Tan, C. Yu, and S. Bressan. Indexing the edge: a simple and yet efficient approach to high-dimensional indexing. In Proc. 18th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 166-174. 2000.
14. R. Ramakrishnan and J. Gehrke. Database Management Systems. McGraw-Hill, 2000.
15. Y. Sakurai, M. Yoshikawa, and S. Uemura. The a-tree: An index structure for high-dimensional spaces using relative approximation. In Proc. 26th International Conference on Very Large Data Bases, pages 516-526. 2000.
16. R. Weber, H. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proc. 24th International Conference on Very Large Data Bases, pages 194-205. 1998.
17. D.A. White and R. Jain. Similarity indexing with the SS-tree. In Proc. 12th International Conference on Data Engineering, pages 516-523. 1996.
18. C. Yu. High-Dimensional Indexing. PhD thesis, Department of Computer Science, National University of Singapore, 2001.
19. C. Yu, B. C. Ooi, and K. L. Tan. Progressive KNN search using B+-trees. http://www.comp.nus.edu.sg/~ooibc/appimm.ps, page 20p, 2001.
20. T. Zhang, R. Ramakrishnan, and M. Livny. Birch: an efficient data clustering method for very large databases. In Proc. 1996 ACM SIGMOD International Conference on Management of Data. 1996.