메뉴 건너뛰기




Volumn 152, Issue , 2006, Pages

M-Chord: A scalable distributed similarity search structure

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA REDUCTION; DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; DISTRIBUTED DATABASE SYSTEMS; SCALABILITY;

EID: 34547289659     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1146847.1146866     Document Type: Conference Paper
Times cited : (52)

References (21)
  • 2
    • 18744390055 scopus 로고    scopus 로고
    • SWAM: A family of access methods for similarity-search in peer-to-peer data networks
    • ACM Press
    • F. Banaei-Kashani and C. Shahabi. SWAM: A family of access methods for similarity-search in peer-to-peer data networks. In Proceedings of CIKM 2004, pages 304 313. ACM Press, 2004.
    • (2004) Proceedings of CIKM 2004 , pp. 304-313
    • Banaei-Kashani, F.1    Shahabi, C.2
  • 3
    • 24144482348 scopus 로고    scopus 로고
    • A scalable nearest neighbor search in P2P systems
    • Proceedings of DBISP 2P 2004, Toronto, Canada, Revised Selected Papers, of, Springer
    • M. Batko, C. Gennaro, and P. Zezula. A scalable nearest neighbor search in P2P systems. In Proceedings of DBISP 2P 2004, Toronto, Canada, Revised Selected Papers, volume 3367 of LNCS, pages 79 92. Springer, 2004.
    • (2004) LNCS , vol.3367 , pp. 79-92
    • Batko, M.1    Gennaro, C.2    Zezula, P.3
  • 6
    • 21844431675 scopus 로고    scopus 로고
    • Mercury: Supporting scalable multi-attribute range queries
    • A. R. Bharambe, M. Agrawal, and S. Seshan. Mercury: Supporting scalable multi-attribute range queries. SIGCOMM Comput. Commun. Rev., 34(4):353 366, 2004.
    • (2004) SIGCOMM Comput. Commun. Rev , vol.34 , Issue.4 , pp. 353-366
    • Bharambe, A.R.1    Agrawal, M.2    Seshan, S.3
  • 7
    • 0041339760 scopus 로고    scopus 로고
    • Pivot selection techniques for proximity searching in metric spaces
    • B. Bustos, G. Navarro, and E. Chavez. Pivot selection techniques for proximity searching in metric spaces. Pattern Recognition Letters, 24(14):2357 2366, 2003.
    • (2003) Pattern Recognition Letters , vol.24 , Issue.14 , pp. 2357-2366
    • Bustos, B.1    Navarro, G.2    Chavez, E.3
  • 8
    • 84892599957 scopus 로고    scopus 로고
    • MAAN: A multi-attribute addressable network for grid information services
    • Washington, DC, USA. IEEE Computer Society
    • M. Cai, M. Frank, J. Chen, and P. Szekely. MAAN: A multi-attribute addressable network for grid information services. In Proceedings of GRID 2003, pages 184 191, Washington, DC, USA. IEEE Computer Society, 2003.
    • (2003) Proceedings of GRID 2003 , pp. 184-191
    • Cai, M.1    Frank, M.2    Chen, J.3    Szekely, P.4
  • 9
    • 84993661659 scopus 로고    scopus 로고
    • M-tree: An efficient access method for similarity search in metric spaces
    • Morgan Kaufmann
    • P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In Proceedings of VLDB 1997, Athens, Greece, pages 426 435. Morgan Kaufmann, 1997.
    • (1997) Proceedings of VLDB 1997, Athens, Greece , pp. 426-435
    • Ciaccia, P.1    Patella, M.2    Zezula, P.3
  • 10
    • 0042194447 scopus 로고    scopus 로고
    • D-index: Distance searching index for metric data sets
    • V. Dohnal, C. Gennaro, P. Savino, and P. Zezula. D-index: Distance searching index for metric data sets. Multimedia Tools Appl., 21(1):9 33, 2003.
    • (2003) Multimedia Tools Appl , vol.21 , Issue.1 , pp. 9-33
    • Dohnal, V.1    Gennaro, C.2    Savino, P.3    Zezula, P.4
  • 11
    • 34547457056 scopus 로고    scopus 로고
    • A content-addressable network for similarity search in metric spaces
    • Norway
    • F. Falchi, C. Gennaro, and P. Zezula. A content-addressable network for similarity search in metric spaces. In Proceedings of DBISP2P 2005, Trondheim, Norway, pages 126 137, 2005.
    • (2005) Proceedings of DBISP2P 2005, Trondheim , pp. 126-137
    • Falchi, F.1    Gennaro, C.2    Zezula, P.3
  • 13
    • 0022736864 scopus 로고
    • Order-preserving key transformations
    • A. K. Garg and C. C. Gotlieb. Order-preserving key transformations. ACM Trans. Database Syst., 11(2):213 234, 1986.
    • (1986) ACM Trans. Database Syst , vol.11 , Issue.2 , pp. 213-234
    • Garg, A.K.1    Gotlieb, C.C.2
  • 14
    • 0041664272 scopus 로고    scopus 로고
    • Index-driven similarity search in metric spaces
    • G. R. Hjaltason and H. Samet. Index-driven similarity search in metric spaces. ACM Trans. Database Syst., 28(4):517 580, 2003.
    • (2003) ACM Trans. Database Syst , vol.28 , Issue.4 , pp. 517-580
    • Hjaltason, G.R.1    Samet, H.2
  • 15
    • 23944466912 scopus 로고    scopus 로고
    • +-tree based indexing method for nearest neighbor search. ACM Transactions on Database Systems (TODS 2005), 30(2):364 397, 2005.
    • +-tree based indexing method for nearest neighbor search. ACM Transactions on Database Systems (TODS 2005), 30(2):364 397, 2005.
  • 16
    • 0002619432 scopus 로고
    • Binary codes capable of correcting spurious insertions and deletions of ones
    • V. I. Levenshtein. Binary codes capable of correcting spurious insertions and deletions of ones. Problems of Information Transmission, 1:8 17, 1965.
    • (1965) Problems of Information Transmission , vol.1 , pp. 8-17
    • Levenshtein, V.I.1
  • 19
    • 28444462873 scopus 로고    scopus 로고
    • A distributed quadtree index for peer-to-peer settings
    • IEEE Computer Society
    • E. Tanin, A. Harwood, and H. Samet. A distributed quadtree index for peer-to-peer settings. In ICDE, pages 254 255. IEEE Computer Society, 2005.
    • (2005) ICDE , pp. 254-255
    • Tanin, E.1    Harwood, A.2    Samet, H.3


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