DBScholar

Back to papers

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)

Paper ID
h2fb7a18a7cb20b65
Venue
SIGMOD
Year
1995
Pagerank
7.4764157e-05
Overall Rank
3,267 | 78.04%
DOI
10.1145/223784.223847

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{bhargava_sigmod95,
        title = {{Hypergraph based reorderings of outer join queries with complex predicates}},
        author = {Bhargava, Gautam and Goel, Piyush and Iyer, Bala},
        series = {{SIGMOD} '95},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/223784.223847},
        url = {https://dl.acm.org/doi/10.1145/223784.223847},
        year = {1995}
}

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Rank Citing Paper Year Venue Pagerank
884 Dynamic Programming Strikes Back 2008 SIGMOD 0.00013267935
1,163 Estimating Alphanumeric Selectivity in the Presence of Wildcards 1996 SIGMOD 0.00011750813
2,251 Counter Strike: Generic Top-Down Join Enumeration for Hypergraphs 2013 VLDB 8.7511987e-05
4,464 On the Correct and Complete Enumeration of the Core Search Space 2013 SIGMOD 6.5877622e-05
6,382 View Matching for Outer-Join Views 2005 VLDB 5.8066944e-05
7,344 SQL Query Optimization: Reordering for a General Class of Queries 1996 SIGMOD 5.5466492e-05
9,789 Computing Full Disjunctions 2003 PODS 5.1265605e-05
12,209 Improving Join Reorderability with Compensation Operators 2018 SIGMOD 4.9793485e-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.0023947656
97 Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates, and Quantifiers 1987 VLDB 0.00034124569
109 Extensible/Rule Based Query Rewrite Optimization in Starburst 1992 SIGMOD 0.0003276959
132 Optimization of Nested SQL Queries Revisited 1987 SIGMOD 0.00030241193
1,057 Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins 1990 SIGMOD 0.00012231557
1,198 Outerjoins as Disjunctions 1994 SIGMOD 0.00011565328
2,531 Supporting Flat Relations by a Nested Relational Kernel 1987 VLDB 8.3351949e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 2,728 Weighted Hypertree Decompositions and Optimal Query Plans 2004 PODS
2 8,039 Efficiently Computing Join Orders with Heuristic Search 2023 SIGMOD
3 3,699 Canonical Abstraction for Outerjoin Optimization 2004 SIGMOD
4 3,797 Query Simplification: Graceful Degradation for Join-Order Optimization 2009 SIGMOD
5 1,345 Reverse Engineering Complex Join Queries 2013 SIGMOD
6 1,935 Extending the Algebraic Framework of Query Processing to Handle Outerjoins 1984 VLDB
7 1,057 Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins 1990 SIGMOD
8 884 Dynamic Programming Strikes Back 2008 SIGMOD
9 12,209 Improving Join Reorderability with Compensation Operators 2018 SIGMOD
10 7,344 SQL Query Optimization: Reordering for a General Class of Queries 1996 SIGMOD