On the Correct and Complete Enumeration of the Core Search Space

Summary: Three conflict detectors prune invalid core-space reorders beyond traditional joins; simpler, clearer, and more flexible than prior buggy methods. The last detector is complete, enabling generation of all valid plans in the core space, with extensibility to new operators and relaxed null-rejection constraints. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 4721
Venue: SIGMOD
Year: 2013
Pagerank: 5.8184655e-05
Overall Rank: 4,938 | 65.65%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,619	Adaptive Optimization of Very Large Join Queries	2018	SIGMOD	0.00011111678
2,785	Counter Strike: Generic Top-Down Join Enumeration for Hypergraphs	2013	VLDB	8.1286814e-05
6,443	Optimizing Join Enumeration in Transformation-based Query Optimizers	2014	VLDB	5.0599139e-05
8,844	Faster Plan Generation through Consideration of Functional Dependencies and Keys	2016	VLDB	4.437664e-05
8,961	An Effective Syntax for Bounded Relational Queries	2016	SIGMOD	4.4206115e-05
11,053	Efficient Enumeration of Recursive Plans in Transformation-based Query Optimizers	2024	VLDB	4.1945683e-05
11,624	Towards Multi-way Join Aware Optimizer in SAP HANA	2020	VLDB	4.1945683e-05
11,705	Improving Join Reorderability with Compensation Operators	2018	SIGMOD	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
100	Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates, and Quantifiers	1987	VLDB	0.00049624696
248	Eager Aggregation and Lazy Aggregation	1995	VLDB	0.00030785339
639	Orthogonal Optimization of Subqueries and Aggregation	2001	SIGMOD	0.00018791492
901	Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins	1990	SIGMOD	0.00015487777
1,341	Dynamic Programming Strikes Back	2008	SIGMOD	0.00012486285
1,582	Execution Strategies for SQL Subqueries	2007	SIGMOD	0.00011265079
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,869	The Complexity of Transformation-Based Join Enumeration	1997	VLDB	7.9808408e-05
3,339	Hypergraph based reorderings of outer join queries with complex predicates	1995	SIGMOD	7.2038026e-05
3,850	Canonical Abstraction for Outerjoin Optimization	2004	SIGMOD	6.7059122e-05
5,087	Accelerating Queries with Group-By and Join by Groupjoin	2011	VLDB	5.7075009e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
12,890	Avoiding Cartesian Products in Programs for Multiple Joins (Extended Abstract)	1992	PODS	4.1945683e-05
7,976	On the Optimality of Strategies for Multiple Joins	1990	PODS	4.613363e-05
1,619	Adaptive Optimization of Very Large Join Queries	2018	SIGMOD	0.00011111678
1,572	Reverse Engineering Complex Join Queries	2013	SIGMOD	0.00011298251
4,523	Simplicity Done Right for Join Ordering	2021	CIDR	6.1135504e-05
8,966	Output-sensitive Conjunctive Query Evaluation	2024	PODS	4.4193184e-05
8,164	Efficiently Computing Join Orders with Heuristic Search	2023	SIGMOD	4.5718104e-05
3,339	Hypergraph based reorderings of outer join queries with complex predicates	1995	SIGMOD	7.2038026e-05
901	Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins	1990	SIGMOD	0.00015487777
11,705	Improving Join Reorderability with Compensation Operators	2018	SIGMOD	4.1945683e-05