{"id":"https://openalex.org/W4416255810","doi":"https://doi.org/10.4230/lipics.icdt.2026.17","title":"Algorithms for Optimizing Acyclic Queries","display_name":"Algorithms for Optimizing Acyclic Queries","publication_year":2025,"publication_date":"2025-09-17","ids":{"openalex":"https://openalex.org/W4416255810","doi":"https://doi.org/10.4230/lipics.icdt.2026.17"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2509.14144","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.14144","pdf_url":"https://arxiv.org/pdf/2509.14144","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"conference-paper","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2509.14144","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Luo, Zheng","orcid":"https://orcid.org/0009-0009-2641-8388"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Luo, Zheng","raw_affiliation_strings":["University of California, Los Angeles, CA, USA"],"raw_orcid":"https://orcid.org/0009-0009-2641-8388","affiliations":[{"raw_affiliation_string":"University of California, Los Angeles, CA, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":null,"display_name":"Van den Broeck, Wim","orcid":"https://orcid.org/0000-0002-5305-7348"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Van den Broeck, Wim","raw_affiliation_strings":["University of Bergen, Norway"],"raw_orcid":"https://orcid.org/0000-0002-5305-7348","affiliations":[{"raw_affiliation_string":"University of Bergen, Norway","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009539513","display_name":"Guy Van den Broeck","orcid":"https://orcid.org/0000-0003-3434-2503"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Van den Broeck, Guy","raw_affiliation_strings":["University of California, Los Angeles, CA, USA"],"raw_orcid":"https://orcid.org/0000-0003-3434-2503","affiliations":[{"raw_affiliation_string":"University of California, Los Angeles, CA, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042994585","display_name":"Yisu Remy Wang","orcid":"https://orcid.org/0000-0002-6887-9395"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Yisu Remy","raw_affiliation_strings":["University of California, Los Angeles, CA, USA"],"raw_orcid":"https://orcid.org/0000-0002-6887-9395","affiliations":[{"raw_affiliation_string":"University of California, Los Angeles, CA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.567300021648407,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.567300021648407,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.1688999980688095,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.05999999865889549,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/join","display_name":"Join (topology)","score":0.805400013923645},{"id":"https://openalex.org/keywords/joins","display_name":"Joins","score":0.7785999774932861},{"id":"https://openalex.org/keywords/hash-join","display_name":"Hash join","score":0.6173999905586243},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.6079999804496765},{"id":"https://openalex.org/keywords/sort-merge-join","display_name":"Sort-merge join","score":0.544700026512146},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5026999711990356},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.49799999594688416},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.45660001039505005},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.38190001249313354}],"concepts":[{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.805400013923645},{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.7785999774932861},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6427000164985657},{"id":"https://openalex.org/C188805328","wikidata":"https://www.wikidata.org/wiki/Q4060691","display_name":"Hash join","level":3,"score":0.6173999905586243},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.6079999804496765},{"id":"https://openalex.org/C203570394","wikidata":"https://www.wikidata.org/wiki/Q4060688","display_name":"Sort-merge join","level":3,"score":0.544700026512146},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5026999711990356},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.49799999594688416},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.45660001039505005},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45339998602867126},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44350001215934753},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.38190001249313354},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3783999979496002},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.3756999969482422},{"id":"https://openalex.org/C2779729312","wikidata":"https://www.wikidata.org/wiki/Q784232","display_name":"Query plan","level":5,"score":0.36559998989105225},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.3303999900817871},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.32580000162124634},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.32030001282691956},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.3154999911785126},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.31349998712539673},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.31299999356269836},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3041999936103821},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.30300000309944153},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.2994000017642975},{"id":"https://openalex.org/C65180967","wikidata":"https://www.wikidata.org/wiki/Q130901","display_name":"Binary relation","level":2,"score":0.2863999903202057},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.2818000018596649},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.27869999408721924},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.2754000127315521},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.2727000117301941},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.262800008058548}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:arXiv.org:2509.14144","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.14144","pdf_url":"https://arxiv.org/pdf/2509.14144","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:doi:10.4230/lipics.icdt.2026.17","is_oa":true,"landing_page_url":"http://webdam.inria.fr/Alice/","pdf_url":"https://www.vldb.org/pvldb/vol18/p2413-vansummeren.pdf","source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"pmh:oai:drops-oai.dagstuhl.de:25631","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2026.17","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol365-icdt2026/LIPIcs.ICDT.2026.17/LIPIcs.ICDT.2026.17.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,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.48550/arxiv.2509.14144","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2509.14144","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.4230/lipics.icdt.2026.17","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icdt.2026.17","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2509.14144","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.14144","pdf_url":"https://arxiv.org/pdf/2509.14144","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1400738837","display_name":null,"funder_award_id":"326537","funder_id":"https://openalex.org/F4320323299","funder_display_name":"Norges Forskningsr\u00e5d"},{"id":"https://openalex.org/G7324755930","display_name":null,"funder_award_id":"BOF20ZAP02","funder_id":"https://openalex.org/F4320325866","funder_display_name":"Universiteit Hasselt"}],"funders":[{"id":"https://openalex.org/F4320321730","display_name":"Fonds Wetenschappelijk Onderzoek","ror":"https://ror.org/03qtxy027"},{"id":"https://openalex.org/F4320323299","display_name":"Norges Forskningsr\u00e5d","ror":"https://ror.org/00epmv149"},{"id":"https://openalex.org/F4320325318","display_name":"L. Meltzers H\u00f8yskolefond","ror":null},{"id":"https://openalex.org/F4320325866","display_name":"Universiteit Hasselt","ror":"https://ror.org/04nbhqj75"},{"id":"https://openalex.org/F4320327336","display_name":"Vlaamse regering","ror":null},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Most":[0],"research":[1],"on":[2,7,34],"query":[3,75,141],"optimization":[4,49,156],"has":[5],"centered":[6],"binary":[8,44,160],"join":[9,13,35,57,70,110,127,147],"algorithms":[10,32],"like":[11],"hash":[12],"and":[14,46,104],"sort-merge":[15],"join.":[16],"However,":[17],"recent":[18],"years":[19],"have":[20],"seen":[21],"growing":[22],"interest":[23],"in":[24],"theoretically":[25],"optimal":[26],"algorithms,":[27],"notably":[28],"Yannakakis'":[29],"algorithm.":[30],"These":[31],"rely":[33],"trees,":[36],"which":[37,82],"differ":[38],"from":[39],"the":[40,84,97],"operator":[41],"trees":[42,58,71],"for":[43,59,90,116,138,159],"joins":[45],"require":[47],"new":[48],"techniques.":[50],"We":[51],"propose":[52],"three":[53],"approaches":[54],"to":[55,67],"constructing":[56],"acyclic":[60,91],"queries.":[61,128],"First,":[62],"we":[63,94,130],"give":[64],"an":[65,73],"algorithm":[66,101],"enumerate":[68],"all":[69],"of":[72,86,125,155],"alpha-acyclic":[74],"by":[76,102,149],"edits":[77],"with":[78],"amortized":[79],"constant":[80],"delay,":[81],"forms":[83],"basis":[85],"a":[87,107,117,139,146,150],"cost-based":[88],"optimizer":[89],"joins.":[92,161],"Second,":[93],"show":[95],"that":[96,132],"Maximum":[98],"Cardinality":[99],"Search":[100],"Tarjan":[103],"Yannakakis":[105],"constructs":[106],"unique":[108],"shallowest":[109],"tree,":[111],"rooted":[112],"at":[113],"any":[114,133],"relation,":[115],"Berge-acyclic":[118],"query;":[119],"this":[120],"tree":[121,148],"enables":[122],"parallel":[123],"execution":[124],"large":[126],"Finally,":[129],"prove":[131],"connected":[134],"left-deep":[135],"linear":[136],"plan":[137],"gamma-acyclic":[140],"can":[142],"be":[143],"converted":[144],"into":[145],"simple":[151],"algorithm,":[152],"allowing":[153],"reuse":[154],"infrastructure":[157],"developed":[158]},"counts_by_year":[],"updated_date":"2026-07-06T08:01:05.025921","created_date":"2025-10-10T00:00:00"}