Counter Strike: Generic Top-Down Join Enumeration for Hypergraphs

Summary: Proposes a generic top-down join enumeration for hypergraphs that handles multi-way predicates and outer joins, overcoming prior work limited to binary inner joins. Uses branch-and-bound pruning to preserve optimality with large compile-time gains, remaining competitive with bottom-up approaches. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 10669
Venue: VLDB
Year: 2013
Pagerank: 8.1286814e-05
Overall Rank: 2,785 | 80.63%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Pit Fender
2. Guido Moerkotte

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
71	How Good Are Query Optimizers, Really?	2016	VLDB	0.00059038975
1,105	Cardinality Estimation Done Right: Index-Based Join Sampling	2017	CIDR	0.00013990395
1,619	Adaptive Optimization of Very Large Join Queries	2018	SIGMOD	0.00011111678
5,037	Keep It Simple: Testing Databases via Differential Query Plans	2024	SIGMOD	5.7434825e-05
5,589	Neighborhood-based Hypergraph Core Decomposition	2023	VLDB	5.4216989e-05
6,443	Optimizing Join Enumeration in Transformation-based Query Optimizers	2014	VLDB	5.0599139e-05
7,467	Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees	2025	SIGMOD	4.7218691e-05
8,213	On the Calculation of Optimality Ranges for Relational Query Execution Plans	2018	SIGMOD	4.557937e-05
10,942	Sub-optimal Join Order Identification with L1-error	2024	SIGMOD	4.1945683e-05
11,053	Efficient Enumeration of Recursive Plans in Transformation-based Query Optimizers	2024	VLDB	4.1945683e-05
11,705	Improving Join Reorderability with Compensation Operators	2018	SIGMOD	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
423	Measuring the Complexity of Join Enumeration in Query Optimization	1990	VLDB	0.00023669348
978	Rapid Bushy Join-order Optimization with Cartesian Products	1996	SIGMOD	0.00014881073
1,341	Dynamic Programming Strikes Back	2008	SIGMOD	0.00012486285
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,999	A Combined Framework for Grouping and Order Optimization	2004	VLDB	7.752797e-05
3,339	Hypergraph based reorderings of outer join queries with complex predicates	1995	SIGMOD	7.2038026e-05
4,938	On the Correct and Complete Enumeration of the Core Search Space	2013	SIGMOD	5.8184655e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
978	Rapid Bushy Join-order Optimization with Cartesian Products	1996	SIGMOD	0.00014881073
7,166	Ranked Enumeration of Join Queries with Projections	2022	VLDB	4.8124491e-05
5,855	Optimal Join Algorithms Meet Top-k	2020	SIGMOD	5.3006096e-05
10,324	Towards Efficient Random-Order Enumeration for Join Queries	2026	VLDB	4.1945683e-05
423	Measuring the Complexity of Join Enumeration in Query Optimization	1990	VLDB	0.00023669348
1,341	Dynamic Programming Strikes Back	2008	SIGMOD	0.00012486285
3,715	Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries	2020	VLDB	6.8220943e-05
7,692	Processing Top-k Join Queries	2010	VLDB	4.6761366e-05
3,339	Hypergraph based reorderings of outer join queries with complex predicates	1995	SIGMOD	7.2038026e-05
2,050	Optimal Top-Down Join Enumeration	2007	SIGMOD	9.6886663e-05