Cost-based variable-length-gram Selection for string collections to support approximate queries efficiently

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2008, Pages 353-364

  Yang, Xiaochun ^a   Wang, Bin ^a   Li, Chen ^b  

^a NORTHEASTERN UNIVERSITY   (China)

^b Irvine   (United States)

Author keywords

Approximate string query; Gram selection; VGRAM

Indexed keywords

CONTROL THEORY; SYSTEMS ENGINEERING;

APPROXIMATE QUERIES; APPROXIMATE STRING QUERY; DYNAMIC PROGRAMMING ALGORITHMS; FUNDAMENTAL PROBLEMS; GRAM SELECTION; INDEX STRUCTURES; LOWER BOUNDS; QUANTITATIVE APPROACHES; QUERY PERFORMANCES; REAL DATA SETS; RECORD LINKAGES; SUBSTRINGS; VGRAM; WEB SEARCHES;

WORLD WIDE WEB;

EID: 57149130672     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1376616.1376655     Document Type: Conference Paper

References (22)

1. A. Arasu, V. Ganti, and R. Kaushik, Exact set-similarity joins. In VLDB, pages 918-929, 2006.
2. R. Bayardo, Y. Ma, and R. Srikant. Scaling up all-pairs similarity search. In WWW Conference, 2007.
3. V. R. Carvalho and W. W. Cohen. Improving "email speech acts" analysis via n-gram selection. In Analyzing Conversations in Text and Speech (ACTS) Workshop at HLT-NAACL, pages 35-41, 2006.
4. S. Chaudhuri, K. Ganjam, V. Ganti, and R. Motwani. Robust and efficient fuzzy match for online data cleaning. In SIGMOD, pages 313-324, 2003.
5. S. Chaudhuri, V. Ganti, and L. Gravano. Selectivity estimation for string predicates: Overcoming the underestimation problem. In ICDE, pages 227-238, 2004.
6. S. Chaudhuri, V. Ganti, and R. Kaushik. A primitive operator for similarity joins in data cleaning. In ICDE, page 5, 2006.
7. P. Fogla and W. Lee. q-Gram matching using tree models. IEEE TKDE, 18(4), 2006.
8. L. Gravano, P. G. Ipeirotis, H. V. Jagadish, N. Koudas, S. Muthukrishnan, and D. Srivastava. Approximate string joins in a database (almost) for free. In VLDB, pages 491-500, 2001.
9. M. Hadjieleftheriou, A. Chandel, N. Koudas, and D. Srivastava. Set similarity selection queries at interactive speeds. In ICDE, 2008.
10. B. Hore. H. Hacigumus, and B. Iyer. Indexing text data under space constraints. In Proceedings of CIKM, pages 198-207, 2004.
11. H. V. Jagadish, R. T. Ng, and D. Srivastava. Substring selectivity estimation. In PODS, pages 249-260, 1999.
12. L. Jin and C. Li. Selectivity estimation for fuzzy string predicates in large data sets. In VLDB, pages 397-408, 2005.
13. M.-S. Kim, K.-Y. Whang, J.-G. Lee, and M.-.J. Lee. n-Gram/2L: a space and time efficient two-level n-gram inverted index structure. In VLDB, pages 325-336, 2005.
14. N. Koudas, S. Sarawagi, and D. Srivastava. Record linkage: similarity measures and algorithms. In SIGMOD Tutorial, pages 802-803, 2005.
15. P. Krishnan, J. S. Vitter, and B. Iyer. Estimating alphanumeric selectivity in the presence of wildcards. In SIGMOD, pages 282-293, 1996.
16. 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.
17. C. Li, J. Lu, and Y. Lu. Efficient merging and filtering algorithms for approximate string searches. In ICDE, 2008.
18. 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.
19. A. Mazeika, M. H. Bóhlen, N. Koudas, and D. Srivastava. Estimating the selectivity of approximate string queries. ACM Transactions on Database Systems, 32(2), 2007.
20. G. Navarro. A guided tour to approximate string matching. ACM Comp. Surveys, 33(1):31-88, 2001.
21. S. C. Sahinalp, M. Tasan, J. Macker, and Z. M. Özsoyoglu. Distance based indexing for string proximity search. In ICDE, 2003.
22. S. Sarawagi and A. Kirpai. Efficient set joins on similarity predicates. In SIGMOD, pages 743-754, 2004.