Extending the Algebraic Framework of Query Processing to Handle Outerjoins
Summary: Extends relational algebra with manipulation rules for outer joins, views, and nested subqueries. Enables standard optimization and view substitution machinery—also addressing aggregates, universal quantifiers, and sorting—without a new query-processing paradigm. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Arnon Rosenthal (Computer Corporation of America)
- 2. David Reiner (Computer Corporation of America)
BibTeX Citation
@article{rosenthal_vldb84,
title = {{Extending the Algebraic Framework of Query Processing to Handle Outerjoins}},
author = {Rosenthal, Arnon and Reiner, David},
journal = {PVLDB},
series = {{VLDB} '84},
pages = {334--344},
year = {1984}
}
Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 99 | Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates, and Quantifiers | 1987 | VLDB | 0.00034024478 |
| 275 | Extensible Query Processing in Starburst | 1989 | SIGMOD | 0.000224395 |
| 1,063 | Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins | 1990 | SIGMOD | 0.00012198695 |
| 1,201 | Outerjoins as Disjunctions | 1994 | SIGMOD | 0.00011523243 |
| 4,067 | Event-Join Optimization in Temporal Relational Databases | 1989 | VLDB | 6.8086897e-05 |
| 4,414 | On Semantic Reefs and Efficient Processing of Correlation Queries with Aggregates | 1985 | VLDB | 6.5978639e-05 |
| 6,211 | Towards an Efficient Evaluation of General Queries: Quantifier and Disjunction Processing Revisited | 1989 | SIGMOD | 5.8315199e-05 |
| 9,828 | Computing Full Disjunctions | 2003 | PODS | 5.1074821e-05 |
| 12,258 | Improving Join Reorderability with Compensation Operators | 2018 | SIGMOD | 4.9605343e-05 |
| 13,543 | On Optimizing Summary-Table-By-Example Queries | 1985 | PODS | 4.9605343e-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.0023948467 |
| 10 | Extending the Data Base Relational Model to Capture More Meaning | 1979 | SIGMOD | 0.00075677079 |
| 87 | Implementation of Integrity Constraints and Views by Query Modification | 1975 | SIGMOD | 0.00035589793 |
| 537 | Optimizing the Performance of a Relational Algebra Database Interface | 1975 | SIGMOD | 0.00016731368 |
| 2,320 | Optimization of Nested Queries in a Distributed Relational Database | 1984 | VLDB | 8.6359247e-05 |
| 2,557 | An Architecture For Query Optimization | 1982 | SIGMOD | 8.278395e-05 |
| 4,648 | Processing Queries with Quantifiers: A Horticultural Approach | 1983 | PODS | 6.4724782e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 13,065 | A Nested Relational Approach to Processing SQL Subqueries | 2005 | SIGMOD |
| 2 | 1,909 | Querying Multiple Features of Groups in Relational Databases | 1996 | VLDB |
| 3 | 13,568 | Using Semiouterjoins to Process Queries in Multidatabase Systems | 1984 | PODS |
| 4 | 7,371 | SQL Query Optimization: Reordering for a General Class of Queries | 1996 | SIGMOD |
| 5 | 3,708 | Canonical Abstraction for Outerjoin Optimization | 2004 | SIGMOD |
| 6 | 1,201 | Outerjoins as Disjunctions | 1994 | SIGMOD |
| 7 | 3,279 | Hypergraph based reorderings of outer join queries with complex predicates | 1995 | SIGMOD |
| 8 | 691 | Query Optimization in the Presence of Foreign Functions | 1993 | VLDB |
| 9 | 1,063 | Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins | 1990 | SIGMOD |
| 10 | 12,258 | Improving Join Reorderability with Compensation Operators | 2018 | SIGMOD |