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: 3620
Venue: SIGMOD
Year: 2004
Pagerank: 7.2458252e-05
Overall Rank: 3,625 | 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,418	On the Correct and Complete Enumeration of the Core Search Space	2013	SIGMOD	6.7137462e-05
6,256	View Matching for Outer-Join Views	2005	VLDB	5.9398047e-05
6,373	Full Disjunctions: Polynomial-Delay Iterators in Action	2006	VLDB	5.8946564e-05
7,671	1,000 Tables Under the From	2009	VLDB	5.5708452e-05
11,909	Improving Join Reorderability with Compensation Operators	2018	SIGMOD	5.093636e-05
12,119	Left Bit Right: For SPARQL Join Queries with OPTIONAL Patterns (Left-outer-joins)	2015	SIGMOD	5.093636e-05
12,289	Efficient Implementation of Generalized Quantification in Relational Query Languages	2013	VLDB	5.093636e-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.0024089429
10	Extending the Data Base Relational Model to Capture More Meaning	1979	SIGMOD	0.0007727299
1,052	Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins	1990	SIGMOD	0.00012405308
1,176	Outerjoins as Disjunctions	1994	SIGMOD	0.00011809075
1,953	Clio: A Semi-Automatic Tool For Schema Mapping	2001	SIGMOD	9.4221557e-05

Semantically Similar Papers

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