{"id":"https://openalex.org/W7138339165","doi":"https://doi.org/10.48550/arxiv.2603.15465","title":"Succinct Structure Representations for Efficient Query Optimization","display_name":"Succinct Structure Representations for Efficient Query Optimization","publication_year":2026,"publication_date":"2026-03-16","ids":{"openalex":"https://openalex.org/W7138339165","doi":"https://doi.org/10.48550/arxiv.2603.15465"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.15465","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.15465","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":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.15465","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029342808","display_name":"Zhekai Jiang","orcid":"https://orcid.org/0009-0001-0989-5926"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jiang, Zhekai","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129725722","display_name":"Qichen Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Qichen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5129726716","display_name":"Christoph Koch","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Koch, Christoph","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"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/T11106","display_name":"Data Management and Algorithms","score":0.4672999978065491,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.4672999978065491,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.1826000064611435,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.1307000070810318,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.6431000232696533},{"id":"https://openalex.org/keywords/join","display_name":"Join (topology)","score":0.6416000127792358},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5683000087738037},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5049999952316284},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.4986000061035156},{"id":"https://openalex.org/keywords/query-plan","display_name":"Query plan","score":0.4645000100135803},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.45410001277923584},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.447299987077713},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4343000054359436}],"concepts":[{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.6431000232696533},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.6416000127792358},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.609000027179718},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5683000087738037},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5217999815940857},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5049999952316284},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.4986000061035156},{"id":"https://openalex.org/C2779729312","wikidata":"https://www.wikidata.org/wiki/Q784232","display_name":"Query plan","level":5,"score":0.4645000100135803},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.45410001277923584},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.447299987077713},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4343000054359436},{"id":"https://openalex.org/C24755975","wikidata":"https://www.wikidata.org/wiki/Q4943354","display_name":"Boolean conjunctive query","level":5,"score":0.3808000087738037},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.35910001397132874},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3540000021457672},{"id":"https://openalex.org/C100776233","wikidata":"https://www.wikidata.org/wiki/Q2532492","display_name":"Bridge (graph theory)","level":2,"score":0.329800009727478},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.3287000060081482},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.32510000467300415},{"id":"https://openalex.org/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.30820000171661377},{"id":"https://openalex.org/C172722865","wikidata":"https://www.wikidata.org/wiki/Q2302053","display_name":"Spatial query","level":5,"score":0.3070000112056732},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.3009999990463257},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.296999990940094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.295199990272522},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.2946000099182129},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.29319998621940613},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.28679999709129333},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2662000060081482},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2623000144958496},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2517000138759613}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.15465","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.15465","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":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.15465","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.15465","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":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.7001175880432129}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Structural":[0],"decomposition":[1],"methods":[2],"offer":[3],"powerful":[4],"theoretical":[5,115],"guarantees":[6],"for":[7,43],"join":[8,54,96],"evaluation,":[9],"yet":[10],"they":[11],"are":[12,141],"rarely":[13],"used":[14],"in":[15,65,72,134,138,147],"real-world":[16],"query":[17,74,128],"optimizers.":[18],"A":[19],"major":[20],"reason":[21],"is":[22],"the":[23,73,86,89,114,136,153,158,181],"difficulty":[24],"of":[25,109,119,126,176],"combining":[26],"cost-based":[27,81],"plan":[28],"search":[29],"and":[30,56,68,123,166],"structure-based":[31],"evaluation.":[32],"In":[33],"this":[34,38,103],"work,":[35],"we":[36],"bridge":[37],"gap":[39],"by":[40,102,157,174,184],"introducing":[41],"meta-decompositions":[42],"acyclic":[44],"queries,":[45,168],"a":[46,106],"novel":[47,107],"representation":[48],"that":[49],"succinctly":[50],"represents":[51],"all":[52,94],"possible":[53,95],"trees":[55],"enables":[57],"their":[58],"efficient":[59,79],"enumeration.":[60],"Meta-decompositions":[61],"can":[62],"be":[63],"constructed":[64],"polynomial":[66],"time":[67,125,182],"have":[69],"sizes":[70,122],"linear":[71],"size.":[75],"We":[76,98],"design":[77],"an":[78],"polynomial-time":[80],"optimizer":[82],"based":[83],"directly":[84],"on":[85,164],"meta-decomposition,":[87],"without":[88],"need":[90],"to":[91,144,180],"explicitly":[92],"enumerate":[93],"trees.":[97],"characterize":[99],"plans":[100,137],"found":[101,156],"approach":[104],"using":[105],"notion":[108],"width,":[110],"which":[111],"effectively":[112],"implies":[113],"worst-case":[116],"asymptotic":[117],"bounds":[118],"intermediate":[120],"result":[121],"running":[124],"any":[127],"plan.":[129],"Experimental":[130],"results":[131],"demonstrate":[132],"that,":[133],"practice,":[135],"our":[139,170],"class":[140],"consistently":[142],"comparable":[143,179],"--":[145,152],"even":[146],"many":[148],"cases":[149],"better":[150],"than":[151],"optimal":[154],"ones":[155],"state-of-the-art":[159],"dynamic":[160],"programming":[161],"approach,":[162],"especially":[163],"large":[165],"complex":[167],"while":[169],"planning":[171],"process":[172],"runs":[173],"orders":[175],"magnitude":[177],"faster,":[178],"taken":[183],"common":[185],"heuristic":[186],"methods.":[187]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-03-18T00:00:00"}