{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:09:44Z","timestamp":1750306184505,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,5,9]],"date-time":"2017-05-09T00:00:00Z","timestamp":1494288000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["IIS-1247469","AITF-1535565"],"award-info":[{"award-number":["IIS-1247469","AITF-1535565"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,5,9]]},"DOI":"10.1145\/3034786.3056449","type":"proceedings-article","created":{"date-parts":[[2017,5,10]],"date-time":"2017-05-10T18:09:00Z","timestamp":1494439740000},"page":"319-319","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Communication Cost in Parallel Query Evaluation"],"prefix":"10.1145","author":[{"given":"Dan","family":"Suciu","sequence":"first","affiliation":[{"name":"University of Washington, Seattle, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,5,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"GYM: A multiround join algorithm in mapreduce. CoRR, abs\/1410.4156","author":"Afrati F. N.","year":"2014","unstructured":"F. N. Afrati , M. Joglekar , C. R\u00e9 , S. Salihoglu , and J. D. Ullman . GYM: A multiround join algorithm in mapreduce. CoRR, abs\/1410.4156 , 2014 . F. N. Afrati, M. Joglekar, C. R\u00e9, S. Salihoglu, and J. D. Ullman. GYM: A multiround join algorithm in mapreduce. CoRR, abs\/1410.4156, 2014."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535570.2488334"},{"key":"e_1_3_2_1_3_1","volume-title":"Sharesskew: An algorithm to handle skew for joins in mapreduce. CoRR, abs\/1512.03921","author":"Afrati F. N.","year":"2015","unstructured":"F. N. Afrati , N. Stasinopoulos , J. D. Ullman , and A. Vasilakopoulos . Sharesskew: An algorithm to handle skew for joins in mapreduce. CoRR, abs\/1512.03921 , 2015 . F. N. Afrati, N. Stasinopoulos, J. D. Ullman, and A. Vasilakopoulos. Sharesskew: An algorithm to handle skew for joins in mapreduce. CoRR, abs\/1512.03921, 2015."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739056"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/110859440"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2465224"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594538.2594558"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3034788"},{"key":"e_1_3_2_1_9_1","first-page":"1","volume-title":"19th International Conference on Database Theory, ICDT 2016","author":"Koutris P.","year":"2016","unstructured":"P. Koutris , P. Beame , and D. Suciu . Worst-case optimal algorithms for parallel query processing . In 19th International Conference on Database Theory, ICDT 2016 , Bordeaux, France, March 15--18 , 2016 , pages 8: 1 -- 8 :18, 2016. P. Koutris, P. Beame, and D. Suciu. Worst-case optimal algorithms for parallel query processing. In 19th International Conference on Database Theory, ICDT 2016, Bordeaux, France, March 15--18, 2016, pages 8:1--8:18, 2016."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"}],"event":{"name":"SIGMOD\/PODS'17: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Chicago Illinois USA","acronym":"SIGMOD\/PODS'17"},"container-title":["Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3034786.3056449","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3034786.3056449","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3034786.3056449","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:50:05Z","timestamp":1750218605000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3034786.3056449"}},"subtitle":["A Tutorial"],"short-title":[],"issued":{"date-parts":[[2017,5,9]]},"references-count":10,"alternative-id":["10.1145\/3034786.3056449","10.1145\/3034786"],"URL":"https:\/\/doi.org\/10.1145\/3034786.3056449","relation":{},"subject":[],"published":{"date-parts":[[2017,5,9]]},"assertion":[{"value":"2017-05-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}