Hypergraph based reorderings of outer join queries with complex predicates
Summary: Proposes a hypergraph abstraction to reorder outer-join queries with complex predicates and duplicates, addressing inadequacies of traditional query-graph models. Enables a larger, DP-friendly plan space and cost-based optimization, yielding plans. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Gautam Bhargava
- 2. Piyush Goel
- 3. Bala Iyer
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,146 | Estimating Alphanumeric Selectivity in the Presence of Wildcards | 1996 | SIGMOD | 0.00013679782 |
| 1,341 | Dynamic Programming Strikes Back | 2008 | SIGMOD | 0.00012486285 |
| 2,785 | Counter Strike: Generic Top-Down Join Enumeration for Hypergraphs | 2013 | VLDB | 8.1286814e-05 |
| 4,938 | On the Correct and Complete Enumeration of the Core Search Space | 2013 | SIGMOD | 5.8184655e-05 |
| 6,166 | View Matching for Outer-Join Views | 2005 | VLDB | 5.1724475e-05 |
| 8,784 | SQL Query Optimization: Reordering for a General Class of Queries | 1996 | SIGMOD | 4.4527694e-05 |
| 9,511 | Computing Full Disjunctions | 2003 | PODS | 4.3340927e-05 |
| 11,705 | Improving Join Reorderability with Compensation Operators | 2018 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 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 |
| 100 | Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates, and Quantifiers | 1987 | VLDB | 0.00049624696 |
| 106 | Extensible/Rule Based Query Rewrite Optimization in Starburst | 1992 | SIGMOD | 0.00048400734 |
| 130 | Optimization of Nested SQL Queries Revisited | 1987 | SIGMOD | 0.00044031247 |
| 901 | Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins | 1990 | SIGMOD | 0.00015487777 |
| 1,032 | Outerjoins as Disjunctions | 1994 | SIGMOD | 0.00014544529 |
| 2,468 | Supporting Flat Relations by a Nested Relational Kernel | 1987 | VLDB | 8.7416405e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,038 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS | 0.00014492414 |
| 8,164 | Efficiently Computing Join Orders with Heuristic Search | 2023 | SIGMOD | 4.5718104e-05 |
| 3,850 | Canonical Abstraction for Outerjoin Optimization | 2004 | SIGMOD | 6.7059122e-05 |
| 4,738 | Query Simplification: Graceful Degradation for Join-Order Optimization | 2009 | SIGMOD | 5.9600502e-05 |
| 1,572 | Reverse Engineering Complex Join Queries | 2013 | SIGMOD | 0.00011298251 |
| 1,451 | Extending the Algebraic Framework of Query Processing to Handle Outerjoins | 1984 | VLDB | 0.00011922302 |
| 901 | Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins | 1990 | SIGMOD | 0.00015487777 |
| 1,341 | Dynamic Programming Strikes Back | 2008 | SIGMOD | 0.00012486285 |
| 11,705 | Improving Join Reorderability with Compensation Operators | 2018 | SIGMOD | 4.1945683e-05 |
| 8,784 | SQL Query Optimization: Reordering for a General Class of Queries | 1996 | SIGMOD | 4.4527694e-05 |