메뉴 건너뛰기




Volumn , Issue , 2009, Pages 9-14

Efficient top-k algorithms for fuzzy search in string collections

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE QUERY; APPROXIMATE STRING QUERY; DATA CLEANING; EARLY TERMINATION; EDIT DISTANCE; EFFICIENT ALGORITHM; INDEXING STRUCTURES; INVERTED LIST; K ALGORITHM; QUERY RELAXATION; QUERY STRING; RANGE QUERY; RANKING QUERIES; REAL DATA SETS; SEARCH QUERIES; SEARCH TECHNIQUE; SIMILARITY FUNCTIONS; SPELL-CHECKING; USER QUERY;

EID: 70350655932     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1557670.1557677     Document Type: Conference Paper
Times cited : (25)

References (12)
  • 1
    • 85104914015 scopus 로고    scopus 로고
    • Efficient exact set-similarity joins
    • pages 918-929
    • A. Arasu, V. Ganti, and R. Kaushik. Efficient exact set-similarity joins. In VLDB, pages 918-929, 2006.
    • (2006) VLDB
    • Arasu, A.1    Ganti, V.2    Kaushik, R.3
  • 2
    • 35348849154 scopus 로고    scopus 로고
    • Scaling up all pairs similarity search
    • pages 131-140
    • R. J. Bayardo, Y. Ma, and R. Srikant. Scaling up all pairs similarity search. In WWW, pages 131-140, 2007.
    • (2007) WWW
    • Bayardo, R.J.1    Ma, Y.2    Srikant, R.3
  • 3
    • 0029706597 scopus 로고    scopus 로고
    • Combining fuzzy information from multiple systems
    • pages 216-226
    • R. Fagin. Combining fuzzy information from multiple systems. In PODS, pages 216-226, 1996.
    • (1996) PODS
    • Fagin, R.1
  • 4
    • 0034819889 scopus 로고    scopus 로고
    • Optimal aggregation algorithms for middleware
    • R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In PODS, 2001.
    • (2001) PODS
    • Fagin, R.1    Lotem, A.2    Naor, M.3
  • 6
    • 52649145249 scopus 로고    scopus 로고
    • Fast indexes and algorithms for set similarity selection queries
    • pages 267-276
    • 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
    • Hadjieleftheriou, M.1    Chandel, A.2    Koudas, N.3    Srivastava, D.4
  • 7
    • 55349093583 scopus 로고    scopus 로고
    • A Survey of Top-k Query Processing Techniques in Relational Database Systems
    • I. Ilyas, G. Beskales, and M. A. Soliman. A Survey of Top-k Query Processing Techniques in Relational Database Systems. ACM Computing Surveys, 2008.
    • (2008) ACM Computing Surveys
    • Ilyas, I.1    Beskales, G.2    Soliman, M.A.3
  • 8
    • 34250670467 scopus 로고    scopus 로고
    • Record linkage: Similarity measures and algorithms
    • pages 802-803
    • N. Koudas, S. Sarawagi, and D. Srivastava. Record linkage: similarity measures and algorithms. In SIGMOD Conference, pages 802-803, 2006.
    • (2006) SIGMOD Conference
    • Koudas, N.1    Sarawagi, S.2    Srivastava, D.3
  • 9
    • 52649086729 scopus 로고    scopus 로고
    • Efficient merging and filtering algorithms for approximate string searches
    • pages 257-266
    • C. Li, J. Lu, and Y. Lu. Efficient merging and filtering algorithms for approximate string searches. In ICDE, pages 257-266, 2008.
    • (2008) ICDE
    • Li, C.1    Lu, J.2    Lu, Y.3
  • 10
    • 85011032600 scopus 로고    scopus 로고
    • VGRAM: Improving performance of approximate queries on string collections using variable-length grams
    • pages 303-314
    • C. Li, B. Wang, and X. Yang. VGRAM: Improving performance of approximate queries on string collections using variable-length grams. In VLDB, pages 303-314, 2007.
    • (2007) VLDB
    • Li, C.1    Wang, B.2    Yang, X.3
  • 11
    • 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. (Pubitemid 33768480)
    • (2001) ACM Computing Surveys , vol.33 , Issue.1 , pp. 31-88
    • Navarro, G.1
  • 12
    • 3142777876 scopus 로고    scopus 로고
    • Efficient set joins on similarity predicates
    • pages 743-754
    • S. Sarawagi and A. Kirpal. Efficient set joins on similarity predicates. In SIGMOD Conference, pages 743-754, 2004.
    • (2004) SIGMOD Conference
    • Sarawagi, S.1    Kirpal, A.2


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