Database Paper Browser

Back to papers

Canonical Abstraction for Outerjoin Optimization

Summary: Canonical outer-join abstraction via outer Cartesian products, nullification, and best-match enables planning across all join orders. Extends inner-join optimizers to expanded search space; introduces SQL:1999 OLAP-based best-match. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3558
Venue
SIGMOD
Year
2004
Pagerank
6.7059122e-05
Overall Rank
3,850 | 73.22%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 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
8 Extending the Data Base Relational Model to Capture More Meaning 1979 SIGMOD 0.0015385917
901 Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins 1990 SIGMOD 0.00015487777
1,032 Outerjoins as Disjunctions 1994 SIGMOD 0.00014544529
1,596 Clio: A Semi-Automatic Tool For Schema Mapping 2001 SIGMOD 0.00011214591
Previous Page 1 / 1 Next

Semantically Similar Papers