메뉴 건너뛰기




Volumn , Issue , 2010, Pages 13-21

Where are you heading, metric access methods? A provocative survey

Author keywords

Content based search; MAM; Metric access methods; Similarity

Indexed keywords

CONTENT-BASED; CONTENT-BASED SEARCH; KEYWORD SEARCH; MAM; METRIC ACCESS METHODS; METRIC DISTANCES; METRIC MODEL; METRIC SPACE MODEL; REAL-WORLD; REAL-WORLD APPLICATION; SIMILARITY; SIMILARITY QUERY; SIMILARITY SEARCH;

EID: 78649869041     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1862344.1862347     Document Type: Conference Paper
Times cited : (13)

References (26)
  • 3
    • 0034479195 scopus 로고    scopus 로고
    • Retrieval by shape similarity with perceptual distance and effective indexing
    • S. Berretti, A. D. Bimbo, and P. Pala. Retrieval by shape similarity with perceptual distance and effective indexing. IEEE Transactions on Multimedia, 2(4):225-239, 2000.
    • (2000) IEEE Transactions on Multimedia , vol.2 , Issue.4 , pp. 225-239
    • Berretti, S.1    Bimbo, A.D.2    Pala, P.3
  • 4
    • 0038670812 scopus 로고    scopus 로고
    • Searching in high-dimensional spaces - Index structures for improving the performance of multimedia databases
    • C. Böhm, S. Berchtold, and D. Keim. Searching in High-Dimensional Spaces - Index Structures for Improving the Performance of Multimedia Databases. ACM Computing Surveys, 33(3):322-373, 2001.
    • (2001) ACM Computing Surveys , vol.33 , Issue.3 , pp. 322-373
    • Böhm, C.1    Berchtold, S.2    Keim, D.3
  • 5
    • 84947290446 scopus 로고    scopus 로고
    • A probabilistic spell for the curse of dimensionality
    • ALENEX'01, Springer
    • E. Chávez and G. Navarro. A Probabilistic Spell for the Curse of Dimensionality. In ALENEX'01, LNCS 2153, pages 147-160. Springer, 2001.
    • (2001) LNCS , vol.2153 , pp. 147-160
    • Chávez, E.1    Navarro, G.2
  • 7
    • 70350459185 scopus 로고    scopus 로고
    • Efficient processing of metric skyline queries
    • L. Chen and X. Lian. Efficient processing of metric skyline queries. IEEE Trans. on Knowl. and Data Eng., 21(3):351-365, 2009.
    • (2009) IEEE Trans. on Knowl. and Data Eng. , vol.21 , Issue.3 , pp. 351-365
    • Chen, L.1    Lian, X.2
  • 8
    • 84993661659 scopus 로고    scopus 로고
    • M-tree: An efficient access method for similarity search in metric spaces
    • P. Ciaccia, M. Patella, and P. Zezula. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In VLDB'97, pages 426-435, 1997.
    • (1997) VLDB'97 , pp. 426-435
    • Ciaccia, P.1    Patella, M.2    Zezula, P.3
  • 9
    • 84890519621 scopus 로고    scopus 로고
    • Processing complex similarity queries with distance-based access methods
    • H.-J. Schek, F. Saltor, I. Ramos, and G. Alonso, editors, Advances in Database Technology - EDBT'98, 6th International Conference on Extending Database Technology, Valencia, Spain, March 23-27, 1998, Proceedings, Springer
    • P. Ciaccia, M. Patella, and P. Zezula. Processing complex similarity queries with distance-based access methods. In H.-J. Schek, F. Saltor, I. Ramos, and G. Alonso, editors, Advances in Database Technology - EDBT'98, 6th International Conference on Extending Database Technology, Valencia, Spain, March 23-27, 1998, Proceedings, volume 1377 of Lecture Notes in Computer Science, pages 9-23. Springer, 1998.
    • (1998) Lecture Notes in Computer Science , vol.1377 , pp. 9-23
    • Ciaccia, P.1    Patella, M.2    Zezula, P.3
  • 10
    • 43249093335 scopus 로고    scopus 로고
    • Image retrieval: Ideas, inuences, and trends of the new age
    • R. Datta, D. Joshi, J. Li, and J. Z. Wang. Image retrieval: Ideas, inuences, and trends of the new age. ACM Computing Surveys, 40(2):1-60, 2008.
    • (2008) ACM Computing Surveys , vol.40 , Issue.2 , pp. 1-60
    • Datta, R.1    Joshi, D.2    Li, J.3    Wang, J.Z.4
  • 11
    • 70549112171 scopus 로고    scopus 로고
    • On fuzzy vs. metric similarity search in complex databases
    • Proc. 8th Conference on Flexible Query Answering Systems (FQAS'09). Springer
    • A. Eckhardt, T. Skopal, and P. Vojtáš. On fuzzy vs. metric similarity search in complex databases. In Proc. 8th Conference on Flexible Query Answering Systems (FQAS'09), volume 5822 of LNAI, pages 64-75. Springer, 2009.
    • (2009) LNAI , vol.5822 , pp. 64-75
    • Eckhardt, A.1    Skopal, T.2    Vojtáš, P.3
  • 12
    • 0033075316 scopus 로고    scopus 로고
    • Combining fuzzy information from multiple systems
    • R. Fagin. Combining fuzzy information from multiple systems. J. Comput. Syst. Sci., 58(1):83-99, 1999.
    • (1999) J. Comput. Syst. Sci. , vol.58 , Issue.1 , pp. 83-99
    • Fagin, R.1
  • 14
    • 78649833754 scopus 로고    scopus 로고
    • Ptolemaic indexing
    • abs/0911.4384
    • M. L. Hetland. Ptolemaic indexing. CoRR, abs/0911.4384, 2009.
    • (2009) CoRR
    • Hetland, M.L.1
  • 15
    • 3142640471 scopus 로고    scopus 로고
    • Incremental similarity search in multimedia databases
    • Univ. of Maryland, College Park
    • G. Hjaltason and H. Samet. Incremental similarity search in multimedia databases, Comp. Science Dept. TR-4199, Univ. of Maryland, College Park, 2000.
    • (2000) Comp. Science Dept. TR-4199
    • Hjaltason, G.1    Samet, H.2
  • 18
    • 0003159276 scopus 로고
    • A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements
    • M. L. Mico, J. Oncina, and E. Vidal. A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements. Pattern Recogn. Lett., 15(1):9-17, 1994.
    • (1994) Pattern Recogn. Lett. , vol.15 , Issue.1 , pp. 9-17
    • Mico, M.L.1    Oncina, J.2    Vidal, E.3
  • 21
    • 36949005004 scopus 로고    scopus 로고
    • Unified framework for fast exact and approximate search in dissimilarity spaces
    • T. Skopal. Unified framework for fast exact and approximate search in dissimilarity spaces. ACM Transactions on Database Systems, 32(4):1-46, 2007.
    • (2007) ACM Transactions on Database Systems , vol.32 , Issue.4 , pp. 1-46
    • Skopal, T.1
  • 22
    • 78649893329 scopus 로고    scopus 로고
    • On nonmetric similarity search problems in complex domains
    • issue tentative, available at
    • T. Skopal and B. Bustos. On Nonmetric Similarity Search Problems in Complex Domains. ACM Computing Surveys 44(3), 2012, issue tentative, available at http://siret.ms.mff.cuni.cz/skopal/pub/nmsurvey.pdf.
    • (2012) ACM Computing Surveys , vol.44 , Issue.3
    • Skopal, T.1    Bustos, B.2
  • 23
    • 0019887799 scopus 로고
    • Identification of common molecular subsequences
    • T. Smith and M. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147(1):195-197, 1981.
    • (1981) Journal of Molecular Biology , vol.147 , Issue.1 , pp. 195-197
    • Smith, T.1    Waterman, M.2


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