CSR+-tree: Cache-conscious indexing for high-dimensional similarity search

Proceedings of the International Conference on Scientific and Statistical Database Management, SSDBM

Volumn , Issue , 2007, Pages 14-

  Dong, Junfeng ^a   Yu, Xiaohui ^b  

^a MICROSOFT   (United States)

^b YORK UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

MANAGEMENT INFORMATION SYSTEMS;

APPROXIMATE BOUNDING; CACHE-CONSCIOUS; COST SAVING; DISTANCE COMPUTATION; EXPERIMENTAL EVALUATION; HIGH-DIMENSIONAL; INDEX STRUCTURE; SIMILARITY SEARCH;

FORESTRY;

EID: 46649093159     PISSN: 10993371     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SSDBM.2007.9     Document Type: Conference Paper

References (23)

1. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: an efficient and robust access method for points and rectangles. In SIGMOD, pages 322-331, 1990.
2. S. Berchtold, C. Bohm, H. V. Jagadish, H.-P. Kriegel, and J. Sander. Independent quantization: An index compression technique for high-dimensional data spaces. In ICDE, pages 577-588, 2000.
3. S. Berchtold, C. Böhm, and H.-P. Kriegel. The pyramidtechnique: Towards breaking the curse of dimensionality. In SIGMOD, pages 142-153, 1998.
4. S. Berchtold, D. A. Keim, and H.-P. Kriegel. The X-tree: An index structure for high-dimensional data. In VLDB, pages 28-39, 1996.
5. T. Bozkaya and M. Ozsoyoglu. Distance-based indexing for high-dimensional metric spaces. In SIGMOD, pages 357-368, 2000.
6. B. Bui, B. C. Ooi, J. Su, and K. L. Tan. Indexing highdimensional data for efficient in-memory similarity search. TKDE, 17(3), March 2005.
7. J. C. Traina, A. Traina, C. Faloutsos, and B. Seeger. Fast indexing and visualization of metric data sets using Slim-Trees. TKDE, 14(2):244-260, 2002.
8. B. Cui, B. Ooi, J. Su, and K. Tan. Main memory indexing: the case for BD-tree. TKDE, 2003.
9. B. Cui, B. C. Ooi, J. Su, and K. L. Tan. Contorting high dimensional data for efficient main memory KNN processing. In SIGMOD, pages 479-490, 2003.
10. J.Dong. Indexing High-Dimensional Data for Main Memory. MSc Thesis, Department of Computer Science, University of Toronto.
11. R. F. S. Filho, A. J. M. Traina, C. T. Jr., and C. Faloutsos. Similarity search without tears: The OMNI family of allpurpose access methods. In ICDE, pages 623-630, 2001.
12. C. Garcia-Arellano and K. Sevcik. Quantization techniques for similarity search in high-dimensional data spaces. In BN-COD, pages 75-94, 2003.
13. A. Guttman. R-trees: A dynamic index structure for spatial searching. In SIGMOD, pages 47-57, 1984.
14. G. Hjaltason and H. Samet. Ranking in spatial databases. In SSD, pages 83-95, 1995.
15. I. T. Jolliffe. Principle Component Analysis. Springer-Verlag, 1986.
16. N. Katayama and S. Satoh. The SR-tree: An index structure for high-dimensional nearest neighbour queries. In SIGMOD, pages 369-380, 1997.
17. K. Kim, S. K. Cha, and K. Kwon. Optimizing multidimensional index trees for main memory access. In SIGMOD, pages 139-150, 2001.
18. K-I. Lin, H. V. Jagadish, and C. Faloutsos. The TV-tree: An index structure for high-dimensional data. VLDB J., 3(4):517-542, 1994.
19. +-tree cache conscious in main memory. In SIGMOD, pages 475-486, 2000.
20. Y. Sakurai, M. Yoshikawa, S. Uemura, and H. Kojima. The A-tree: An index structure for high-dimensional spaces using relative approximation. In VLDB, pages 516-526, 2000.
21. R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in highdimensional spaces. In VLDB, pages 194-205, 1998.
22. D. White and R. Jain. Similarity indexing with the SS-tree. In ICDE, pages 516-523, 1996.
23. C. Yu, B. C. Ooi, K.-L. Tan, and H. V. Jagadish. Indexing the distance: an efficient method to KNN processing. In VLDB 7., pages 421-430, 2001.