DBScholar

Back to papers

Succinct Structure Representations for Efficient Query Optimization

Summary: Introduces linear-size meta-decompositions that compactly encode all join trees for acyclic queries, enabling polynomial-time enumeration and cost-based optimization without materializing plans. A new width notion captures plan guarantees; experiments show DP-comparable plans with orders-of-magnitude faster optimization. (summarized by gpt-5.6-luna on Jul 26 2026)

Paper ID
h8cf76c74f8c4fe2a
Venue
SIGMOD
Year
2026
Pagerank
4.9793485e-05
Overall Rank
10,508 | 29.36%
DOI
10.1145/3802117

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{jiang_sigmod26,
        title = {{Succinct Structure Representations for Efficient Query Optimization}},
        author = {Jiang, Zhekai and Wang, Qichen and Koch, Christoph},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3802117},
        url = {https://dl.acm.org/doi/10.1145/3802117},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 33 of 33 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
1 Access Path Selection in a Relational Database Management System 1979 SIGMOD 0.0023947656
71 DuckDB: an Embeddable Analytical Database 2019 SIGMOD 0.00037720227
357 FAQ: Questions Asked Frequently 2016 PODS 0.00020020639
362 Bao: Making Learned Query Optimization Practical 2021 SIGMOD 0.00019989474
540 An Analytical Study of Large SPARQL Query Logs 2018 VLDB 0.00016726545
796 Rapid Bushy Join-order Optimization with Cartesian Products 1996 SIGMOD 0.00013938011
818 Hypertree Decompositions: Questions and Answers 2016 PODS 0.0001366708
884 Dynamic Programming Strikes Back 2008 SIGMOD 0.00013267935
982 Cardinality Estimation in DBMS: A Comprehensive Benchmark Evaluation 2022 VLDB 0.00012714044
1,091 What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? 2017 PODS 0.00012074152
1,186 Adaptive Optimization of Very Large Join Queries 2018 SIGMOD 0.0001160797
1,199 Balsa: Learning a Query Optimizer Without Expert Demonstrations 2022 SIGMOD 0.00011563985
1,465 Pessimistic Cardinality Estimation: Tighter Upper Bounds for Intermediate Join Cardinalities 2019 SIGMOD 0.00010576304
1,515 DSB: A Decision Support Benchmark for Workload-Driven and Traditional Database Systems 2021 VLDB 0.00010417728
1,570 AJAR: Aggregations and Joins over Annotated Relations 2016 PODS 0.0001020855
1,690 Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width 2001 PODS 9.8609347e-05
2,039 LLM-R^2: A Large Language Model Enhanced Rule-based Rewrite System for Boosting Query Efficiency 2025 VLDB 9.1493268e-05
2,395 A Learned Query Rewrite System using Monte Carlo Tree Search 2022 VLDB 8.5281914e-05
3,153 Robust Join Processing with Diamond Hardened Joins 2024 VLDB 7.5883271e-05
4,369 Predicate Transfer: Efficient Pre-Filtering on Multi-Join Queries 2024 CIDR 6.6315141e-05
4,509 Conjunctive Queries with Comparisons 2022 SIGMOD 6.570408e-05
4,852 LpBound: Pessimistic Cardinality Estimation using ℓp-Norms of Degree Sequences 2025 SIGMOD 6.3806134e-05
4,950 Debunking the Myth of Join Ordering: Toward Robust SQL Analytics 2025 SIGMOD 6.3421691e-05
5,425 Efficient Massively Parallel Join Optimization for Large Queries* 2022 SIGMOD 6.1349269e-05
5,902 Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees 2025 SIGMOD 5.9536872e-05
6,467 Output-sensitive Conjunctive Query Evaluation 2024 PODS 5.7747248e-05
6,573 Output-Optimal Algorithms for Join-Aggregate Queries 2025 PODS 5.7455776e-05
6,805 Instance-Optimal Acyclic Join Processing Without Regret: Engineering the Yannakakis Algorithm in Column Stores 2025 VLDB 5.6780394e-05
7,292 Computing the Difference of Conjunctive Queries Efficiently 2023 SIGMOD 5.5642569e-05
8,622 A Learned Query Rewrite System 2023 VLDB 5.3012467e-05
9,211 DPconv: Super-Polynomially Faster Join Ordering 2024 SIGMOD 5.206112e-05
10,209 Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization 2024 PODS 5.0596605e-05
11,526 Relational Algorithms for Top-k Query Evaluation 2024 SIGMOD 4.9793485e-05
Previous Page 1 / 1 Next

Semantically Similar Papers