{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:52:33Z","timestamp":1725864753682},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662534540"},{"type":"electronic","value":"9783662534557"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53455-7_1","type":"book-chapter","created":{"date-parts":[[2016,9,9]],"date-time":"2016-09-09T18:21:18Z","timestamp":1473445278000},"page":"1-22","source":"Crossref","is-referenced-by-count":2,"title":["Accelerating Set Similarity Joins Using GPUs"],"prefix":"10.1007","author":[{"given":"Mateus S. H.","family":"Cruz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yusuke","family":"Kozawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshiyuki","family":"Amagasa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroyuki","family":"Kitagawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,10]]},"reference":[{"key":"1_CR1","first-page":"57","volume":"144","author":"C B\u00f6hm","year":"2009","unstructured":"B\u00f6hm, C., Noll, R., Plant, C., Zherdin, A.: Index-supported similarity join on graphics processors. BTW 144, 57\u201366 (2009)","journal-title":"BTW"},{"issue":"3","key":"1_CR2","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1006\/jcss.1999.1690","volume":"60","author":"AZ Broder","year":"2000","unstructured":"Broder, A.Z., Charikar, M., Frieze, A.M., Mitzenmacher, M.: Min-wise independent permutations. J. Comput. Syst. Sci. 60(3), 630\u2013659 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Ganti, V., Kaushik, R.: A primitive operator for similarity joins in data cleaning. In: Proceedings of ICDE, p. 5 (2006)","DOI":"10.1109\/ICDE.2006.9"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Deng, D., Li, G., Hao, S., Wang, J., Feng, J.: Massjoin: a MapReduce-based method for scalable string similarity joins. In: Proceedings of ICDE, pp. 340\u2013351 (2014)","DOI":"10.1109\/ICDE.2014.6816663"},{"key":"1_CR5","unstructured":"Gravano, L., Ipeirotis, P.G., Jagadish, H.V., Koudas, N., Muthukrishnan, S., Srivastava, D.: Approximate string joins in a database (almost) for free. In: Proceedings of VLDB, pp. 491\u2013500 (2001)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Greathouse, J.L., Daga, M.: Efficient sparse matrix-vector multiplication on GPUs using the CSR storage format. In: Proceedings of SC, pp. 769\u2013780 (2014)","DOI":"10.1109\/SC.2014.68"},{"issue":"4","key":"1_CR7","first-page":"21:1","volume":"34","author":"B He","year":"2009","unstructured":"He, B., Lu, M., Yang, K., Fang, R., Govindaraju, N.K., Luo, Q., Sander, P.V.: Relational query coprocessing on graphics processors. TODS 34(4), 21:1\u201321:39 (2009)","journal-title":"TODS"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"He, B., Yang, K., Fang, R., Lu, M., Govindaraju, N., Luo, Q., Sander, P.: Relational joins on graphics processors. In: Proceedings of SIGMOD, pp. 511\u2013524 (2008)","DOI":"10.1145\/1376616.1376670"},{"key":"1_CR9","volume-title":"Thrust: A Productivity-Oriented Library for CUDA","author":"J Hoberock","year":"2012","unstructured":"Hoberock, J., Bell, N.: Thrust: A Productivity-Oriented Library for CUDA. Morgan Kaufmann Publishers, San Francisco (2012)"},{"key":"1_CR10","unstructured":"Appleby, A.: MurmurHash3 (2016)"},{"issue":"8","key":"1_CR11","first-page":"625","volume":"7","author":"Y Jiang","year":"2014","unstructured":"Jiang, Y., Li, G., Feng, J., Li, W.S.: String similarity joins: an experimental evaluation. PVLDB 7(8), 625\u2013636 (2014)","journal-title":"PVLDB"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Li, P., Knig, A.C.: b-bit minwise hashing. CoRR abs\/0910.3349 (2009)","DOI":"10.1145\/1772690.1772759"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Li, P., Shrivastava, A., K\u00f6nig, A.C.: GPU-based minwise hashing. In: Proceedings of WWW, pp. 565\u2013566 (2012)","DOI":"10.1145\/2187980.2188129"},{"key":"1_CR14","unstructured":"Li, P., Owen, A.B., Zhang, C.H.: One permutation hashing for efficient search and learning. CoRR abs\/1208.1259 (2012)"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Lieberman, M.D., Sankaranarayanan, J., Samet, H.: A fast similarity join algorithm using graphics processing units. In: Proceedings of ICDE, pp. 1111\u20131120 (2008)","DOI":"10.1109\/ICDE.2008.4497520"},{"issue":"8","key":"1_CR16","first-page":"704","volume":"5","author":"A Metwally","year":"2012","unstructured":"Metwally, A., Faloutsos, C.: V-Smart-Join: a scalable MapReduce framework for all-pair similarity joins of multisets and vectors. PVLDB 5(8), 704\u2013715 (2012)","journal-title":"PVLDB"},{"key":"1_CR17","unstructured":"NVIDIA Corporation: NVIDIA CUDA Compute Unified Device Architecture Programming Guide (2007)"},{"key":"1_CR18","unstructured":"OpenMP Architecture Review Board: OpenMP Application Program Interface Version 4.0 (2013)"},{"issue":"1","key":"1_CR19","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1111\/j.1467-8659.2007.01012.x","volume":"26","author":"JD Owens","year":"2007","unstructured":"Owens, J.D., Luebke, D., Govindaraju, N., Harris, M., Krger, J., Lefohn, A., Purcell, T.J.: A survey of general-purpose computation on graphics hardware. Comput. Graph. Forum 26(1), 80\u2013113 (2007)","journal-title":"Comput. Graph. Forum"},{"key":"1_CR20","unstructured":"Rares, V., Carey, M.J., Chen, L.: Efficient parallel set-similarity joins using MapReduce. In: Proceedings of SIGMOD, pp. 495\u2013506 (2010)"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Sarawagi, S., Kirpal, A.: Efficient set joins on similarity predicates. In: Proceedings of SIGMOD, pp. 743\u2013754 (2004)","DOI":"10.1145\/1007568.1007652"},{"key":"1_CR22","unstructured":"Sengupta, S., Harris, M., Zhang, Y., Owens, J.D.: Scan primitives for GPU computing. In: Proceedings of GH, pp. 97\u2013106 (2007)"},{"key":"1_CR23","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: Proceedings of SIGMOD, pp. 85\u201396 (2012)","DOI":"10.1145\/2213836.2213847"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W., Lin, X., Yu, J.X.: Efficient similarity joins for near duplicate detection. In: Proceedings of WWW, pp. 131\u2013140 (2008)","DOI":"10.1145\/1367497.1367516"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1007\/978-3-319-22849-5_26","volume-title":"Database and Expert Systems Applications","author":"MSH Cruz","year":"2015","unstructured":"Cruz, M.S.H., Kozawa, Y., Amagasa, T., Kitagawa, H.: GPU acceleration of set similarity joins. In: Chen, Q., Hameurlain, A., Toumani, F., Wagner, R., Decker, H. (eds.) DEXA 2015. LNCS, vol. 9261, pp. 384\u2013398. Springer, Heidelberg (2015)"},{"key":"1_CR26","unstructured":"Harris, M.: Parallel prefix sum (Scan) with CUDA (2009)"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Dotsenko, Y., Govindaraju, N.K., Sloan, P., Boyd, C., Manferdelli, J.: Fast scan algorithms on graphics processors. In: Proceedings of ICS, pp. 205\u2013213 (2008)","DOI":"10.1145\/1375527.1375559"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Yan, S., Long, G., Zhang, Y.: StreamScan: fast scan algorithms for GPUs without global barrier synchronization. In: Proceedings of PPoPP, pp. 229\u2013238 (2013)","DOI":"10.1145\/2442516.2442539"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Han, S., Jang, K., Park, K., Moon, S.: PacketShader: a GPU-accelerated software router. In: Proceedings of SIGCOMM, pp. 195\u2013206 (2010)","DOI":"10.1145\/1851182.1851207"},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1007\/978-3-642-21916-0_12","volume-title":"Foundations of Intelligent Systems","author":"A Gainaru","year":"2011","unstructured":"Gainaru, A., Slusanschi, E., Trausan-Matu, S.: Mapping data mining algorithms on a GPU architecture: a study. In: Kryszkiewicz, M., Rybinski, H., Skowron, A., Ra\u015b, Z.W. (eds.) ISMIS 2011. LNCS, vol. 6804, pp. 102\u2013112. Springer, Heidelberg (2011)"},{"key":"1_CR31","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. PVLDB 5, 253\u2013264 (2011)","journal-title":"PVLDB"},{"key":"1_CR32","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. PVLDB 1, 933\u2013944 (2008)","journal-title":"PVLDB"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Bayardo, R., Ma, Y., Srikant, R.: Scaling up all pairs similarity search. In: Proceedings of WWW, pp. 131\u2013140 (2007)","DOI":"10.1145\/1242572.1242591"},{"key":"1_CR34","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.is.2010.07.003","volume":"36","author":"L Ribeiro","year":"2011","unstructured":"Ribeiro, L., H\u00e4rder, T.: Generalizing prefix filtering to improve set similarity joins. Inf. Syst. 36, 62\u201378 (2011)","journal-title":"Inf. Syst."},{"key":"1_CR35","first-page":"1916","volume":"25","author":"W Wang","year":"2013","unstructured":"Wang, W., Qin, J., Chuan, X., Lin, X., Shen, H.: VChunkJoin: an efficient algorithm for edit similarity joins. TKDE 25, 1916\u20131929 (2013)","journal-title":"TKDE"}],"container-title":["Lecture Notes in Computer Science","Transactions on Large-Scale Data- and Knowledge-Centered Systems XXVIII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53455-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,20]],"date-time":"2023-08-20T01:46:36Z","timestamp":1692495996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53455-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662534540","9783662534557"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53455-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}