Space-constrained gram-based indexing for efficient approximate string search

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2009, Pages 604-615

  Behm, Alexander ^a   Ji, Shengyue ^a   Li, Chen ^a   Lu, Jiaheng ^b  

^a Irvine   (United States)

^b RENMIN UNIVERSITY OF CHINA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE QUERY; APPROXIMATE STRING QUERY; COMPRESSION TECHNIQUES; DATA CLEANING; INDEXING STRUCTURES; NEW OPPORTUNITIES; PERFORMANCE PENALTIES; QUERY PERFORMANCE; QUERY RELAXATION; REAL DATA SETS; SPELL-CHECKING; STRING SEARCH; USER QUERY;

INDEXING (OF INFORMATION);

INDEXING (MATERIALS WORKING);

EID: 67649641448     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2009.32     Document Type: Conference Paper

References (31)

1. V. N. Anh and A. Moffat. Inverted index compression using wordaligned binary codes. Inf. Retr., 8(1):151-166, 2005.
2. A. Arasu, V. Ganti, and R. Kaushik. Efficient exact set-similarity joins. In VLDB, pages 918-929, 2006.
3. R. J. Bayardo, Y. Ma, and R. Srikant. Scaling up all pairs similarity search. In WWW, pages 131-140, 2007.
4. A. Behm, S. Ji, C. Li, and J. Lu. Space-constrained gram-based indexing for efficient approximate string search (full version). Technical report, Department of Computer Science, UC Irvine, June 2008.
5. 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.
6. S. Chaudhuri, V. Ganti, and R. Kaushik. A primitive operator for similarity joins in data cleaning. In ICDE, page 5, 2006.
7. P. Elias. Universal codeword sets and representations of the integers. Information Theory, IEEE Transactions on, 21(2):194-203, Mar 1975.
8. Z. Galil and G. F. Italiano. Data structures and algorithms for disjoint set union problems. ACM Comput. Surv., 23(3):319-344, 1991.
9. S. Golomb. Run-length encodings (corresp.). Information Theory, IEEE Transactions on, 12(3):399-401, Jul 1966.
10. 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.
11. M. Hadjieleftheriou, A. Chandel, N. Koudas, and D. Srivastava. Fast indexes and algorithms for set similarity selection queries. In ICDE, pages 267-276, 2008.
12. M. Hadjieleftheriou, X. Yu, N. Koudas, and D. Srivastava. Hashed samples: Selectivity estimators for set similarity selection queries. In VLDB, 2008.
13. B. Hore, H. Hacigümüs, B. R. Iyer, and S. Mehrotra. Indexing text data under space constraints. In CIKM, pages 198-207, 2004.
14. P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In STOC Conference, 1998.
15. H. V. Jagadish, R. T. Ng, and D. Srivastava. Substring selectivity estimation. In PODS, pages 249-260, 1999.
16. L. Jin and C. Li. Selectivity estimation for fuzzy string predicates in large data sets. In VLDB, pages 397-408, 2005.
17. 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.
18. P. Krishnan, J. S. Vitter, and B. R. Iyer. Estimating alphanumeric selectivity in the presence of wildcards. In SIGMOD Conference, pages 282-293, 1996.
19. 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.
20. C. Li, J. Lu, and Y. Lu. Efficient merging and filtering algorithms for approximate string searches. In ICDE, pages 257-266, 2008.
21. 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.
22. A. Mazeika, M. H. Böhlen, N. Koudas, and D. Srivastava. Estimating the selectivity of approximate string queries. ACM Trans. Database Syst., 32(2):12, 2007.
23. M. D. McIllroy. Development of a spelling list. IEEE Transactions on Communications, 30(1):91-99, 1998.
24. A. Moffat and J. Zobel. Self-indexing inverted files for fast text retrieval. ACM Trans. Inf. Syst., 14(4):349-379, 1996.
25. G. Navarro. A guided tour to approximate string matching. ACM Comput. Surv., 33(1):31-88, 2001.
26. S. C. Sahinalp, M. Tasan, J. Macker, and Z. M. Özsoyoglu. Distance based indexing for string proximity search. In ICDE, pages 125-, 2003.
27. S. Sarawagi and A. Kirpal. Efficient set joins on similarity predicates. In SIGMOD Conference, pages 743-754, 2004.
28. C. Xiao, W. Wang, X. Lin, and J. X. Yu. Efficient similarity joins for near duplicate detection. In WWW, pages 131-140, 2008.
29. X. Yang, B. Wang, and C. Li. Cost-based variable-length-gram selection for string collections to support approximate queries efficiently. In SIGMOD Conference, 2008.
30. J. Ziv and A. Lempel. Compression of individual sequences via variablerate coding. IEEE Transactions on Information Theory, 24(5):530-536,1978.
31. J. Zobel and A. Moffat. Inverted files for text search engines. ACM Comput. Surv., 38(2):6, 2006.