High-dimensional similarity searches using a metric pseudo-grid

Proceedings - International Workshop on Biomedical Data Engineering, BMDE2005

Volumn 2005, Issue , 2005, Pages 1174-

  Digout, Christian ^a   Nascimento, Mario A ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ANALYSIS; DATA STRUCTURES; QUERY PROCESSING; TREES (MATHEMATICS);

DATASETS; RANDOM DISK ACCESSES; SEQUENTIAL SCANS; SIMILARITY SEARCHES;

RANDOM ACCESS STORAGE;

EID: 33947101568     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2005.226     Document Type: Conference Paper

References (23)

1. C. C. Aggarwal, A. Hinneburg, and D. A. Keim. On the surprising behavior of distance metrics in high dimensional space. In Proc. of the 8th Intl. Conf. on Database Theory, volume 1973, pages 420-434, 2001.
2. R. Agrawal, C. Faloutsos, and A. Swami. Efficient Similarity Search In Sequence Databases. In Proc. of the 4th Intl. Conf. of Foundations of Data Organization and Algorithms, pages 69-84, 1993.
3. R. Baeza-Yates, W. Cunto, U. Manber, and S. Wu. Proximity matching using fi xed-queries trees. In Proc. of the 5th Symposium on Combinatorial Pattern Matching, pages 198-212, 1994.
4. S. Berchtold, D. Keim, and H.-P. Kriegel. The X-tree: An index structure for high-dimensional data. In Proc. of the 22nd Intl. Conf. on Very Large Databases, pages 28-39, 1996.
5. K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is 'nearest neighbor" meaningful? In Proc. of the 7th Intl. Conf. on Database Theory, volume 1540, pages 217-235, 1999.
6. T. Bozkaya and M. Ozsoyoglu. Distance-based indexing for high-dimensional metric spaces. In Proc. of the 1997 ACM SIGMOD Intl. Conf. on Management of Data, pages 357-368, 1997.
7. B. Braunmuller, M. Ester, H.-P. Kriegel, and J. Sander. Multiple similarity queries: A basic DBMS operation for mining in metric databases. IEEE Transactions on Knowledge and Data Engineering, 13(1):79-95, 2001.
8. W. A. Burkhard and R. M. Keller. Some approaches to best-match fi le searching. Communications of the ACM, 16(4):230-236, 1973.
9. B. Bustos, G. Navarro, and E. Chavez. Pivot selection techniques for proximity searching in metric spaces. In Pattern Recognition Letters, volume 24, pages 2357-2366, 2003.
10. E. Chvez, G. Navarro, R. Baeza-Yates, and J. L. Marroqun. Searching in metric spaces. ACM Computing Surveys, 33(3):273-321, 2001.
11. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In Proc. of 23rd Intl. Conf. on Very Large. Data Bases, pages 426-435, 1997.
12. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proc. of the 2nd Intl. Conf. on Knowledge Discovery and Data Mining, pages 226-231, 1996.
13. R. S. Filho, A. Traina, C. T. Jr., and C. Faloutsos. Similarity search without tears: The OMNI family of all-purpose access methods. In Proc. of the 17th IEEE Intl. Conf. on Data Engineering, pages 623-630, 2001.
14. A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proc. of ACM SIGMOD Intl. Conf. on Management of Data, pages 47-57, 1984.
15. J. Han and M. Kamber. Data Mining: concepts and techniques. Morgan Kaufmann Publishers, 2001. Page 349-351.
16. C. T. Jr., A. Traina, C. Faloutsos, and B. Seeger. Fast indexing and visualization for metric data sets using slim-trees. IEEE Transactions on Knowledge and Data Engineering, 14(2):244-260, 2002.
17. N. Katayama and S. Satoh. The SR-tree: An index structure for high-dimensional nearest neighbor queries. In Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, pages 369-380, 1997.
18. C. Li, E. Chang, H. Garcia-Molina, and G. Wiederhold. Clindex: Approximate similarity queries in high-dimensional spaces. IEEE Transactions on Knowledge and Data Engineering, 14(4):792-808, 2002.
19. L. Liao and W. S. Noble. Combining pairwise sequence similarity and support vector machines for remote protein homology detection. In Proc. of the 6th Intl. Conf. on Research in Computational Molecular Biology, pages 225-232, 2002.
20. G. Lu. Multimedia Database Management Systems. Artech House, 1999.
21. Y. Sakurai, M. Yoshikawa, S. Uemura, and H. Kojima. The A-tree: An index structure for high-dimensional spaces using relative approximation. In Proc. of the 26th Intl. Conf. on Very Large Data Bases, pages 516-526, 2000.
22. R. Stehling, M. Nascimento, and A. X. Falcão. MiCRoM: A metric distance to compare segmented images. In Proc. of the 2002 Visual Information Systems Conf., pages 12-23, 2002.
23. R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proc. of the 24th Intl. Conf. on Very Large Databases, pages 194-205, 1998.