{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:50:48Z","timestamp":1740099048071,"version":"3.37.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319920122"},{"type":"electronic","value":"9783319920139"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-92013-9_27","type":"book-chapter","created":{"date-parts":[[2018,5,17]],"date-time":"2018-05-17T08:57:09Z","timestamp":1526547429000},"page":"322-327","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallelizing String Similarity Join Algorithms"],"prefix":"10.1007","author":[{"given":"Ling-Chih","family":"Yao","sequence":"first","affiliation":[]},{"given":"Lipyeow","family":"Lim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,18]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J., Ma, Y., Srikant, R.: Scaling up all pairs similarity search. In: WWW, pp. 131\u2013140. ACM (2007)","DOI":"10.1145\/1242572.1242591"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Blanas, S., Patel, J.M., Ercegovac, V., Rao, J., Shekita, E.J., Tian, Y.: A comparison of join algorithms for log processing in MapReduce. In: SIGMOD, pp. 975\u2013986. ACM (2010)","DOI":"10.1145\/1807167.1807273"},{"key":"27_CR3","unstructured":"Bocek, T., Hunt, E., Stiller, B., Hecht, F.: Fast similarity search in large dictionaries. University of Zurich (2007)"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Ganti, V., Kaushik, R.: A primitive operator for similarity joins in data cleaning. In: ICDE, p. 5. IEEE (2006)","DOI":"10.1109\/ICDE.2006.9"},{"key":"27_CR5","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: an efficient access method for similarity search in metric spaces. In: VLDB, vol. 23, pp. 426\u2013435 (1997)"},{"issue":"4","key":"27_CR6","first-page":"360","volume":"9","author":"D Deng","year":"2015","unstructured":"Deng, D., Li, G., Wen, H., Feng, J.: An efficient partition based method for exact set similarity joins. VLDB 9(4), 360\u2013371 (2015)","journal-title":"VLDB"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-30218-6_19","volume-title":"Recent Advances in Parallel Virtual Machine and Message Passing Interface","author":"E Gabriel","year":"2004","unstructured":"Gabriel, E., et al.: Open MPI: goals, concept, and design of a next generation MPI implementation. In: Kranzlm\u00fcller, D., Kacsuk, P., Dongarra, J. (eds.) EuroPVM\/MPI 2004. LNCS, vol. 3241, pp. 97\u2013104. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30218-6_19"},{"key":"27_CR8","unstructured":"Gravano, L., Ipeirotis, P.G., Jagadish, H.V., Koudas, N., Muthukrishnan, S., Srivastava, D., et al.: Approximate string joins in a database (almost) for free. In: VLDB, vol. 1, pp. 491\u2013500 (2001)"},{"issue":"3","key":"27_CR9","first-page":"253","volume":"5","author":"G Li","year":"2011","unstructured":"Li, G., Deng, D., Wang, J., Feng, J.: Pass-join: a partition-based method for similarity joins. VLDB 5(3), 253\u2013264 (2011)","journal-title":"VLDB"},{"issue":"5","key":"27_CR10","first-page":"430","volume":"5","author":"V Satuluri","year":"2012","unstructured":"Satuluri, V., Parthasarathy, S.: Bayesian locality sensitive hashing for fast similarity search. VLDB 5(5), 430\u2013441 (2012)","journal-title":"VLDB"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.scico.2017.04.006","volume":"145","author":"MK Sohrabi","year":"2017","unstructured":"Sohrabi, M.K., Azgomi, H.: Parallel set similarity join on big data based on locality-sensitive hashing. Sci. Comput. Program. 145, 1\u201312 (2017)","journal-title":"Sci. Comput. Program."},{"issue":"12","key":"27_CR12","first-page":"1925","volume":"10","author":"J Sun","year":"2017","unstructured":"Sun, J., Shang, Z., Li, G., Deng, D., Bao, Z.: Dima: a distributed in-memory similarity-based query processing system. VLDB 10(12), 1925\u20131928 (2017)","journal-title":"VLDB"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Vernica, R., Carey, M.J., Li, C.: Efficient parallel set-similarity joins using MapReduce. In: SIGMOD, pp. 495\u2013506. ACM (2010)","DOI":"10.1145\/1807167.1807222"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Wang, J., Li, G., Feng, J.: Can we beat the prefix filtering? An adaptive framework for similarity join and search. In: SIGMOD, pp. 85\u201396. ACM (2012)","DOI":"10.1145\/2213836.2213847"},{"issue":"1","key":"27_CR15","first-page":"933","volume":"1","author":"C Xiao","year":"2008","unstructured":"Xiao, C., Wang, W., Lin, X.: Ed-Join: an efficient algorithm for similarity joins with edit distance constraints. VLDB 1(1), 933\u2013944 (2008)","journal-title":"VLDB"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W., Lin, X., Yu, J.X.: Efficient similarity joins for near duplicate detection. In: WWW, pp. 131\u2013140. ACM (2008)","DOI":"10.1145\/1367497.1367516"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-92013-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,18]],"date-time":"2019-10-18T00:52:06Z","timestamp":1571359926000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-92013-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319920122","9783319920139"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92013-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}