메뉴 건너뛰기




Volumn 63, Issue 3, 2007, Pages 919-946

CM-tree: A dynamic clustered index for similarity search in metric databases

Author keywords

Clustering methods; Database indexing; Metric access methods; Metric spaces; Similarity search

Indexed keywords

ALGORITHMS; CLUSTER ANALYSIS; COST EFFECTIVENESS; DECISION TREES; METRIC SYSTEM; PROGRAM PROCESSORS;

EID: 34548784401     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2007.06.001     Document Type: Article
Times cited : (24)

References (38)
  • 1
    • 34548777238 scopus 로고    scopus 로고
    • L. Aronovich, Similarity Search in Metric Databases, Ph.D. dissertation, Information Systems Department, Tel Aviv University, 2006.
  • 2
    • 5044238246 scopus 로고    scopus 로고
    • V. Athitsos, J. Alon, S. Sclaroff, G. Kollios, BoostMap: A method for efficient approximate similarity rankings, in: The proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, CVPR, 2004.
  • 3
    • 0015489880 scopus 로고
    • Organization and maintenance of large ordered indexes
    • Bayer R., and Mccreight C. Organization and maintenance of large ordered indexes. Acta Inf. 1 3 (1972) 173-189
    • (1972) Acta Inf. , vol.1 , Issue.3 , pp. 173-189
    • Bayer, R.1    Mccreight, C.2
  • 4
    • 0025447750 scopus 로고    scopus 로고
    • *-tree: An efficient and robust access method for points and rectangles, in: Proceedings of ACM SIGMOD International Conference on Management of Data, 1990, pp. 322-331.
  • 5
    • 34548734455 scopus 로고    scopus 로고
    • S. Berchtold, D. Keim, H. Kriegel, The X-tree: An index structure for high-dimensional data, in: Proceedings of the 22nd Conference on Very Large Databases (VLDB'96), 1996, pp. 28-39.
  • 6
    • 0001728087 scopus 로고    scopus 로고
    • Indexing large metric spaces for similarity search queries
    • Bozkaya T., and Ozsoyoglu M. Indexing large metric spaces for similarity search queries. ACM Transactions on Database Systems 24 3 (1999) 361-404
    • (1999) ACM Transactions on Database Systems , vol.24 , Issue.3 , pp. 361-404
    • Bozkaya, T.1    Ozsoyoglu, M.2
  • 7
    • 34548736813 scopus 로고    scopus 로고
    • S. Brin, Near neighbor search in large metric spaces, in: Proceedings of the 21st Conference on Very Large Databases (VLDB'95), 1995, pp. 574-584.
  • 8
    • 0015531930 scopus 로고
    • Some approaches to best-match file searching
    • Burkhard W., and Keller R. Some approaches to best-match file searching. Commun. ACM 16 4 (1973) 230-236
    • (1973) Commun. ACM , vol.16 , Issue.4 , pp. 230-236
    • Burkhard, W.1    Keller, R.2
  • 9
    • 0041339760 scopus 로고    scopus 로고
    • Pivot selection techniques for proximity searching in metric spaces
    • Bustos B., Navarro G., and Chávez E. Pivot selection techniques for proximity searching in metric spaces. Pattern Recognit. Lett. 24 14 (2003) 2357-2366
    • (2003) Pattern Recognit. Lett. , vol.24 , Issue.14 , pp. 2357-2366
    • Bustos, B.1    Navarro, G.2    Chávez, E.3
  • 10
    • 84964528192 scopus 로고    scopus 로고
    • E. Chávez, G. Navarro, An effective clustering algorithm to index high dimensional metric spaces, in: Proceedings of the Seventh International Symposium on String Processing and Informational Retrieval (SPIRE'00), IEEE CS Press, 2000, pp. 75-86.
  • 12
    • 34548727700 scopus 로고    scopus 로고
    • T. Chiueh, Content-based image indexing, in: Proceedings of the 20th Conference on Very Large Databases (VLDB'94), 1994, pp. 582-593.
  • 13
    • 34548794276 scopus 로고    scopus 로고
    • P. Ciaccia, M. Patella, F. Rabitti, P. Zezula, The M-tree Project, http://www-db.deis.unibo.it/Mtree/, MultiMedia DataBase Group, Department of Electronics, Computer Science and Systems, University of Bologna, 2002.
  • 14
    • 84993661659 scopus 로고    scopus 로고
    • P. Ciaccia, M. Patella, P. Zezula, M-Tree: An efficient access method for similarity search in metric spaces, in: Proceedings of the 23rd Conference on Very Large Databases (VLDB'97), 1997, pp. 426-435.
  • 15
    • 0031624832 scopus 로고    scopus 로고
    • P. Ciaccia, M. Patella, P. Zezula, A cost model for similarity queries in metric spaces, in: Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'98), 1998.
  • 16
    • 0018480749 scopus 로고
    • The ubiquitous B-tree
    • Comer D. The ubiquitous B-tree. ACM Comput. Surveys 11 2 (1979) 121-137
    • (1979) ACM Comput. Surveys , vol.11 , Issue.2 , pp. 121-137
    • Comer, D.1
  • 18
    • 34548767934 scopus 로고    scopus 로고
    • M. Ester, H.P. Kriegel, J. Sander, X. Xu, A density-based algorithm for discovering clusters in large spatial databases with noise, in: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, Portland, OR, 1996, pp. 213-226.
  • 19
    • 84976803260 scopus 로고
    • Fastmap: A fast algorithm for indexing, data mining and visualization of traditional and multimedia datasets
    • Faloutsos C., and Kamel I. Fastmap: A fast algorithm for indexing, data mining and visualization of traditional and multimedia datasets. ACM SIGMOD Rec. 24 2 (1995) 163-174
    • (1995) ACM SIGMOD Rec. , vol.24 , Issue.2 , pp. 163-174
    • Faloutsos, C.1    Kamel, I.2
  • 20
    • 33746059374 scopus 로고    scopus 로고
    • On the least cost for proximity searching in metric spaces
    • Figueroa K., Chávez E., Navarro G., and Paredes R. On the least cost for proximity searching in metric spaces. WEA (2006) 279-290
    • (2006) WEA , pp. 279-290
    • Figueroa, K.1    Chávez, E.2    Navarro, G.3    Paredes, R.4
  • 21
    • 0032083561 scopus 로고    scopus 로고
    • Multidimensional access methods
    • Gaede V., and Günther O. Multidimensional access methods. ACM Comput. Surveys 30 2 (1998) 170-231
    • (1998) ACM Comput. Surveys , vol.30 , Issue.2 , pp. 170-231
    • Gaede, V.1    Günther, O.2
  • 22
    • 85031999247 scopus 로고    scopus 로고
    • A. Guttman, R-Trees: A dynamic index structure for spatial searching, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, 1984, pp. 47-57.
  • 24
    • 0041664272 scopus 로고    scopus 로고
    • Index-driven similarity search in metric spaces
    • Hjaltason G.R., and Samet H. Index-driven similarity search in metric spaces. ACM Trans. Database Syst. 28 4 (2003) 517-580
    • (2003) ACM Trans. Database Syst. , vol.28 , Issue.4 , pp. 517-580
    • Hjaltason, G.R.1    Samet, H.2
  • 25
    • 34548788765 scopus 로고    scopus 로고
    • S. Hettich, S.D. Bay, The UCI Knowledge Discovery in Databases Archive, http://kdd.ics.uci.edu, Irvine, CA: University of California, Department of Information and Computer Science, 1999.
  • 29
    • 0036706560 scopus 로고    scopus 로고
    • Searching in metric spaces by spatial approximation
    • Navarro G. Searching in metric spaces by spatial approximation. VLDB J. 11 (2002) 28-46
    • (2002) VLDB J. , vol.11 , pp. 28-46
    • Navarro, G.1
  • 30
    • 33646730696 scopus 로고    scopus 로고
    • Using the k-nearest neighbor graph for proximity searching in metric spaces, SPIRE 2005
    • Paredes R., and Chávez E. Using the k-nearest neighbor graph for proximity searching in metric spaces, SPIRE 2005. LNCS 3772 (2005) 127-138
    • (2005) LNCS , vol.3772 , pp. 127-138
    • Paredes, R.1    Chávez, E.2
  • 31
    • 33746084482 scopus 로고    scopus 로고
    • Practical construction of k-nearest neighbor graphs in metric spaces
    • Paredes R., Chávez E., Figueroa K., and Navarro G. Practical construction of k-nearest neighbor graphs in metric spaces. WEA (2006) 85-97
    • (2006) WEA , pp. 85-97
    • Paredes, R.1    Chávez, E.2    Figueroa, K.3    Navarro, G.4
  • 32
    • 3042622703 scopus 로고    scopus 로고
    • T.B. Sebastian, B.B. Kimia, Metric-based shape retrieval in large databases, in: Proceedings of the 16th International Conference on Pattern Recognition (ICPR'02), Quebec City, Canada, vol. 3, 2002, pp. 291-296.
  • 33
    • 34548761105 scopus 로고    scopus 로고
    • T. Skopal, J. Pokorny, V. Snasel, PM-tree: Pivoting metric tree for similarity search in multimedia databases, in: Proceedings of the Annual International Workshop on Databases, Texts, Specifications and Objects (DATESO 2004), 2004, pp. 27-37.
  • 35
    • 0026256261 scopus 로고
    • Satisfying general proximity/similarity queries with metric trees
    • Uhlmann J. Satisfying general proximity/similarity queries with metric trees. Inf. Proc. Lett. 40 (1991) 175-179
    • (1991) Inf. Proc. Lett. , vol.40 , pp. 175-179
    • Uhlmann, J.1
  • 36
    • 0022858293 scopus 로고
    • An algorithm for finding nearest neighbors in (approximately) constant average time
    • Vidal E. An algorithm for finding nearest neighbors in (approximately) constant average time. Patt. Recogn. Lett. 4 (1986) 145-157
    • (1986) Patt. Recogn. Lett. , vol.4 , pp. 145-157
    • Vidal, E.1
  • 37
    • 0027188633 scopus 로고    scopus 로고
    • P. Yianilos, Data structures and algorithms for nearest neighbor search in general metric spaces, in: Proceedings of the Fourth ACM-SIAM Symposium on Discrete Algorithms (SODA'93), 1993, pp. 311-321.
  • 38
    • 34548727061 scopus 로고    scopus 로고
    • P. Yianilos, Excluded middle vantage point forests for nearest neighbor search, In DIMACS Implementation Challenge, ALENEX'99 (Baltimore, MD), 1999.


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