How to Optimize SQL Queries? A Comparison Between Split, Holistic, and Hybrid Approaches

Summary: Contrasts split vs holistic query optimization across full QEP decisions (join orders, access methods, physical operator implementations), highlighting stark optimization-time vs plan-quality tradeoffs. Proposes a top-k hybrid that recovers holistic optima with optimization time near split, validated experimentally in the mutable research DB. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 14011
Venue: VLDB
Year: 2025
Pagerank: 4.2373024e-05
Overall Rank: 9,957 | 30.74%
DOI: 10.14778/3749646.3749663

Incoming Non-self Citations Over Time

Authors

1. Luca Gretscher
2. Jens Dittrich

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
10,271	OBELISK: Efficient Offline Query Planning with Bayesian Optimization-Informed Language Model Reasoning	2026	VLDB	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 17 of 17 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.0040449103
60	Efficiently Compiling Efficient Query Plans for Modern Hardware	2011	VLDB	0.00064439773
71	How Good Are Query Optimizers, Really?	2016	VLDB	0.00059038975
333	Neo: A Learned Query Optimizer	2019	VLDB	0.00027206884
423	Measuring the Complexity of Join Enumeration in Query Optimization	1990	VLDB	0.00023669348
502	Worst-case Optimal Join Algorithms	2012	PODS	0.00021526612
907	Fundamental Techniques for Order Optimization	1996	SIGMOD	0.00015435983
978	Rapid Bushy Join-order Optimization with Cartesian Products	1996	SIGMOD	0.00014881073
1,826	Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products	2006	VLDB	0.00010400425
2,050	Optimal Top-Down Join Enumeration	2007	SIGMOD	9.6886663e-05
2,783	Flow-Loss: Learning Cardinality Estimates That Matter	2021	VLDB	8.1293383e-05
2,999	A Combined Framework for Grouping and Order Optimization	2004	VLDB	7.752797e-05
4,339	Avoiding Sorting and Grouping In Processing Queries	2003	VLDB	6.2769193e-05
5,087	Accelerating Queries with Group-By and Join by Groupjoin	2011	VLDB	5.7075009e-05
8,164	Efficiently Computing Join Orders with Heuristic Search	2023	SIGMOD	4.5718104e-05
9,464	Memory Efficient Scheduling of Query Pipeline Execution	2022	CIDR	4.3355852e-05
11,148	mutable: A Modern DBMS for Research and Fast Prototyping	2023	CIDR	4.1945683e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
594	A Rule-Based View of Query Optimization	1987	SIGMOD	0.00019534507
438	Query Optimization for Parallel Execution	1992	SIGMOD	0.00023199245
2,860	Optimization of Queries with User-defined Predicates	1996	VLDB	7.9934503e-05
6,374	Optimization of Conjunctive Predicates for Main Memory Column Stores	2016	VLDB	5.0927058e-05
1,070	Analyzing Plan Diagrams of Database Query Optimizers	2005	VLDB	0.00014316791
2,275	Adopting Worst-Case Optimal Joins in Relational Database Systems	2020	VLDB	9.1262202e-05
2,044	Optimization of Multi-Way Join Queries for Parallel Execution	1991	VLDB	9.6953608e-05
143	Optimization of Nonrecursive Queries	1986	VLDB	0.00041510555
9,662	Efficient Query Re-optimization with Judicious Subquery Selections	2023	SIGMOD	4.3097631e-05
454	An Overview of Query Optimization in Relational Systems	1998	PODS	0.00022734812