{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:53:19Z","timestamp":1755838399057},"reference-count":21,"publisher":"International Academy Publishing (IAP)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JSW"],"DOI":"10.4304\/jsw.9.10.2721-2731","type":"journal-article","created":{"date-parts":[[2014,11,3]],"date-time":"2014-11-03T16:00:48Z","timestamp":1415030448000},"source":"Crossref","is-referenced-by-count":3,"title":["Approximate String Similarity Join using Hashing Techniques under Edit Distance Constraints"],"prefix":"10.17706","volume":"9","author":[{"given":"Peisen","family":"Yuan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haoyun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianghua","family":"Che","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shougang","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huanliang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dechang","family":"Pi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7163","published-online":{"date-parts":[[2014,10,1]]},"reference":[{"key":"ref1","first-page":"217","volume-title":"\"Hashed-join","author":"Yuan","year":"2014","unstructured":"[1] P. Yuan, C. Sha, and S. Yi, \"Hashed-join: Approximate string similarity join with hashing,\" in Database Systems for Advanced Applications. Springer, 2014, pp. 217\u2013229."},{"issue":"no. 2","key":"ref2","first-page":"60","article-title":"Data debugger:An operator-centric approach for data quality solutions","volume":"29","author":"Chaudhuri","year":"2006","unstructured":"[7] S. Chaudhuri, V. Ganti, and R. Kaushik, \"Data debugger:An operator-centric approach for data quality solutions,\"IEEE Data Eng. Bull, vol. 29, no. 2, pp. 60\u201366, 2006.","journal-title":"IEEE Data Eng Bull"},{"issue":"no. 1","key":"ref3","first-page":"933","article-title":"Trie-Join:Efficient Trie-based String Similarity Joins with Edit Distance Constraints","volume":"1","author":"Wang","year":"2010","unstructured":"[8] J. Wang, J. Feng, and G. Li, \"Trie-Join:Efficient Trie-based String Similarity Joins with Edit Distance Constraints,\"VLDB, vol. 1, no. 1, pp. 933\u2013944, 2010.","journal-title":"VLDB"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/321796.321811"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90002-1"},{"key":"ref6","first-page":"DE\u201337","volume-title":"\"Prejoin","author":"Gouda","year":"2012","unstructured":"[12] K. Gouda and M. Rashad, \"Prejoin: An efficient trie-based string similarity join algorithm,\" in INFOS. IEEE, 2012,pp. DE\u201337."},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF00545229"},{"issue":"no. 8","key":"ref8","first-page":"707","article-title":"Binary codes capable of correcting deletions,insertions, and reversals","volume":"10","author":"Levenshtein","year":"1966","unstructured":"[16] V. Levenshtein, \"Binary codes capable of correcting deletions,insertions, and reversals,\" in Soviet Physics Doklady,vol. 10, no. 8, 1966, pp. 707\u2013710.","journal-title":"Sov Phys Dokl","ISSN":"http:\/\/id.crossref.org\/issn\/0038-5689","issn-type":"print"},{"key":"ref9","first-page":"74","volume-title":"Gapped local similarity search with provable guarantees","author":"Narayanan","year":"2004","unstructured":"[20] M. Narayanan and R. Karp, \"Gapped local similarity search with provable guarantees,\" Algorithms in Bioinformatics,pp. 74\u201386, 2004."},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1690"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref12","first-page":"169","volume-title":"XML Structural Similarity Search Using MapReduce","author":"Yuan","year":"2010","unstructured":"[23] P. Yuan, C. Sha, X. Wang, B. Yang, A. Zhou, and S. Yang,\"XML Structural Similarity Search Using MapReduce,\"WAIM, pp. 169\u2013181, 2010."},{"key":"ref13","volume-title":"Modern information retrieval","author":"Baeza-Yates","year":"1999","unstructured":"[25] R. Baeza-Yates and B. Ribeiro-Neto, Modern information retrieval. Addison Wesley, 1999."},{"issue":"no. 1","key":"ref14","first-page":"933","article-title":"Ed-Join: an efficient algorithm for similarity joins with edit distance constraints","volume":"1","author":"Xiao","year":"2008","unstructured":"[27] C. Xiao, W. Wang, and X. Lin, \"Ed-Join: an efficient algorithm for similarity joins with edit distance constraints,\"VLDB, vol. 1, no. 1, pp. 933\u2013944, 2008.","journal-title":"VLDB"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.4304\/jcp.8.7.1804-1809"},{"key":"ref16","first-page":"925","volume-title":"Top-k string similarity search with edit-distance constraints","author":"Deng","year":"2013","unstructured":"[32] D. Deng, G. Li, J. Feng, and W.-S. Li, \"Top-k string similarity search with edit-distance constraints.\" ICDE, 2013, pp. 925\u2013936."},{"key":"ref17","first-page":"373","volume-title":"String similarity measures and joins with synonyms","author":"Lu","year":"2013","unstructured":"[33] J. Lu, C. Lin, W. Wang, C. Li, and H. Wang, \"String similarity measures and joins with synonyms,\" SIGMOD,pp. 373\u2013384, 2013."},{"key":"ref18","first-page":"816","volume-title":"\"Spatio-temporal joins on symbolic indoor tracking data \" in ICDE","author":"Lu","year":"2011","unstructured":"[35] H. Lu, B. Yang, and C. S. Jensen, \"Spatio-temporal joins on symbolic indoor tracking data,\" in ICDE. IEEE, 2011,pp. 816\u2013827."},{"key":"ref19","first-page":"495","volume-title":"\"Efficient parallel setsimilarity joins using mapreduce \" in SIGMOD","author":"Vernica","year":"2010","unstructured":"[37] R. Vernica, M. J. Carey, and C. Li, \"Efficient parallel setsimilarity joins using mapreduce,\" in SIGMOD. ACM,2010, pp. 495\u2013506."},{"key":"ref20","volume-title":"\"Massjoin","author":"Deng","year":"2014","unstructured":"[38] D. Deng, G. Li, S. Hao, J. Wang, J. Feng, and W.-S. Li,\"Massjoin: A mapreduce-based method for scalable string similarity joins,\" in ICDE. IEEE, 2014."},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212353"}],"container-title":["Journal of Software"],"original-title":[],"deposited":{"date-parts":[[2015,9,15]],"date-time":"2015-09-15T11:26:29Z","timestamp":1442316389000},"score":1,"resource":{"primary":{"URL":"http:\/\/ojs.academypublisher.com\/index.php\/jsw\/article\/view\/13130"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,1]]},"references-count":21,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2014,10,1]]}},"URL":"https:\/\/doi.org\/10.4304\/jsw.9.10.2721-2731","relation":{},"ISSN":["1796-217X"],"issn-type":[{"value":"1796-217X","type":"print"}],"subject":[],"published":{"date-parts":[[2014,10,1]]}}}