Efficient exact edit similarity query processing with the asymmetric signature scheme

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2011, Pages 1033-1044

  Qin, Jianbin ^a   Wang, Wei ^a   Lu, Yifei ^a   Xiao, Chuan ^a   Lin, Xuemin ^a,b  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

^b EAST CHINA NORMAL UNIVERSITY   (China)

Author keywords

approximate pattern matching; edit distance; Q gram; similarity join; similarity search

Indexed keywords

AUTHENTICATION; DYNAMIC PROGRAMMING; PATTERN MATCHING;

APPROXIMATE PATTERN MATCHING; ASYMMETRIC SIGNATURE; EDIT DISTANCE; LOW BOUND; Q-GRAMS; QUERY STRING; SIGNATURE SCHEME; SIMILARITY JOIN; SIMILARITY QUERY; SIMILARITY SEARCH;

QUERY PROCESSING;

EID: 79960001806     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989323.1989431     Document Type: Conference Paper

References (39)

1. S. F. Altschul, W. Gish, W. Miller, E. W. Myers, and D. J. Lipman. Basic local alignment search tool. Journal of molecular biology, 215(3):403-410, 1990.
2. A. Arasu, V. Ganti, and R. Kaushik. Efficient exact set-similarity joins. In VLDB, 2006.
3. R. J. Bayardo, Y. Ma, and R. Srikant. Scaling up all pairs similarity search. In WWW, 2007.
4. A. Z. Broder. On the resemblance and containment of documents. In SEQS, 1997.
5. A. Z. Broder, S. C. Glassman, M. S. Manasse, and G. Zweig. Syntactic clustering of the web. Computer Networks, 29(8-13):1157-1166, 1997. (Pubitemid 127818518)
6. M. Charikar. Similarity estimation techniques from rounding algorithms. In STOC, 2002.
7. S. Chaudhuri, V. Ganti, and R. Kaushik. A primitive operator for similarity joins in data cleaning. In ICDE, 2006.
8. S. Chaudhuri and R. Kaushik. Extending autocompletion to tolerate errors. In SIGMOD Conference, 2009.
9. A. Chowdhury, O. Frieder, D. A. Grossman, and M. C. McCabe. Collection statistics for fast duplicate document detection. ACM Trans. Inf. Syst., 20(2):171-191, 2002. (Pubitemid 44642301)
10. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In VLDB, pages 426-435, 1997.
11. V. Dohnal, C. Gennaro, P. Savino, and P. Zezula. Similarity join in metric spaces. In ECIR, pages 452-467, 2003.
12. V. Dohnal, C. Gennaro, and P. Zezula. Similarity join in metric spaces using ed-index. In DEXA, 2003.
13. G. Forman, K. Eshghi, and S. Chiocchetti. Finding similar files in large document repositories. In KDD, 2005.
14. A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In VLDB, 1999.
15. 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, 2001.
16. L. Gravano, P. G. Ipeirotis, H. V. Jagadish, N. Koudas, S. Muthukrishnan, and D. Srivastava. Approximate string joins in a database (almost) for free (erratum). Technical Report CUCS-011-03, Columbia University, 2003.
17. A. Guttman. R-trees: A dynamic index structure for spatial searching. In SIGMOD Conference, pages 47-57, 1984.
18. M. Hadjieleftheriou and C. Li. Efficient approximate search on string collections. PVLDB, 2(2):1660-1661, 2009.
19. T. Kahveci and A. K. Singh. Efficient index structures for string databases. In VLDB, pages 351-360, 2001.
20. N. Koudas and K. C. Sevcik. High dimensional similarity joins: Algorithms and performance evaluation. IEEE Trans. Knowl. Data Eng., 12(1):3-18, 2000.
21. C. Li, J. Lu, and Y. Lu. Efficient merging and filtering algorithms for approximate string searches. In ICDE, 2008.
22. C. Li, B. Wang, and X. Yang. VGRAM: Improving performance of approximate queries on string collections using variable-length grams. In VLDB, 2007.
23. G. Navarro. A guided tour to approximate string matching. ACM Comput. Surv., 33(1):31-88, 2001. (Pubitemid 33768480)
24. G. Navarro and R. A. Baeza-Yates. A practical q -gram index for text retrieval allowing errors. CLEI Electron. J., 1(2), 1998.
25. G. Navarro and L. Salmela. Indexing variable length substrings for exact and approximate matching. In SPIRE, pages 214-221, 2009.
26. S. Sarawagi and A. Kirpal. Efficient set joins on similarity predicates. In SIGMOD, 2004.
27. D. Sokol, G. Benson, and J. Tojeira. Tandem repeats over the edit distance. Bioinformatics, 23(2):30-35, 2007.
28. B. Stein. Principles of hash-based text retrieval. In SIGIR, pages 527-534, 2007.
29. B. S. T. Bocek, E. Hunt. Fast Similarity Search in Large Dictionaries. Technical Report ifi-2007.02, Department of Informatics, University of Zurich, April 2007.
30. M. Theobald, J. Siddharth, and A. Paepcke. Spotsigs: robust and efficient near duplicate detection in large web collections. In SIGIR, pages 563-570, 2008.
31. R. A. Wagner and M. J. Fischer. The string-to-string correction problem. J. ACM, 21(1):168-173, 1974.
32. J. Wang, J. Feng, and G. Li. Trie-join: Efficient trie-based string similarity joins with edit. In VLDB, 2010.
33. W. Wang, C. Xiao, X. Lin, and C. Zhang. Efficient approximate entity extraction with edit constraints. In SIMGOD, 2009.
34. 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.
35. J. Xu, Z. Zhang, A. K. H. Tung, and G. Yu. Efficient and effective similarity search over probabilistic data based on earth mover's distance. PVLDB, 3(1):758-769, 2010.
36. X. Yang, B. Wang, and C. Li. Cost-based variable-length-gram selection for string collections to support approximate queries efficiently. In SIGMOD Conference, pages 353-364, 2008.
37. R. Zhang, B. C. Ooi, and K.-L. Tan. Making the pyramid technique robust to query types and workloads. In ICDE, pages 313-324, 2004.
38. 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 Conference, pages 915-926, 2010.
39. Z. Zhang, B. C. Ooi, S. Parthasarathy, and A. K. H. Tung. Similarity search on bregman divergence: Towards non-metric indexing. PVLDB, 2(1):13-24, 2009.