메뉴 건너뛰기




Volumn 5, Issue 3, 2011, Pages 253-264

Pass-Join: A partitionbased method for similarity joins

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE COMMUNITY; EDIT DISTANCE; INVERTED INDICES; PRUNING TECHNIQUES; REAL DATA SETS; SIMILARITY JOIN; STATE-OF-THE-ART METHODS; STRING SIMILARITY;

EID: 84862671407     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2078331.2078340     Document Type: Article
Times cited : (181)

References (26)
  • 1
    • 77950901996 scopus 로고    scopus 로고
    • Scalable ad-hoc entity extraction from text collections
    • S. Agrawal, K. Chakrabarti, S. Chaudhuri, and V. Ganti. Scalable ad-hoc entity extraction from text collections. PVLDB, 1(1):945-957, 2008.
    • (2008) PVLDB , vol.1 , Issue.1 , pp. 945-957
    • Agrawal, S.1    Chakrabarti, K.2    Chaudhuri, S.3    Ganti, V.4
  • 2
    • 85104914015 scopus 로고    scopus 로고
    • Efficient exact set-similarity joins
    • A. Arasu, V. Ganti, and R. Kaushik. Efficient exact set-similarity joins. In VLDB, pages 918-929, 2006.
    • (2006) VLDB , pp. 918-929
    • Arasu, A.1    Ganti, V.2    Kaushik, R.3
  • 3
    • 35348849154 scopus 로고    scopus 로고
    • Scaling up all pairs similarity search
    • R. J. Bayardo, Y. Ma, and R. Srikant. Scaling up all pairs similarity search. In WWW, pages 131-140, 2007.
    • (2007) WWW , pp. 131-140
    • Bayardo, R.J.1    Ma, Y.2    Srikant, R.3
  • 4
  • 5
    • 1142279457 scopus 로고    scopus 로고
    • Robust and efficient fuzzy match for online data cleaning
    • S. Chaudhuri, K. Ganjam, V. Ganti, and R. Motwani. Robust and efficient fuzzy match for online data cleaning. In SIGMOD Conference, pages 313-324, 2003.
    • (2003) SIGMOD Conference , pp. 313-324
    • Chaudhuri, S.1    Ganjam, K.2    Ganti, V.3    Motwani, R.4
  • 6
    • 33749597967 scopus 로고    scopus 로고
    • A primitive operator for similarity joins in data cleaning
    • S. Chaudhuri, V. Ganti, and R. Kaushik. A primitive operator for similarity joins in data cleaning. In ICDE, pages 5-16, 2006.
    • (2006) ICDE , pp. 5-16
    • Chaudhuri, S.1    Ganti, V.2    Kaushik, R.3
  • 8
    • 52649145249 scopus 로고    scopus 로고
    • Fast indexes and algorithms for set similarity selection queries
    • M. Hadjieleftheriou, A. Chandel, N. Koudas, and D. Srivastava. Fast indexes and algorithms for set similarity selection queries. In ICDE, pages 267-276, 2008.
    • (2008) ICDE , pp. 267-276
    • Hadjieleftheriou, M.1    Chandel, A.2    Koudas, N.3    Srivastava, D.4
  • 9
    • 70849096574 scopus 로고    scopus 로고
    • Incremental maintenance of length normalized indexes for approximate string matching
    • M. Hadjieleftheriou, N. Koudas, and D. Srivastava. Incremental maintenance of length normalized indexes for approximate string matching. In SIGMOD Conference, pages 429-440, 2009.
    • (2009) SIGMOD Conference , pp. 429-440
    • Hadjieleftheriou, M.1    Koudas, N.2    Srivastava, D.3
  • 10
    • 70349659026 scopus 로고    scopus 로고
    • Hashed samples: selectivity estimators for set similarity selection queries
    • M. Hadjieleftheriou, X. Yu, N. Koudas, and D. Srivastava. Hashed samples: selectivity estimators for set similarity selection queries. PVLDB, 1(1):201-212, 2008.
    • (2008) PVLDB , vol.1 , Issue.1 , pp. 201-212
    • Hadjieleftheriou, M.1    Yu, X.2    Koudas, N.3    Srivastava, D.4
  • 12
    • 85011072445 scopus 로고    scopus 로고
    • Extending q-grams to estimate selectivity of string matching with low edit distance
    • H. Lee, R. T. Ng, and K. Shim. Extending q-grams to estimate selectivity of string matching with low edit distance. In VLDB, pages 195-206, 2007.
    • (2007) VLDB , pp. 195-206
    • Lee, H.1    Ng, R.T.2    Shim, K.3
  • 13
    • 77957718350 scopus 로고    scopus 로고
    • Power-law based estimation of set similarity join size
    • H. Lee, R. T. Ng, and K. Shim. Power-law based estimation of set similarity join size. PVLDB, 2(1):658-669, 2009.
    • (2009) PVLDB , vol.2 , Issue.1 , pp. 658-669
    • Lee, H.1    Ng, R.T.2    Shim, K.3
  • 14
    • 52649086729 scopus 로고    scopus 로고
    • Efficient merging and filtering algorithms for approximate string searches
    • C. Li, J. Lu, and Y. Lu. Efficient merging and filtering algorithms for approximate string searches. In ICDE, 2008.
    • (2008) ICDE
    • Li, C.1    Lu, J.2    Lu, Y.3
  • 15
    • 79959922359 scopus 로고    scopus 로고
    • Faerie: efficient filtering algorithms for approximate dictionary-based entity extraction
    • G. Li, D. Deng, and J. Feng. Faerie: efficient filtering algorithms for approximate dictionary-based entity extraction. In SIGMOD Conference, pages 529-540, 2011.
    • (2011) SIGMOD Conference , pp. 529-540
    • Li, G.1    Deng, D.2    Feng, J.3
  • 17
    • 0345566149 scopus 로고    scopus 로고
    • A guided tour to approximate string matching
    • G. Navarro. A guided tour to approximate string matching. ACM Comput. Surv., 33(1):31-88, 2001.
    • (2001) ACM Comput. Surv. , vol.33 , Issue.1 , pp. 31-88
    • Navarro, G.1
  • 18
    • 3142777876 scopus 로고    scopus 로고
    • Efficient set joins on similarity predicates
    • S. Sarawagi and A. Kirpal. Efficient set joins on similarity predicates. In SIGMOD Conference, pages 743-754, 2004.
    • (2004) SIGMOD Conference , pp. 743-754
    • Sarawagi, S.1    Kirpal, A.2
  • 19
    • 77954744650 scopus 로고    scopus 로고
    • Efficient parallel set-similarity joins using mapreduce
    • R. Vernica, M. J. Carey, and C. Li. Efficient parallel set-similarity joins using mapreduce. In SIGMOD, 2010.
    • (2010) SIGMOD
    • Vernica, R.1    Carey, M.J.2    Li, C.3
  • 20
    • 79957822983 scopus 로고    scopus 로고
    • Trie-join: Efficient trie-based string similarity joins with edit-distance constraints
    • J. Wang, G. Li, and J. Feng. Trie-join: Efficient trie-based string similarity joins with edit-distance constraints. PVLDB, 3(1):1219-1230, 2010.
    • (2010) PVLDB , vol.3 , Issue.1 , pp. 1219-1230
    • Wang, J.1    Li, G.2    Feng, J.3
  • 21
    • 79957824788 scopus 로고    scopus 로고
    • Fast-join: An efficient method for fuzzy token matching based string similarity join
    • J. Wang, G. Li, and J. Feng. Fast-join: An efficient method for fuzzy token matching based string similarity join. In ICDE, pages 458-469, 2011.
    • (2011) ICDE , pp. 458-469
    • Wang, J.1    Li, G.2    Feng, J.3
  • 22
    • 70849115286 scopus 로고    scopus 로고
    • Efficient approximate entity extraction with edit distance constraints
    • W. Wang, C. Xiao, X. Lin, and C. Zhang. Efficient approximate entity extraction with edit distance constraints. In SIGMOD Conference, 2009.
    • (2009) SIGMOD Conference
    • Wang, W.1    Xiao, C.2    Lin, X.3    Zhang, C.4
  • 23
    • 70849105253 scopus 로고    scopus 로고
    • C. Xiao, W. Wang, and X. Lin. Ed-join: an efficient algorithm for similarity joins with edit distance constraints. PVLDB, 1(1):933-944, 2008.
    • C. Xiao, W. Wang, and X. Lin. Ed-join: an efficient algorithm for similarity joins with edit distance constraints. PVLDB, 1(1):933-944, 2008.
  • 24
    • 67649653766 scopus 로고    scopus 로고
    • Top-k set similarity joins
    • C. Xiao, W. Wang, X. Lin, and H. Shang. Top-k set similarity joins. In ICDE, pages 916-927, 2009.
    • (2009) ICDE , pp. 916-927
    • Xiao, C.1    Wang, W.2    Lin, X.3    Shang, H.4
  • 25
    • 66249113620 scopus 로고    scopus 로고
    • Efficient similarity joins for near duplicate detection
    • C. Xiao, W. Wang, X. Lin, and J. X. Yu. Efficient similarity joins for near duplicate detection. In WWW, 2008.
    • (2008) WWW
    • Xiao, C.1    Wang, W.2    Lin, X.3    Yu, J.X.4
  • 26
    • 77954747181 scopus 로고    scopus 로고
    • Bed-tree: an all-purpose index structure for string similarity search based on edit distance
    • Z. Zhang, M. Hadjieleftheriou, B. C. Ooi, and D. Srivastava. Bed-tree: an all-purpose index structure for string similarity search based on edit distance. In SIGMOD, 2010.
    • (2010) SIGMOD
    • Zhang, Z.1    Hadjieleftheriou, M.2    Ooi, B.C.3    Srivastava, D.4


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