{"id":"https://openalex.org/W2962945867","doi":"https://doi.org/10.4230/lipics.icdt.2016.8","title":"Worst-Case Optimal Algorithms for Parallel Query Processing","display_name":"Worst-Case Optimal Algorithms for Parallel Query Processing","alternate_titles":[],"publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2962945867","doi":"https://doi.org/10.4230/lipics.icdt.2016.8","mag":"2962945867"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:5777","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.8","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol048-icdt2016/LIPIcs.ICDT.2016.8/LIPIcs.ICDT.2016.8.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},"parent_works":[{"id":"https://openalex.org/W2757302124","display_name":"LIPIcs, Volume 48, ICDT'16, Complete Volume","relationship":"part","link_type":"part"}],"lineage":["https://openalex.org/W2962945867","https://openalex.org/W2757302124"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol048-icdt2016/LIPIcs.ICDT.2016.8/LIPIcs.ICDT.2016.8.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040506752","display_name":"Paraschos Koutris","orcid":"https://orcid.org/0000-0001-6309-1702","observed_orcids":["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,"contributor_roles":[],"raw_author_name":"Koutris, Paraschos","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/A5042076941","display_name":"Paul W. Beame","orcid":"https://orcid.org/0000-0002-2666-3545","observed_orcids":["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":false,"contributor_roles":[],"raw_author_name":"Beame, Paul","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 Mircea Suciu","orcid":"https://orcid.org/0000-0002-4144-0868","observed_orcids":["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,"contributor_roles":[],"raw_author_name":"Suciu, Dan","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":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I201448701"],"apc_list":null,"apc_paid":null,"fwci":8.2796,"has_fulltext":true,"cited_by_count":51,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.97345815,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":86,"max":99},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9721999764442444,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9721999764442444,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.007699999958276749,"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/T11269","display_name":"Algorithms and Data Compression","score":0.00430000014603138,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parallel-query-processing","display_name":"parallel query processing","score":0.9229999780654907},{"id":"https://openalex.org/keywords/conjunctive-queries","display_name":"conjunctive queries","score":0.843999981880188},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"communication complexity","score":0.9380000233650208},{"id":"https://openalex.org/keywords/worst-case-optimal-algorithms","display_name":"worst-case optimal algorithms","score":0.9240000247955322},{"id":"https://openalex.org/keywords/i-o-complexity","display_name":"I/O complexity","score":0.9380000233650208},{"id":"https://openalex.org/keywords/join-queries","display_name":"join queries","score":0.9480000138282776},{"id":"https://openalex.org/keywords/skewed-data","display_name":"skewed data","score":0.5490000247955322},{"id":"https://openalex.org/keywords/load-balancing","display_name":"load balancing","score":0.47200000286102295}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.713057279586792},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.6874300241470337},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.6328065991401672},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5457774996757507},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5410574078559875},{"id":"https://openalex.org/C43711488","wikidata":"https://www.wikidata.org/wiki/Q7534783","display_name":"Skew","level":2,"score":0.5321556329727173},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.4926226735115051},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4812602698802948},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.4760199189186096},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43556880950927734},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39317044615745544},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21596375107765198},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.13099518418312073},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.12817972898483276},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.10611563920974731},{"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:5777","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.8","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol048-icdt2016/LIPIcs.ICDT.2016.8/LIPIcs.ICDT.2016.8.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.icdt.2016.8","doi":"https://doi.org/10.4230/lipics.icdt.2016.8","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icdt.2016.8","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj","jufo-1","norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:5777","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.8","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol048-icdt2016/LIPIcs.ICDT.2016.8/LIPIcs.ICDT.2016.8.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"study_designs":[],"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/G1846182309","display_name":"AF: Small:Tradeoffs among Measures in Computational and Proof Complexity","funder_award_id":"1217099","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G656365904","display_name":"AitF: FULL: Query Processing with Optimal Communication Cost","funder_award_id":"1535565","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8036255126","display_name":"BIGDATA: Mid-Scale: DCM: A Formal Foundation for Big Data Management","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"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2962945867.pdf","grobid_xml":"https://content.openalex.org/works/W2962945867.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W1627428726","https://openalex.org/W1759086394","https://openalex.org/W1874851952","https://openalex.org/W1945584931","https://openalex.org/W1974121232","https://openalex.org/W1974695870","https://openalex.org/W2002203222","https://openalex.org/W2008199814","https://openalex.org/W2030088585","https://openalex.org/W2051586153","https://openalex.org/W2074935284","https://openalex.org/W2075620950","https://openalex.org/W2079136953","https://openalex.org/W2122465391","https://openalex.org/W2130305366","https://openalex.org/W2131975293","https://openalex.org/W2137373960","https://openalex.org/W2146492010","https://openalex.org/W2149565746","https://openalex.org/W2156396224","https://openalex.org/W2163087774","https://openalex.org/W2570634592","https://openalex.org/W2950274216","https://openalex.org/W3098475836","https://openalex.org/W4213146104","https://openalex.org/W7098745455"],"related_works":["https://openalex.org/W2613113339","https://openalex.org/W2765269579","https://openalex.org/W2137373960","https://openalex.org/W7163989935","https://openalex.org/W7139027457","https://openalex.org/W7097527262","https://openalex.org/W7135057959","https://openalex.org/W7110307096","https://openalex.org/W2612436726"],"abstract_inverted_index":{"In":[0,27],"this":[1,59],"paper,":[2],"we":[3,61,99,156,168],"study":[4],"the":[5,9,38,67,81,132,141,150,174,203],"communication":[6,39,68],"complexity":[7,205],"for":[8,42,88,95,109,162,206,215],"problem":[10],"of":[11,45,56,66,83,149,165,218],"computing":[12,207],"a":[13,17,21,96,110,127,170,196],"conjunctive":[14,111],"query":[15,112,151],"on":[16,37,63,202],"large":[18],"database":[19],"in":[20,58],"parallel":[22,77,183],"setting":[23],"with":[24,53],"p":[25],"servers.":[26],"contrast":[28],"to":[29,73,80,120,173,181,185,193],"previous":[30],"work,":[31],"where":[32,124],"upper":[33],"and":[34,145,210],"lower":[35],"bounds":[36],"were":[40],"specified":[41],"particular":[43],"structures":[44],"data":[46,48,52],"(either":[47],"without":[49],"skew,":[50],"or":[51],"specific":[54],"types":[55],"skew),":[57],"work":[60,82],"focus":[62],"worst-case":[64,75,104],"analysis":[65],"cost.":[69],"The":[70,106],"goal":[71],"is":[72,122,126,137],"find":[74],"optimal":[76,103,107,161,213],"algorithms,":[78],"similar":[79],"(Ngo":[84],"et":[85],"al.":[86],"2012)":[87],"sequential":[89],"algorithms.":[90,188],"We":[91],"first":[92],"show":[93,169],"that":[94,159],"single":[97],"round":[98],"can":[100],"obtain":[101,212],"an":[102],"algorithm.":[105],"load":[108],"q":[113],"when":[114],"all":[115],"relations":[116],"have":[117],"size":[118],"equal":[119],"M":[121],"O(M/p^{1/psi^*}),":[123],"psi^*":[125],"new":[128],"query-related":[129],"quantity":[130],"called":[131],"edge":[133,142,146],"quasi-packing":[134],"number,":[135],"which":[136,178],"different":[138],"from":[139],"both":[140],"packing":[143],"number":[144,148],"cover":[147],"hypergraph.":[152],"For":[153],"multiple":[154],"rounds,":[155],"present":[157],"algorithms":[158,184,214],"are":[160],"several":[163,199],"classes":[164,217],"queries.":[166,219],"Finally,":[167],"surprising":[171],"connection":[172],"external":[175,186],"memory":[176,187],"model,":[177],"allows":[179,191],"us":[180,192],"translate":[182],"This":[189],"technique":[190],"recover":[194],"(within":[195],"polylogarithmic":[197],"factor)":[198],"recent":[200],"results":[201],"I/O":[204],"join":[208],"queries,":[209],"also":[211],"other":[216]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2962945867","counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2019-07-30T00:00:00"}
