{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:54:27Z","timestamp":1773482067564,"version":"3.50.1"},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2017,5,11]],"date-time":"2017-05-11T00:00:00Z","timestamp":1494460800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMOD Rec."],"published-print":{"date-parts":[[2017,5,11]]},"DOI":"10.1145\/3092931.3092934","type":"journal-article","created":{"date-parts":[[2017,5,12]],"date-time":"2017-05-12T12:16:12Z","timestamp":1494591372000},"page":"18-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["A Guide to Formal Analysis of Join Processing in Massively Parallel Systems"],"prefix":"10.1145","volume":"45","author":[{"given":"Paraschos","family":"Koutris","sequence":"first","affiliation":[{"name":"University of Wisconsin-Madison"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Suciu","sequence":"additional","affiliation":[{"name":"University of Washington"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,5,11]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535570.2488334"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739056"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.43"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2465224"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594538.2594558"},{"key":"e_1_2_1_6_1","volume-title":"Communication cost in parallel query processing. CoRR, abs\/1602.06236","author":"Beame P.","year":"2016","unstructured":"P. Beame , P. Koutris , and D. Suciu . Communication cost in parallel query processing. CoRR, abs\/1602.06236 , 2016 . P. Beame, P. Koutris, and D. Suciu. Communication cost in parallel query processing. CoRR, abs\/1602.06236, 2016."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454166"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2750545"},{"key":"e_1_2_1_9_1","first-page":"137","volume-title":"OSDI","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . Mapreduce: Simplified data processing on large clusters . In OSDI , pages 137 -- 150 , 2004 . J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. In OSDI, pages 137--150, 2004."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.50905"},{"key":"e_1_2_1_11_1","first-page":"710","volume-title":"SODA","author":"Feldman J.","year":"2008","unstructured":"J. Feldman , S. Muthukrishnan , A. Sidiropoulos , C. Stein , and Z. Svitkina . On distributing symmetric streaming computations . In SODA , pages 710 -- 719 , 2008 . J. Feldman, S. Muthukrishnan, A. Sidiropoulos, C. Stein, and Z. Svitkina. On distributing symmetric streaming computations. In SODA, pages 710--719, 2008."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/2904483.2904487"},{"key":"e_1_2_1_13_1","unstructured":"Hadoop. http:\/\/hadoop.apache.org\/.  Hadoop. http:\/\/hadoop.apache.org\/."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2594530"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873677"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3034788"},{"key":"e_1_2_1_17_1","first-page":"1","volume-title":"ICDT","author":"Koutris P.","year":"2016","unstructured":"P. Koutris , P. Beame , and D. Suciu . Worst-case optimal algorithms for parallel query processing . In ICDT , pages 8: 1 -- 8 :18, 2016 . P. Koutris, P. Beame, and D. Suciu. Worst-case optimal algorithms for parallel query processing. In ICDT, pages 8:1--8:18, 2016."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989284.1989310"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920886"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1076315"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376726"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2010.5496972"},{"key":"e_1_2_1_23_1","unstructured":"Apache spark. http:\/\/spark.apache.org\/.  Apache spark. http:\/\/spark.apache.org\/."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687609"},{"key":"e_1_2_1_25_1","first-page":"4","article-title":"The case for shared nothing","volume":"9","author":"M. S. University and M. Stonebraker","year":"1986","unstructured":"M. S. University and M. Stonebraker . The case for shared nothing . Database Engineering , 9 : 4 -- 9 , 1986 . M. S. University and M. Stonebraker. The case for shared nothing. Database Engineering, 9:4--9, 1986.","journal-title":"Database Engineering"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_2_1_27_1","volume-title":"The Myria big data management and analytics system and cloud services","author":"Wang J.","year":"2017","unstructured":"J. Wang , T. Baker , M. Balazinska , D. Halperin , B. Hayes , B. Howe , D. Hutchinson , S. Jain , R. Maas , P. Mehta , D. Moritz , B. Myers , J. Ortiz , D. Suciu , A. Whittaker , and S. Xu . The Myria big data management and analytics system and cloud services , 2017 . To appear in CIDR. J. Wang, T. Baker, M. Balazinska, D. Halperin, B. Hayes, B. Howe, D. Hutchinson, S. Jain, R. Maas, P. Mehta, D. Moritz, B. Myers, J. Ortiz, D. Suciu, A. Whittaker, and S. Xu. The Myria big data management and analytics system and cloud services, 2017. To appear in CIDR."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465288"},{"key":"e_1_2_1_29_1","volume-title":"HotCloud","author":"Zaharia M.","year":"2010","unstructured":"M. Zaharia , M. Chowdhury , M. J. Franklin , S. Shenker , and I. Stoica . Spark: Cluster computing with working sets . In HotCloud , 2010 . M. Zaharia, M. Chowdhury, M. J. Franklin, S. Shenker, and I. Stoica. Spark: Cluster computing with working sets. In HotCloud, 2010."}],"container-title":["ACM SIGMOD Record"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3092931.3092934","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3092931.3092934","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:39Z","timestamp":1750217439000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3092931.3092934"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,11]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,5,11]]}},"alternative-id":["10.1145\/3092931.3092934"],"URL":"https:\/\/doi.org\/10.1145\/3092931.3092934","relation":{},"ISSN":["0163-5808"],"issn-type":[{"value":"0163-5808","type":"print"}],"subject":[],"published":{"date-parts":[[2017,5,11]]},"assertion":[{"value":"2017-05-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}