{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:33:34Z","timestamp":1781109214668,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,20]],"date-time":"2021-06-20T00:00:00Z","timestamp":1624147200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["IIS-18-14493, CCF-20-07556, CRII-1850348, III-1910014"],"award-info":[{"award-number":["IIS-18-14493, CCF-20-07556, CRII-1850348, III-1910014"]}],"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":[[2021,6,20]]},"DOI":"10.1145\/3452021.3458318","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T14:21:58Z","timestamp":1624026118000},"page":"199-214","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Algorithms for a Topology-aware Massively Parallel Computation Model"],"prefix":"10.1145","author":[{"given":"Xiao","family":"Hu","sequence":"first","affiliation":[{"name":"Duke University, Durham, NC, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paraschos","family":"Koutris","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Spyros","family":"Blanas","sequence":"additional","affiliation":[{"name":"The Ohio State University, Columbus, OH, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,20]]},"reference":[{"issue":"9","key":"e_1_3_2_1_1_1","first-page":"1282","article-title":"Optimizing multiway joins in a map-reduce environment","volume":"23","author":"Afrati F. N.","year":"2011","unstructured":"F. N. Afrati and J. D. Ullman . Optimizing multiway joins in a map-reduce environment . TKDE , 23 ( 9 ): 1282 -- 1298 , 2011 . F. N. Afrati and J. D. Ullman. Optimizing multiway joins in a map-reduce environment. TKDE, 23(9):1282--1298, 2011.","journal-title":"TKDE"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902303"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591805"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331596"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2532645"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.74"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2465224"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594538.2594558"},{"key":"e_1_3_2_1_9_1","volume-title":"CIDR","author":"Blanas S.","year":"2020","unstructured":"S. Blanas , P. Koutris , and A. Sidiropoulos . Topology-aware parallel data processing: Models, algorithms and systems at scale . In CIDR , 2020 . S. Blanas, P. Koutris, and A. Sidiropoulos. Topology-aware parallel data processing: Models, algorithms and systems at scale. In CIDR, 2020."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2612185"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.167"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.73"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31594-7_18"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/060674442"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018448"},{"key":"e_1_3_2_1_16_1","first-page":"13","volume-title":"HotCloud","author":"Culhane W.","year":"2014","unstructured":"W. Culhane , K. Kogan , C. Jayalath , and P. Eugster . Loom: Optimal aggregation overlays for in-memory big data processing . In HotCloud , pages 13 -- 13 . USENIX Association , 2014 . W. Culhane, K. Kogan, C. Jayalath, and P. Eugster. Loom: Optimal aggregation overlays for in-memory big data processing. In HotCloud, pages 13--13. USENIX Association, 2014."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218544"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/155332.155333"},{"key":"e_1_3_2_1_19_1","first-page":"517","volume-title":"Sparse and lopsided set disjointness via information theory","author":"Dasgupta A.","year":"2012","unstructured":"A. Dasgupta , R. Kumar , and D. Sivakumar . Sparse and lopsided set disjointness via information theory . In A. Gupta, K. Jansen, J. Rolim, and R. Servedio, editors, APPROX\/RANDOM, pages 517 -- 528 . Springer Berlin Heidelberg , 2012 . A. Dasgupta, R. Kumar, and D. Sivakumar. Sparse and lopsided set disjointness via information theory. In A. Gupta, K. Jansen, J. Rolim, and R. Servedio, editors, APPROX\/RANDOM, pages 517--528. Springer Berlin Heidelberg, 2012."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212743"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212743"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795294141"},{"key":"e_1_3_2_1_24_1","first-page":"374","volume-title":"ISAAC","author":"Goodrich M. T.","year":"2011","unstructured":"M. T. Goodrich , N. Sitchinava , and Q. Zhang . Sorting, searching, and simulation in the mapreduce framework . In ISAAC , pages 374 -- 383 . Springer , 2011 . M. T. Goodrich, N. Sitchinava, and Q. Zhang. Sorting, searching, and simulation in the mapreduce framework. In ISAAC, pages 374--383. Springer, 2011."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3294052.3319698"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3444831.3444833"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3311967"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3034788"},{"key":"e_1_3_2_1_29_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 , 2016 . P. Koutris, P. Beame, and D. Suciu. Worst-case optimal algorithms for parallel query processing. In ICDT, 2016."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989284.1989310"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3092931.3092934"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3294052.3319686"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/2304"},{"key":"e_1_3_2_1_34_1","volume-title":"Arrays\u00b7 trees\u00b7 hypercubes","author":"Leighton F. T.","year":"2014","unstructured":"F. T. Leighton . Introduction to parallel algorithms and architectures : Arrays\u00b7 trees\u00b7 hypercubes . Elsevier , 2014 . F. T. Leighton. Introduction to parallel algorithms and architectures: Arrays\u00b7 trees\u00b7 hypercubes. Elsevier, 2014."},{"key":"e_1_3_2_1_35_1","unstructured":"F. T. Leighton B. M. Maggs and S. B. Rao. Packet routing and job-shop scheduling ino (congestion  F. T. Leighton B. M. Maggs and S. B. Rao. Packet routing and job-shop scheduling ino (congestion"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"dilation) steps. Combinatorica 14(2):167--186 1994.  dilation) steps. Combinatorica 14(2):167--186 1994.","DOI":"10.1007\/BF01215349"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1985.6312192"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221015"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/3291264.3291273"},{"key":"e_1_3_2_1_40_1","unstructured":"S. Madden M. J. Franklin J. M. Hellerstein and W. Hong. TAG: A tiny aggregation service for ad-hoc sensor networks. In OSDI.  S. Madden M. J. Franklin J. M. Hellerstein and W. Hong. TAG: A tiny aggregation service for ad-hoc sensor networks. In OSDI."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872817"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/832315.837554"},{"key":"e_1_3_2_1_43_1","volume-title":"Terabyte sort on apache hadoop","author":"O'Malley O.","year":"2008","unstructured":"O. O'Malley . Terabyte sort on apache hadoop . 2008 . O. O'Malley. Terabyte sort on apache hadoop. 2008."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.879350"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/09075336X"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463719"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_49_1","volume-title":"ICDT","author":"Yufei T.","year":"2020","unstructured":"T. Yufei . A simple parallel algorithm for natural joins on binary relations . ICDT , 2020 . T. Yufei. A simple parallel algorithm for natural joins on binary relations. ICDT, 2020."}],"event":{"name":"SIGMOD\/PODS '21: International Conference on Management of Data","location":"Virtual Event China","acronym":"SIGMOD\/PODS '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3452021.3458318","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3452021.3458318","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3452021.3458318","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3452021.3458318","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:03:00Z","timestamp":1750197780000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3452021.3458318"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,20]]},"references-count":49,"alternative-id":["10.1145\/3452021.3458318","10.1145\/3452021"],"URL":"https:\/\/doi.org\/10.1145\/3452021.3458318","relation":{},"subject":[],"published":{"date-parts":[[2021,6,20]]},"assertion":[{"value":"2021-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}