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
7490
Venue
SIGMOD
Year
2026
Pagerank
5.093636e-05
Overall Rank
10,296 | 29.37%
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.0024089429
103 DuckDB: an Embeddable Analytical Database 2019 SIGMOD 0.00034161428
358 FAQ: Questions Asked Frequently 2016 PODS 0.00020243592
378 Bao: Making Learned Query Optimization Practical 2021 SIGMOD 0.00019638121
530 An Analytical Study of Large SPARQL Query Logs 2018 VLDB 0.0001709169
774 Rapid Bushy Join-order Optimization with Cartesian Products 1996 SIGMOD 0.00014123979
814 Hypertree Decompositions: Questions and Answers 2016 PODS 0.00013841737
1,013 Dynamic Programming Strikes Back 2008 SIGMOD 0.00012652549
1,109 What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? 2017 PODS 0.00012142685
1,122 Cardinality Estimation in DBMS: A Comprehensive Benchmark Evaluation 2022 VLDB 0.0001209124
1,241 Balsa: Learning a Query Optimizer Without Expert Demonstrations 2022 SIGMOD 0.00011521639
1,286 Adaptive Optimization of Very Large Join Queries 2018 SIGMOD 0.00011320736
1,499 Pessimistic Cardinality Estimation: Tighter Upper Bounds for Intermediate Join Cardinalities 2019 SIGMOD 0.00010564536
1,549 AJAR: Aggregations and Joins over Annotated Relations 2016 PODS 0.00010390168
1,673 Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width 2001 PODS 0.00010040854
1,832 DSB: A Decision Support Benchmark for Workload-Driven and Traditional Database Systems 2021 VLDB 9.6607418e-05
2,452 A Learned Query Rewrite System using Monte Carlo Tree Search 2022 VLDB 8.5584e-05
2,553 LLM-R^2: A Large Language Model Enhanced Rule-based Rewrite System for Boosting Query Efficiency 2025 VLDB 8.4283807e-05
3,622 Robust Join Processing with Diamond Hardened Joins 2024 VLDB 7.2465862e-05
4,553 Predicate Transfer: Efficient Pre-Filtering on Multi-Join Queries 2024 CIDR 6.6346951e-05
4,575 Conjunctive Queries with Comparisons 2022 SIGMOD 6.6223692e-05
5,399 Efficient Massively Parallel Join Optimization for Large Queries* 2022 SIGMOD 6.2319315e-05
5,529 Debunking the Myth of Join Ordering: Toward Robust SQL Analytics 2025 SIGMOD 6.18591e-05
5,639 LpBound: Pessimistic Cardinality Estimation using ℓp-Norms of Degree Sequences 2025 SIGMOD 6.1385102e-05
6,434 Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees 2025 SIGMOD 5.8799421e-05
6,444 Output-Optimal Algorithms for Join-Aggregate Queries 2025 PODS 5.8774519e-05
6,678 Output-sensitive Conjunctive Query Evaluation 2024 PODS 5.8053953e-05
7,161 Computing the Difference of Conjunctive Queries Efficiently 2023 SIGMOD 5.6852987e-05
7,386 Instance-Optimal Acyclic Join Processing Without Regret: Engineering the Yannakakis Algorithm in Column Stores 2025 VLDB 5.6273882e-05
8,453 A Learned Query Rewrite System 2023 VLDB 5.4229225e-05
9,042 DPconv: Super-Polynomially Faster Join Ordering 2024 SIGMOD 5.3256042e-05
10,020 Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization 2024 PODS 5.1757914e-05
11,183 Relational Algorithms for Top-k Query Evaluation 2024 SIGMOD 5.093636e-05
Previous Page 1 / 1 Next

Semantically Similar Papers