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: hd558116cfac1e35c
Venue: SIGMOD
Year: 2004
Pagerank: 7.0865558e-05
Overall Rank: 3,699 | 75.14%
DOI: 10.1145/1007568.1007643

Incoming Non-self Citations Over Time

Authors

1. Jun Rao (IBM)
2. Hamid Pirahesh (IBM)
3. Calisto Zuzarte (IBM)

BibTeX Citation

@inproceedings{rao_sigmod04,
        title = {{Canonical Abstraction for Outerjoin Optimization}},
        author = {Rao, Jun and Pirahesh, Hamid and Zuzarte, Calisto},
        series = {{SIGMOD} '04},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1007568.1007643},
        url = {https://dl.acm.org/doi/10.1145/1007568.1007643},
        year = {2004}
}

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
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
6,499	Full Disjunctions: Polynomial-Delay Iterators in Action	2006	VLDB	5.7650247e-05
7,719	1,000 Tables Under the From	2009	VLDB	5.4680371e-05
12,209	Improving Join Reorderability with Compensation Operators	2018	SIGMOD	4.9793485e-05
12,412	Left Bit Right: For SPARQL Join Queries with OPTIONAL Patterns (Left-outer-joins)	2015	SIGMOD	4.9793485e-05
12,580	Efficient Implementation of Generalized Quantification in Relational Query Languages	2013	VLDB	4.9793485e-05

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.0023947656
10	Extending the Data Base Relational Model to Capture More Meaning	1979	SIGMOD	0.00075944947
1,057	Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins	1990	SIGMOD	0.00012231557
1,198	Outerjoins as Disjunctions	1994	SIGMOD	0.00011565328
1,993	Clio: A Semi-Automatic Tool For Schema Mapping	2001	SIGMOD	9.2222424e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	10,508	Succinct Structure Representations for Efficient Query Optimization	2026	SIGMOD
2	8,462	On the Optimality of Strategies for Multiple Joins	1990	PODS
3	1,596	Adopting Worst-Case Optimal Joins in Relational Database Systems	2020	VLDB
4	1,057	Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins	1990	SIGMOD
5	1,186	Adaptive Optimization of Very Large Join Queries	2018	SIGMOD
6	2,136	Optimization of Multi-Way Join Queries for Parallel Execution	1991	VLDB
7	3,267	Hypergraph based reorderings of outer join queries with complex predicates	1995	SIGMOD
8	1,198	Outerjoins as Disjunctions	1994	SIGMOD
9	1,935	Extending the Algebraic Framework of Query Processing to Handle Outerjoins	1984	VLDB
10	12,209	Improving Join Reorderability with Compensation Operators	2018	SIGMOD