Extending Q-grams to estimate selectivity of string matching with low edit distance

33rd International Conference on Very Large Data Bases, VLDB 2007 - Conference Proceedings

Volumn , Issue , 2007, Pages 195-206

  Lee, Hongrae ^a   Ng, Raymond T ^a   Shim, Kyuseok ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

QUERY LANGUAGES;

APPROXIMATE STRING MATCHING; COMBINATORIAL ANALYSIS; DATABASE APPLICATIONS; EDIT DISTANCE; SELECTIVITY ESTIMATION; STATE-OF-THE-ART METHODS; STRING MATCHING; STRING SIMILARITY;

ESTIMATION;

EID: 85011072445     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. A. Aboulnaga, A. R. Almeldeen and J. F. Naughton. Estimating the selectivity of XML path expressions for Internet scale applications. Proc. VLDB, pp. 591-600, 2001.
2. R. Agrawal and R. Srikant. Fast Algorithms for Mining Association Rules. Proc. VLDB, pp. 487-499, 1994.
3. R. Baeza-Yates and B. A. Ribeiro-Neto. Modern Information Retrieval. ACM Press/Addison-Wesley, 1999.
4. S. Burkhardt and J. Karkkianen. One-gapped q-Gram Filters for Levenshtein Distance, Springer, LNCS, pp. 225-234, 2002.
5. S. Burkhardt et al. Q-gram based database searching using a suffix array (QUASAR), Proc. RECOMB, pp. 77-83, 1999.
6. S. Chaudhuri, V. Ganti and L. Gravano. Selectivity Estimation for String Predicates: Overcoming the Underestimation Problem. Proc. ICDE, pp. 227-238, 2004.
7. S. Chaudhuri et al. Robust and Efficient Fuzzy Match for Online Data Cleaning. Proc. SIGMOD, pp. 313-324, 2003.
8. W. Cohen, P. Ravikmar and and S. Fienberg. A Comparison of String Metrics for Matching Names and Records. Proc. of KDD Workshop on Data Cleaning, pp. 73-78, 2003.
9. R. Dixon and T. Martin. Automatic Speech and Speaker Recognition. IEEE Press, 1979.
10. Flamingo Project, http://www.ics.uci.edu/flamingo/.
11. L. Gravano et al. Approximate string joins in a database (almost) for free. Proc. VLDB, pp. 491-500, 2001.
12. D. Gusfield. Algorithms on Strings, Trees and Sequences. Cambridge Univ. Press, 1997.
13. B. Hore et al. Indexing Text Data under Space Constraints. Proc. CIKM, pp. 198-207, 2004.
14. H. V. Jagadish, R. T. Ng and D. Srivastava. Substring Selectivity Estimation, Proc. PODS, pp. 249-260, 1999.
15. L. Jin and C. Li. Selectivity Estimation for Fuzzy String Predicates in Large Data Sets, Proc. VLDB, pp. 397-408, 2005.
16. L. Jin et al. Indexing Mixed Types for Approximate Retrieval, Proc. VLDB, pp. 793-804, 2005.
17. P. Krishnan, J. S. Vitter and B. Iyer. Estimating Alphanumeric Selectivity in the Presence of Wildcards. Proc. SIGMOD, pp. 282-293, 1996.
18. M. Ley. DBLP, http://www.fnformatick.uni-tier.de/ley/db.
19. L. Lim et al. XPathLearner: An on-line self-tuning Markov histogram for XML path selectivity estimation. Proc. VLDB, pp. 442-453, 2002.
20. G. Navarro. A Guided Tour to Approximate String Matching. ACM Computing Survey, 33, pp. 31-88, 2001.
21. G. Navarro and M. Raffinot. Fast and flexible string matching by combining bit-parallelism and suffix automata. Journal of Experimental Algorithmics, Volume 5, article 4, 2000.
22. S. Sarawagi and A. Bhamidipaty. Interactive Deduplication Using Active Learning. Proc. VLDB, pp. 269-278, 2002.
23. Winkler, W. E. The State of Record Linkage and Current Research Problems. Statistics of Income Division, Internal Revenue Service Publication R99/04.