{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T17:01:47Z","timestamp":1725814907714},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662462478"},{"type":"electronic","value":"9783662462485"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46248-5_10","type":"book-chapter","created":{"date-parts":[[2014,12,29]],"date-time":"2014-12-29T14:38:10Z","timestamp":1419863890000},"page":"73-80","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Processing of Multi-way Joins Using MapReduce"],"prefix":"10.1007","author":[{"given":"Linlin","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siping","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aili","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baoyan","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J. Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM (CACM)\u00a051(1), 107\u2013113 (2008)","journal-title":"Commun. ACM (CACM)"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Okcan, A., Riedewald, M.: Processing theta-joins using MapReduce. In: SIGMOD, pp. 949\u2013960 (2011)","DOI":"10.1145\/1989323.1989423"},{"issue":"9","key":"10_CR3","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1109\/TKDE.2011.47","volume":"23","author":"F.N. Afrati","year":"2011","unstructured":"Afrati, F.N., Ullman, J.D.: Optimizing Multiway Joins in a Map-Reduce Environment. IEEE Trans. Knowl. Data Eng (TKDE)\u00a023(9), 1282\u20131298 (2011)","journal-title":"IEEE Trans. Knowl. Data Eng. (TKDE)"},{"issue":"11","key":"10_CR4","first-page":"1184","volume":"5","author":"X. Zhang","year":"2012","unstructured":"Zhang, X., Chen, L., Wang, M.: Efficient Multi-way Theta-Join Processing Using MapReduce. PVLDB\u00a05(11), 1184\u20131195 (2012)","journal-title":"PVLDB"},{"issue":"11","key":"10_CR5","first-page":"1135","volume":"4","author":"N. Pansare","year":"2011","unstructured":"Pansare, N., Borkar, V.R., Jermaine, C., Condie, T.: Online Aggregation for Large MapReduce Jobs. PVLDB\u00a04(11), 1135\u20131145 (2011)","journal-title":"PVLDB"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Okcan, A., Riedewald, M.: Processing theta-joins using MapReduce. In: SIGMOD, pp. 949\u2013960 (2011)","DOI":"10.1145\/1989323.1989423"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Afrati, F.N., Ullman, J.D.: Optimizing joins in a map-reduce environment. In: EDBT, pp. 99\u2013110 (2010)","DOI":"10.1145\/1739041.1739056"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Vernica, R., Carey, M.J., Li, C.: Efficient parallel set-similarity joins using MapReduce. In: SIGMOD, pp. 495\u2013506 (2010)","DOI":"10.1145\/1807167.1807222"},{"issue":"9","key":"10_CR9","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1109\/TKDE.2010.248","volume":"23","author":"D. Jiang","year":"2011","unstructured":"Jiang, D., Tung, A.K.H., Chen, G.: MAP-JOIN-REDUCE: Toward Scalable and Efficient Data Analysis on Large Clusters. IEEE Trans. Knowl. Data Eng (TKDE)\u00a023(9), 1299\u20131311 (2011)","journal-title":"IEEE Trans. Knowl. Data Eng. (TKDE)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Fries, S., Boden, B., et al.: PHiDJ: Parallel similarity self-join for high-dimensional vector data with MapReduce. In: ICDE, pp. 796\u2013807 (2014)","DOI":"10.1109\/ICDE.2014.6816701"},{"issue":"3","key":"10_CR11","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10619-013-7137-3","volume":"32","author":"Y. Ma","year":"2014","unstructured":"Ma, Y., Meng, X.: Set similarity join on massive probabilistic data using MapReduce. Distributed and Parallel Databases (DPD)\u00a032(3), 447\u2013464 (2014)","journal-title":"Distributed and Parallel Databases (DPD)"},{"issue":"2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1007\/s11227-014-1179-9","volume":"69","author":"T. Lee","year":"2014","unstructured":"Lee, T., Bae, H.-C., et al.: Join processing with threshold-based filtering in MapReduce. The Journal of Supercomputing (TJS)\u00a069(2), 793\u2013813 (2014)","journal-title":"The Journal of Supercomputing (TJS)"}],"container-title":["Communications in Computer and Information Science","Intelligent Computation in Big Data Era"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46248-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T02:25:16Z","timestamp":1559096716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46248-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662462478","9783662462485"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46248-5_10","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2015]]}}}