메뉴 건너뛰기




Volumn 6612 LNCS, Issue , 2011, Pages 412-423

Batch text similarity search with mapreduce

Author keywords

Batch Text Similarity Search; MapReduce

Indexed keywords

INVERTED INDEX STRUCTURES; MAP-REDUCE; REAL DATA SETS; TEXT QUERY; TEXT SIMILARITY; TWO-STAGE ALGORITHM;

EID: 79955119726     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20291-9_46     Document Type: Conference Paper
Times cited : (11)

References (15)
  • 2
    • 85030321143 scopus 로고    scopus 로고
    • Mapreduce: Simplified data processing on large clusters
    • Dean, J., Ghemawat, S.: Mapreduce: Simplified data processing on large clusters. In: OSDI (2004)
    • (2004) OSDI
    • Dean, J.1    Ghemawat, S.2
  • 3
    • 77954744650 scopus 로고    scopus 로고
    • Efficient parallel set-similarity joins using mapreduce
    • Vernica, R., Carey, M.J., Li, C.: Efficient parallel set-similarity joins using mapreduce. In: SIGMOD (2010)
    • (2010) SIGMOD
    • Vernica, R.1    Carey, M.J.2    Li, C.3
  • 7
    • 84994828276 scopus 로고    scopus 로고
    • Similarity search for web services
    • Morgan Kaufmann, San Francisco
    • Dong, X., Halevy, A.Y., Madhavan, J., Nemes, E., Zhang, J.: Similarity search for web services. In: VLDB, pp. 372-383. Morgan Kaufmann, San Francisco (2004)
    • (2004) VLDB , pp. 372-383
    • Dong, X.1    Halevy, A.Y.2    Madhavan, J.3    Nemes, E.4    Zhang, J.5
  • 9
    • 18744365577 scopus 로고    scopus 로고
    • Efficient similarity string joins in large data sets
    • Jin, L., Li, C., Mehrotra, S.: Efficient similarity string joins in large data sets. In: VLDB (2002)
    • (2002) VLDB
    • Jin, L.1    Li, C.2    Mehrotra, S.3
  • 10
    • 85104914015 scopus 로고    scopus 로고
    • Efficient exact set-similarity joins
    • ACM, New York
    • Arasu, A., Ganti, V., Kaushik, R.: Efficient exact set-similarity joins. In: VLDB, pp. 918-929. ACM, New York (2006)
    • (2006) VLDB , pp. 918-929
    • Arasu, A.1    Ganti, V.2    Kaushik, R.3
  • 11
    • 3142777876 scopus 로고    scopus 로고
    • Efficient set joins on similarity predicates
    • ACM, New York
    • Sarawagi, S., Kirpal, A.: Efficient set joins on similarity predicates. In: SIGMOD, pp. 743-754. ACM, New York (2004)
    • (2004) SIGMOD , pp. 743-754
    • Sarawagi, S.1    Kirpal, A.2
  • 12
    • 33749597967 scopus 로고    scopus 로고
    • A primitive operator for similarity joins in data cleaning
    • DOI 10.1109/ICDE.2006.9, 1617373, Proceedings of the 22nd International Conference on Data Engineering, ICDE '06
    • Chaudhuri, S., Ganti, V., Kaushik, R.: A primitive operator for similarity joins in data cleaning. In: ICDE, p. 5. IEEE Computer Society, Los Alamitos (2006) (Pubitemid 44539797)
    • (2006) Proceedings - International Conference on Data Engineering , vol.2006 , pp. 5
    • Chaudhuri, S.1    Ganti, V.2    Kaushik, R.3
  • 13
    • 57349141410 scopus 로고    scopus 로고
    • Efficient similarity joins for near duplicate detection
    • ACM, New York
    • Xiao, C., Wang, W., Lin, X., Yu, J.X.: Efficient similarity joins for near duplicate detection. In: WWW, pp. 131-140. ACM, New York (2008)
    • (2008) WWW , pp. 131-140
    • Xiao, C.1    Wang, W.2    Lin, X.3    Yu, J.X.4
  • 14
    • 71749087578 scopus 로고    scopus 로고
    • Brute force and indexed approaches to pairwise document similarity comparisons with mapreduce
    • ACM, New York
    • Lin, J.: Brute force and indexed approaches to pairwise document similarity comparisons with mapreduce. In: SIGIR, pp. 155-162. ACM, New York (2009)
    • (2009) SIGIR , pp. 155-162
    • Lin, J.1
  • 15
    • 84870452716 scopus 로고    scopus 로고
    • Hadoop: Apache Hadoop, http://hadoop.apache.org/
    • Apache Hadoop


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