메뉴 건너뛰기




Volumn , Issue , 2007, Pages 419-424

Adaptive similarity search in metric trees

Author keywords

[No Author keywords available]

Indexed keywords

DATA ACQUISITION; HIERARCHICAL SYSTEMS; QUERY PROCESSING; SEARCH ENGINES;

EID: 40949097370     PISSN: 1062922X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSMC.2007.4414022     Document Type: Conference Paper
Times cited : (3)

References (18)
  • 2
    • 40949162221 scopus 로고    scopus 로고
    • G. Karypis, E.'Hong (Sain), and V. Kumar, CHAMELEON: A Hierarchical Clustering Algorithm Using Dynamic Modeling, University of Minnesota, Technical Report #99-007.
    • G. Karypis, E.'Hong (Sain), and V. Kumar, "CHAMELEON: A Hierarchical Clustering Algorithm Using Dynamic Modeling", University of Minnesota, Technical Report #99-007.
  • 3
    • 18744416013 scopus 로고    scopus 로고
    • Q. Lv, M. Charikar, and K. Li, linage Similarity Search with Compact Data Structures, in Proc. loth ACM Conference on Information and Knowledge Management (CIKM), pages 208-217, 2004.
    • Q. Lv, M. Charikar, and K. Li, " linage Similarity Search with Compact Data Structures", in Proc. loth ACM Conference on Information and Knowledge Management (CIKM), pages 208-217, 2004.
  • 4
    • 33745613484 scopus 로고    scopus 로고
    • Indexing Protein Sequences in Metric Space
    • Technical report, University of Texas
    • W. Xu, D.P. Miranker, R. Mao, and S. Wang. "Indexing Protein Sequences in Metric Space", Technical report, University of Texas,2003.
    • (2003)
    • Xu, W.1    Miranker, D.P.2    Mao, R.3    Wang, S.4
  • 5
    • 0021615874 scopus 로고    scopus 로고
    • R-trees: A Dynamic Index Structure for Spatial Searching
    • A. Guttinan, " R-trees: A Dynamic Index Structure for Spatial Searching", ACM 1984.
    • ACM 1984
    • Guttinan, A.1
  • 7
    • 0031162081 scopus 로고    scopus 로고
    • The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries
    • N. Katayama, and S. Satoh "The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries" . SIGMOD 1997.
    • SIGMOD 1997
    • Katayama, N.1    Satoh, S.2
  • 8
    • 0027188633 scopus 로고
    • Data Structures And Algorithms for Nearest Neighbor Search in General Metric Spaces
    • Jan
    • P. Yianilos, "Data Structures And Algorithms for Nearest Neighbor Search in General Metric Spaces", Proc. Third Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 311-321, Jan. 1993.
    • (1993) Proc. Third Ann. ACM-SIAM Symp. Discrete Algorithms , pp. 311-321
    • Yianilos, P.1
  • 12
    • 0001728087 scopus 로고    scopus 로고
    • Indexing Large Metric Spaces for Similarity Search Queries
    • September
    • T. Bozkaya. and M. Ozsoyoglu, "Indexing Large Metric Spaces for Similarity Search Queries", ACM Transactions on Database Systems, Vol. 24, No. 3, September 1999, Pages 361-404.
    • (1999) ACM Transactions on Database Systems , vol.24 , Issue.3 , pp. 361-404
    • Bozkaya, T.1    Ozsoyoglu, M.2
  • 13
    • 40949154607 scopus 로고    scopus 로고
    • Xianginin. Z.. Guoren, W.. Xiaofang, Z.. and Yu,G., BM+-tree: A Hyperplane-based Index Method for High-Dimensional Metric Spaces, DASFAA 2005.
    • Xianginin. Z.. Guoren, W.. Xiaofang, Z.. and Yu,G., "BM+-tree: A Hyperplane-based Index Method for High-Dimensional Metric Spaces", DASFAA 2005.
  • 16
    • 40949157399 scopus 로고    scopus 로고
    • http://www.broad.init.edu/cgi-bin/cancer/datasets.cgi.
  • 18
    • 0041664272 scopus 로고    scopus 로고
    • Index-Driven Similarity Search in Metric Spaces
    • December
    • G. R. Hjaltason and H. Sainet. "Index-Driven Similarity Search in Metric Spaces", in ACM transactions on Database Systems Vol. 28, No. 4, December 2003.
    • (2003) ACM transactions on Database Systems , vol.28 , Issue.4
    • Hjaltason, G.R.1    Sainet, H.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.