{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T03:48:31Z","timestamp":1777175311374,"version":"3.51.4"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2017,10,14]],"date-time":"2017-10-14T00:00:00Z","timestamp":1507939200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100001395","name":"Wisconsin Alumni Research Foundation","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100001395","id-type":"DOI","asserted-by":"crossref"}]},{"name":"NSF IIS","award":["1247469"],"award-info":[{"award-number":["1247469"]}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1524246 and CCF-1217099"],"award-info":[{"award-number":["CCF-1524246 and CCF-1217099"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSF AITF","award":["1535565"],"award-info":[{"award-number":["1535565"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[2017,12,31]]},"abstract":"<jats:p>We study the problem of computing conjunctive queries over large databases on parallel architectures without shared storage. Using the structure of such a query<jats:italic>q<\/jats:italic>and the skew in the data, we study tradeoffs between the number of processors, the number of rounds of communication, and the per-processor<jats:italic>load<\/jats:italic>\u2014the number of bits each processor can send or can receive in a single round\u2014that are required to compute<jats:italic>q<\/jats:italic>. Since each processor must store its received bits, the load is at most the number of bits of storage per processor.<\/jats:p><jats:p>When the data are free of skew, we obtain essentially tight upper and lower bounds for one round algorithms, and we show how the bounds degrade when there is skew in the data. In the case of skewed data, we show how to improve the algorithms when approximate degrees of the (necessarily small number of) heavy-hitter elements are available, obtaining essentially optimal algorithms for queries such as skewed simple joins and skewed triangle join queries.<\/jats:p><jats:p>For queries that we identify as<jats:italic>treelike<\/jats:italic>, we also prove nearly matching upper and lower bounds for multi-round algorithms for a natural class of skew-free databases. One consequence of these latter lower bounds is that for any \u03b5 &gt; 0, using<jats:italic>p<\/jats:italic>processors to compute the connected components of a graph, or to output the path, if any, between a specified pair of vertices of a graph with<jats:italic>m<\/jats:italic>edges and per-processor load that is<jats:italic>O<\/jats:italic>(<jats:italic>m<\/jats:italic>\/<jats:italic>p<\/jats:italic><jats:sup>1\u2212\u03b5<\/jats:sup>) requires \u03a9(log<jats:italic>p<\/jats:italic>) rounds of communication.<\/jats:p><jats:p>Our upper bounds are given by simple structured algorithms using MapReduce. Our one-round lower bounds are proved in a very general model, which we call the<jats:italic>Massively Parallel Communication (MPC)<\/jats:italic>model, that allows processors to communicate arbitrary bits. Our multi-round lower bounds apply in a restricted version of the MPC model in which processors in subsequent rounds after the first communication round are only allowed to send tuples.<\/jats:p>","DOI":"10.1145\/3125644","type":"journal-article","created":{"date-parts":[[2017,10,16]],"date-time":"2017-10-16T12:37:42Z","timestamp":1508157462000},"page":"1-58","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":80,"title":["Communication Steps for Parallel Query Processing"],"prefix":"10.1145","volume":"64","author":[{"given":"Paul","family":"Beame","sequence":"first","affiliation":[{"name":"University of Washington"}]},{"given":"Paraschos","family":"Koutris","sequence":"additional","affiliation":[{"name":"University of Washington"}]},{"given":"Dan","family":"Suciu","sequence":"additional","affiliation":[{"name":"University of Washington"}]}],"member":"320","published-online":{"date-parts":[[2017,10,14]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the 20th International Conference on Database Theory (ICDT\u201917)","author":"Afrati Foto N.","year":"2017","unstructured":"Foto N. Afrati , Manas R. Joglekar , Christopher R\u00e9 , Semih Salihoglu , and Jeffrey D. Ullman . 2017. GYM: A multiround distributed join algorithm . In Proceedings of the 20th International Conference on Database Theory (ICDT\u201917) . 4:1--4:18. DOI:http:\/\/dx.doi.org\/10.4230\/LIPIcs.ICDT. 2017 .4 10.4230\/LIPIcs.ICDT.2017.4 Foto N. Afrati, Manas R. Joglekar, Christopher R\u00e9, Semih Salihoglu, and Jeffrey D. Ullman. 2017. GYM: A multiround distributed join algorithm. In Proceedings of the 20th International Conference on Database Theory (ICDT\u201917). 4:1--4:18. DOI:http:\/\/dx.doi.org\/10.4230\/LIPIcs.ICDT.2017.4"},{"key":"e_1_2_1_2_1","unstructured":"F. N. Afrati A. D. Sarma S. Salihoglu and J. D. Ullman. 2012. Upper and lower bounds on the cost of a map-reduce computation. CoRR abs\/1206.4377 (2012). F. N. Afrati A. D. Sarma S. Salihoglu and J. D. Ullman. 2012. Upper and lower bounds on the cost of a map-reduce computation. CoRR abs\/1206.4377 (2012)."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739056"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.43"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2465224"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594538.2594558"},{"key":"e_1_2_1_8_1","volume-title":"Hypergraph acyclicity revisited. ACM Comput. Surv. 49, 3","author":"Brault-Baron Johann","year":"2016","unstructured":"Johann Brault-Baron . 2016. Hypergraph acyclicity revisited. ACM Comput. Surv. 49, 3 ( 2016 ), 54:1--54:26. http:\/\/doi.acm.org\/10.1145\/2983573 Johann Brault-Baron. 2016. Hypergraph acyclicity revisited. ACM Comput. Surv. 49, 3 (2016), 54:1--54:26. http:\/\/doi.acm.org\/10.1145\/2983573"},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","unstructured":"S. Chaudhuri. 2012. What next?: A half-dozen data management research goals for big data and the cloud. In PODS. 1--4. S. Chaudhuri. 2012. What next?: A half-dozen data management research goals for big data and the cloud. In PODS. 1--4.","DOI":"10.1145\/2213556.2213558"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2750545"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/240455.240477"},{"key":"e_1_2_1_12_1","unstructured":"J. Dean and S. Ghemawat. 2004. MapReduce: Simplified data processing on large clusters. In OSDI. 137--150. J. Dean and S. Ghemawat. 2004. MapReduce: Simplified data processing on large clusters. In OSDI. 137--150."},{"key":"e_1_2_1_13_1","unstructured":"EMC Corporation. Data Science Revealed: A Data-Driven Glimpse into the Burgeoning New Field. Retrieved from http:\/\/www.emc.com\/collateral\/about\/news\/emc-data-science-study-wp.pdf. EMC Corporation. Data Science Revealed: A Data-Driven Glimpse into the Burgeoning New Field. Retrieved from http:\/\/www.emc.com\/collateral\/about\/news\/emc-data-science-study-wp.pdf."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1824777.1824786"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.2307\/4145187"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"A. G\u00e1l and P. Gopalan. 2007. Lower bounds on streaming algorithms for approximating the length of the longest increasing subsequence. In FOCS. 294--304. A. G\u00e1l and P. Gopalan. 2007. Lower bounds on streaming algorithms for approximating the length of the longest increasing subsequence. In FOCS. 294--304.","DOI":"10.1109\/FOCS.2007.54"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(92)90048-8"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25591-5_39"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568320"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109590"},{"key":"e_1_2_1_21_1","volume-title":"ICALP (LNCS)","author":"Guha Sudipto","unstructured":"Sudipto Guha and Zhiyi Huang . 2009. Revisiting the direct sum theorem and space lower bounds in random order streams . In ICALP (LNCS) , Vol. 5555 . Springer , 513--524. Sudipto Guha and Zhiyi Huang. 2009. Revisiting the direct sum theorem and space lower bounds in random order streams. In ICALP (LNCS), Vol. 5555. Springer, 513--524."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2594530"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15369-3_46"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.76"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3034788"},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the 19th International Conference on Database Theory (ICDT\u201916)","author":"Koutris Paraschos","year":"2016","unstructured":"Paraschos Koutris , Paul Beame , and Dan Suciu . 2016 . Worst-case optimal algorithms for parallel query processing . In Proceedings of the 19th International Conference on Database Theory (ICDT\u201916) . 8:1--8:18. DOI:http:\/\/dx.doi.org\/10.4230\/LIPIcs.ICDT.2016.8 10.4230\/LIPIcs.ICDT.2016.8 Paraschos Koutris, Paul Beame, and Dan Suciu. 2016. Worst-case optimal algorithms for parallel query processing. In Proceedings of the 19th International Conference on Database Theory (ICDT\u201916). 8:1--8:18. DOI:http:\/\/dx.doi.org\/10.4230\/LIPIcs.ICDT.2016.8"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989284.1989310"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60342-3"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213840"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920886"},{"key":"e_1_2_1_31_1","doi-asserted-by":"crossref","unstructured":"H. Q. Ngo E. Porat C. R\u00e9 and A. Rudra. 2012. Worst-case optimal join algorithms: (Extended abstract). In PODS. 37--48. H. Q. Ngo E. Porat C. R\u00e9 and A. Rudra. 2012. Worst-case optimal join algorithms: (Extended abstract). In PODS. 37--48.","DOI":"10.1145\/2213556.2213565"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376726"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2304576.2304607"},{"key":"e_1_2_1_34_1","unstructured":"Spark. Apache Spark. http:\/\/spark.apache.org\/. Spark. Apache Spark. http:\/\/spark.apache.org\/."},{"key":"e_1_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Siddharth Suri and Sergei Vassilvitskii. 2011. Counting triangles and the curse of the last reducer. In WWW. 607--614. Siddharth Suri and Sergei Vassilvitskii. 2011. Counting triangles and the curse of the last reducer. In WWW. 607--614.","DOI":"10.1145\/1963405.1963491"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687609"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/31846.32978"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2331042.2331053"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/3007263.3007307"},{"key":"e_1_2_1_41_1","doi-asserted-by":"crossref","unstructured":"A. C. Yao. 1977. Probabilistic computations: Toward a unified measure of complexity. In FOCS. 222--227. A. C. Yao. 1977. Probabilistic computations: Toward a unified measure of complexity. In FOCS. 222--227.","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3125644","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3125644","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3125644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T14:20:21Z","timestamp":1750947621000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3125644"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,14]]},"references-count":41,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,12,31]]}},"alternative-id":["10.1145\/3125644"],"URL":"https:\/\/doi.org\/10.1145\/3125644","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,14]]},"assertion":[{"value":"2015-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-10-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}