{"id":"https://openalex.org/W2765269579","doi":"https://doi.org/10.1145/3125644","title":"Communication Steps for Parallel Query Processing","display_name":"Communication Steps for Parallel Query Processing","publication_year":2017,"publication_date":"2017-10-14","ids":{"openalex":"https://openalex.org/W2765269579","doi":"https://doi.org/10.1145/3125644","mag":"2765269579"},"language":"en","primary_location":{"id":"doi:10.1145/3125644","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3125644","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3125644","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3125644","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042076941","display_name":"Paul Beame","orcid":"https://orcid.org/0000-0002-2666-3545"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Paul Beame","raw_affiliation_strings":["University of Washington"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Washington","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040506752","display_name":"Paraschos Koutris","orcid":"https://orcid.org/0000-0001-6309-1702"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Paraschos Koutris","raw_affiliation_strings":["University of Washington"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Washington","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048204602","display_name":"Dan Suciu","orcid":"https://orcid.org/0000-0002-4144-0868"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dan Suciu","raw_affiliation_strings":["University of Washington"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Washington","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5042076941"],"corresponding_institution_ids":["https://openalex.org/I201448701"],"apc_list":null,"apc_paid":null,"fwci":3.6979,"has_fulltext":true,"cited_by_count":106,"citation_normalized_percentile":{"value":0.96068675,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"64","issue":"6","first_page":"1","last_page":"58"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7185764312744141},{"id":"https://openalex.org/keywords/skew","display_name":"Skew","score":0.6780140995979309},{"id":"https://openalex.org/keywords/joins","display_name":"Joins","score":0.6767037510871887},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5280274748802185},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.503731906414032},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.45192381739616394},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4447670578956604},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.4392288625240326},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4234945774078369},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4219492971897125},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3153765797615051},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.314994752407074},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2825015187263489},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23632115125656128}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7185764312744141},{"id":"https://openalex.org/C43711488","wikidata":"https://www.wikidata.org/wiki/Q7534783","display_name":"Skew","level":2,"score":0.6780140995979309},{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.6767037510871887},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5280274748802185},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.503731906414032},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.45192381739616394},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4447670578956604},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.4392288625240326},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4234945774078369},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4219492971897125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3153765797615051},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.314994752407074},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2825015187263489},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23632115125656128},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3125644","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3125644","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3125644","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3125644","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3125644","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3125644","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1616694929","display_name":"AF: Small: Communication and Resource Tradeoffs","funder_award_id":"1524246","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5839946874","display_name":null,"funder_award_id":"CCF-1524246 and CCF-1217099","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G656365904","display_name":null,"funder_award_id":"1535565","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8036255126","display_name":null,"funder_award_id":"1247469","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306555","display_name":"Wisconsin Alumni Research Foundation","ror":"https://ror.org/00hwxbz16"},{"id":"https://openalex.org/F4320319907","display_name":"Alberta Innovates - Technology Futures","ror":"https://ror.org/00ynafe15"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2765269579.pdf","grobid_xml":"https://content.openalex.org/works/W2765269579.grobid-xml"},"referenced_works_count":46,"referenced_works":["https://openalex.org/W1503698146","https://openalex.org/W1559980198","https://openalex.org/W1598698067","https://openalex.org/W1878833411","https://openalex.org/W1973898816","https://openalex.org/W1974695870","https://openalex.org/W1975602256","https://openalex.org/W1986870156","https://openalex.org/W1989135185","https://openalex.org/W2008199814","https://openalex.org/W2023146810","https://openalex.org/W2035038579","https://openalex.org/W2040660972","https://openalex.org/W2045271686","https://openalex.org/W2051586153","https://openalex.org/W2056981018","https://openalex.org/W2057256946","https://openalex.org/W2064757275","https://openalex.org/W2065023965","https://openalex.org/W2074935284","https://openalex.org/W2075620950","https://openalex.org/W2080745194","https://openalex.org/W2098935637","https://openalex.org/W2110086534","https://openalex.org/W2110814195","https://openalex.org/W2120724233","https://openalex.org/W2122465391","https://openalex.org/W2137373960","https://openalex.org/W2140509629","https://openalex.org/W2143594377","https://openalex.org/W2146492010","https://openalex.org/W2149565746","https://openalex.org/W2163087774","https://openalex.org/W2294274069","https://openalex.org/W2339415939","https://openalex.org/W2340787257","https://openalex.org/W2604241689","https://openalex.org/W2613113339","https://openalex.org/W2790840297","https://openalex.org/W2949663338","https://openalex.org/W2952861917","https://openalex.org/W2962945867","https://openalex.org/W3101158212","https://openalex.org/W4210551624","https://openalex.org/W4213146104","https://openalex.org/W4245652633"],"related_works":["https://openalex.org/W1983915440","https://openalex.org/W1513451900","https://openalex.org/W2907393545","https://openalex.org/W2962784854","https://openalex.org/W2130100567","https://openalex.org/W4288641573","https://openalex.org/W2328371232","https://openalex.org/W3095925971","https://openalex.org/W2963903795","https://openalex.org/W2008470896"],"abstract_inverted_index":{"We":[0],"study":[1,32],"the":[2,18,26,29,35,39,46,78,83,92,114,122,125,135,141,212,221,281,304,314],"problem":[3],"of":[4,20,37,41,43,51,85,87,96,127,140,190,195,215,229,231,254,303],"computing":[5],"conjunctive":[6],"queries":[7,155,167],"over":[8],"large":[9],"databases":[10],"on":[11],"parallel":[12],"architectures":[13],"without":[14],"shared":[15],"storage.":[16],"Using":[17],"structure":[19],"such":[21,156],"a":[22,61,187,216,226,232,274,300],"query":[23],"q":[24,68],"and":[25,45,103,110,161,180,237],"skew":[27,120],"in":[28,60,121,273,299,307,310],"data,":[30,129],"we":[31,98,111,130,169,174,279],"tradeoffs":[33],"between":[34,225],"number":[36,40,50,84,144],"processors,":[38],"rounds":[42,253,312],"communication,":[44],"per-processor":[47,238],"load":[48,79,239],"\u2014the":[49],"bits":[52,86],"each":[53,71],"processor":[54,72],"can":[55,58],"send":[56,322],"or":[57,218],"receive":[59],"single":[62],"round\u2014that":[63],"are":[64,94,148,259,271,318],"required":[65],"to":[66,133,210,219,290,321],"compute":[67,211],".":[69],"Since":[70],"must":[73],"store":[74],"its":[75],"received":[76],"bits,":[77],"is":[80,119,200,241],"at":[81],"most":[82],"storage":[88],"per":[89],"processor.":[90],"When":[91],"data":[93],"free":[95],"skew,":[97],"obtain":[99],"essentially":[100,151],"tight":[101],"upper":[102,179,257],"lower":[104,181,198,269,296],"bounds":[105,115,182,199,258,270,297],"for":[106,154,183,186,202],"one":[107],"round":[108,317],"algorithms,":[109],"show":[112,131],"how":[113,132],"degrade":[116],"when":[117,137],"there":[118],"data.":[123],"In":[124],"case":[126],"skewed":[128,158,162],"improve":[134],"algorithms":[136,153,185,264],"approximate":[138],"degrees":[139],"(necessarily":[142],"small":[143],"of)":[145],"heavy-hitter":[146],"elements":[147],"available,":[149],"obtaining":[150],"optimal":[152],"as":[157,171],"simple":[159,262],"joins":[160],"triangle":[163],"join":[164],"queries.":[165],"For":[166],"that":[168,201,240,287],"identify":[170],"treelike":[172],",":[173],"also":[175],"prove":[176],"nearly":[177],"matching":[178],"multi-round":[184,295],"natural":[188],"class":[189],"skew-free":[191],"databases.":[192],"One":[193],"consequence":[194],"these":[196],"latter":[197],"any":[203],"\u03b5":[204],">":[205],"0,":[206],"using":[207,265],"p":[208,246,251],"processors":[209,289,309],"connected":[213],"components":[214],"graph,":[217],"output":[220],"path,":[222],"if":[223],"any,":[224],"specified":[227],"pair":[228],"vertices":[230],"graph":[233],"with":[234],"m":[235,244],"edges":[236],"O":[242],"(":[243],"/":[245],"1\u2212\u03b5":[247],")":[248,252],"requires":[249],"\u03a9(log":[250],"communication.":[255],"Our":[256,267,294],"given":[260],"by":[261],"structured":[263],"MapReduce.":[266],"one-round":[268],"proved":[272],"very":[275],"general":[276],"model,":[277,286],"which":[278,308],"call":[280],"Massively":[282],"Parallel":[283],"Communication":[284],"(MPC)":[285],"allows":[288],"communicate":[291],"arbitrary":[292],"bits.":[293],"apply":[298],"restricted":[301],"version":[302],"MPC":[305],"model":[306],"subsequent":[311],"after":[313],"first":[315],"communication":[316],"only":[319],"allowed":[320],"tuples.":[323]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":13},{"year":2023,"cited_by_count":19},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":18},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-26T08:31:28.666265","created_date":"2025-10-10T00:00:00"}