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.9605343e-05
Overall Rank
10,585 | 29.05%
DOI
10.1145/3802117
PDF
Download (CC BY 4.0)

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.0023948467
71 DuckDB: an Embeddable Analytical Database 2019 SIGMOD 0.00037688945
355 Bao: Making Learned Query Optimization Practical 2021 SIGMOD 0.00020146245
357 FAQ: Questions Asked Frequently 2016 PODS 0.00020048899
536 An Analytical Study of Large SPARQL Query Logs 2018 VLDB 0.00016738841
794 Rapid Bushy Join-order Optimization with Cartesian Products 1996 SIGMOD 0.0001389694
819 Hypertree Decompositions: Questions and Answers 2016 PODS 0.00013623401
881 Dynamic Programming Strikes Back 2008 SIGMOD 0.0001324243
983 Cardinality Estimation in DBMS: A Comprehensive Benchmark Evaluation 2022 VLDB 0.00012677179
1,096 What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? 2017 PODS 0.00012035761
1,175 Balsa: Learning a Query Optimizer Without Expert Demonstrations 2022 SIGMOD 0.00011630532
1,185 Adaptive Optimization of Very Large Join Queries 2018 SIGMOD 0.00011586181
1,444 Pessimistic Cardinality Estimation: Tighter Upper Bounds for Intermediate Join Cardinalities 2019 SIGMOD 0.00010616242
1,513 DSB: A Decision Support Benchmark for Workload-Driven and Traditional Database Systems 2021 VLDB 0.00010394557
1,568 AJAR: Aggregations and Joins over Annotated Relations 2016 PODS 0.00010178045
1,695 Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width 2001 PODS 9.8317087e-05
1,956 LLM-R^2: A Large Language Model Enhanced Rule-based Rewrite System for Boosting Query Efficiency 2025 VLDB 9.2927535e-05
2,389 A Learned Query Rewrite System using Monte Carlo Tree Search 2022 VLDB 8.5228689e-05
3,165 Robust Join Processing with Diamond Hardened Joins 2024 VLDB 7.5598778e-05
4,396 Predicate Transfer: Efficient Pre-Filtering on Multi-Join Queries 2024 CIDR 6.6072577e-05
4,527 Conjunctive Queries with Comparisons 2022 SIGMOD 6.5466033e-05
4,882 LpBound: Pessimistic Cardinality Estimation using ℓp-Norms of Degree Sequences 2025 SIGMOD 6.3565046e-05
4,971 Debunking the Myth of Join Ordering: Toward Robust SQL Analytics 2025 SIGMOD 6.3209003e-05
5,446 Efficient Massively Parallel Join Optimization for Large Queries* 2022 SIGMOD 6.1117489e-05
5,911 Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees 2025 SIGMOD 5.9338021e-05
6,482 Output-sensitive Conjunctive Query Evaluation 2024 PODS 5.7529053e-05
6,585 Output-Optimal Algorithms for Join-Aggregate Queries 2025 PODS 5.7238683e-05
6,826 Instance-Optimal Acyclic Join Processing Without Regret: Engineering the Yannakakis Algorithm in Column Stores 2025 VLDB 5.6566963e-05
7,311 Computing the Difference of Conjunctive Queries Efficiently 2023 SIGMOD 5.5432326e-05
8,639 A Learned Query Rewrite System 2023 VLDB 5.2825942e-05
9,244 DPconv: Super-Polynomially Faster Join Ordering 2024 SIGMOD 5.1864409e-05
10,252 Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization 2024 PODS 5.0405429e-05
11,581 Relational Algorithms for Top-k Query Evaluation 2024 SIGMOD 4.9605343e-05
Previous Page 1 / 1 Next

Semantically Similar Papers