Indexing high-dimensional data for efficient in-memory similarity search

IEEE Transactions on Knowledge and Data Engineering

Volumn 17, Issue 3, 2005, Pages 339-352

  Cui, Bin ^a   Ooi, Beng Chin ^a   Su, Uianwen ^b   Tan, Kian Lee ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b University of California   (United States)

Author keywords

High dimensional index; Main memory; Similarity query

Indexed keywords

HIGH-DIMENSIONAL INDEX; MAIN MEMORY; SIMILARITY QUERY;

BUFFER STORAGE; DATA REDUCTION; DATA STORAGE EQUIPMENT; ONLINE SEARCHING; OPTIMIZATION; QUERY LANGUAGES; TREES (MATHEMATICS);

INDEXING (OF INFORMATION);

EID: 14644401112     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2005.46     Document Type: Article

References (23)

1. CMU Graphics Lab Motion Capture Database, available from http://mocap.cs.cmu.edu/, 2004.
2. Corel Image Features, available from http://kdd.ics.uci.edu, 2000.
3. S. Berchtold, C. Böhm, and H.P. Kriegel, "The Pyramid-Tree: Breaking the Curse of Dimensionality," Proc. ACM SIGMOD Conf., pp. 142-153, 1998.
4. S. Berchtold, C. Bohm, D. Keim, F. Krebs, and H.P. Kriegel, "On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces," Proc. Eighth Int'l Conf. Database Theory, pp. 435-449, 2001.
5. P. Bohannon, P. Mcllroy, and R. Rastogi, "Main-Memory Index Structures with Fixed-Size Partial Keys," Proc. ACM SIGMOD Conf., pp. 163-174, 2001.
6. C. Bohm, S. Berchtold, and D. Keim, "Searching in High-Dimensional Spaces: Index Structures for Improving the Performance of Multimedia Databases," ACM Computing Surveys, pp. 322-373, 2001.
7. T. Bozkaya and M. Ozsoyoglu, "Distance-Based Indexing for High-Dimensional Metric Spaces," Proc. ACM SIGMOD Conf., pp. 357-368, 1997.
8. K. Chakrabarti and S. Mehrotra, "Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces," Proc. 26th Very Large Data Bases Conf., pp. 89-100, 2000.
9. S. Chen, P.B. Gibbons, and T.C. Mowry, "Improving Index Performance through Prefetching," Proc. ACM SIGMOD Conf., pp. 139-150, 2001.
10. P. Ciaccia, M. Patella, and P. Zezula, "M-Tree: An Efficient Access Method for Similarity Search in Metric Spaces," Proc. 24th Very Large Data Bases Conf., pp. 194-205, 1997.
11. B. Cui, B.C. Ooi, J.W. Su, and K.L. Tan, "Contorting High Dimensional Data for Efficient Main Memory Processing," Proc. ACM SIGMOD Conf., pp. 479-490, 2003.
12. B. Cui, B.C. Ooi, J.W. Su, and K.L. Tan, "Main Memory Indexing: The Case for BD-Tree," IEEE Trans. Knowledge and Data Eng., 2003.
13. R. Enbody Perfmon: Performance Monitoring Tool, available from http://www.cps.msu.edu/enbody/perfmon.html, 1999.
14. R.F.S. Filho, A. Traina, C. Traina Jr., and C. Faloutsos, "Similarity Search without Tears: The Omni-Family of All-Purpose Access Methods," Proc. 17th Int'l Conf. Data Eng., 2001.
15. G.H. Golub and C.F. Van Loan, Matrix Computations. The Johns Hopkins Univ. Press, 1989.
16. J. Hui, B.C. Ooi, H. Shen, C. Yu, and A. Zhou, "An Adaptive and Efficient Dimensionality Reduction Algorithm for High-Dimensional Indexing," Proc. 19th Int'l Conf. Data Eng., 2003.
17. I.T. Jolliffe, Principal Component Analysis. Springer-Verlag, 1986.
18. C. Traina Jr., A. Traina, C. Faloutsos, and B. Seeger, "Fast Indexing and Visualization of Metric Data Sets Using Slim-Trees," IEEE Trans. Knowledge and Data Eng., 2002.
19. K. Kim, S.K. Cha, and K. Kwon, "Optimizing Multidimensional Index Trees for Main Memory Access," Proc. ACM SIGMOD Conf., pp. 139-150, 2001.
20. K. Lin, H.V. Jagadish, and C. Faloutsos, "The TV-Tree: An Index Structure for High-Dimensional Data," The VLDB J., vol. 3, no. 4, pp. 517-542, 1994.
21. J. Rao and K. Ross, "Making B+-Trees Cache Conscious in Main Memory," Proc. ACM SIGMOD Conf., pp. 476-486, 2000.
22. R. Weber, H.J. Schek, and S. Blott, "A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces," Proc. 24th Very Large Data Bases Conf., pp. 194-205, 1998.
23. C. Yu, B.C. Ooi, K.L. Tan, and H.V. Jagadish, "Indexing the Distance: An Efficient Method to KNN Processing," Proc. 27th Very Large Data Bases Conf., pp. 421-430, 2001.