Acknowledgement
Supported by : 정보통신기술진흥센터
References
- S. Sarawagi and A. Kirpal, "Efficient set joins on similarity predicates," Proc. of the ACM SIGMOD Conference, pp. 743-754, 2004.
- C. Li, J. Lu, and Y. Lu, "Efficient merging and filtering algorithms for approximate string searches," IEEE ICDE, pp. 257-266, 2008.
- C. Xiao, W. Wang, X. Lin, Ed-join: an efficient algorithm for similarity joins with edit distance constraints, PVLDB, 1, pp. 933-944, 2008.
- J. Kim and H. Lee, "Efficient exact similarity searches using multiple token orderings," IEEE ICDE, 2012.
- S. Chaudhuri, V. Ganti, and R. Kaushik, "A primitive operator for similarity joins in data cleaning," IEEE ICDE, p. 5, 2006.
- J. Kim, "An Effective Candidate Generation Method for Improving Performance of Edit Similarity Query Processing," Information Systems, Vol. 47, No. 1, pp. 116-128, 2015. https://doi.org/10.1016/j.is.2014.07.005
- G. Li, D. Deng, J. Wang, and J. Feng, "Pass-join: A partition based method for similarity joins," PVLDB, Vol. 5, pp. 253-264, 2011.
- J.Qin, W.Wang, Y.Lu, C.Xiao, and X.Lin, "Efficient exact edit similarity query processing with asymmetric signature schemes," Proc. of the ACM SIGMOD Conference, pp. 1033-1044, 2011.
- C. Li, B. Wang, and X. Yang, "VGRAM: Improving performance of approximate queries on string collections using variable-length grams," VLDB, pp. 303-314, 2007.
- J. Kim, C. Li, and X. Xie, "Improving read mapping using additional prefix grams," BMC Bioinformatics, 15(1):42, 2014. https://doi.org/10.1186/1471-2105-15-42