Computing Full Disjunctions
Summary: Full disjunctions: commutative/associative alternative to outerjoins—all non‑Cartesian subset‑joins minus subsumed tuples; evaluation under or/weak semantics reducible to weak semantics and polynomial in query, database and output sizes. Projection/non‑null selection polytime for γ‑acyclic schemes, NP‑hard in general; weak semantics extends full disjunctions to arbitrary join conditions. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yaron Kanza
- 2. Yehoshua Sagiv
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,981 | Matching Twigs in Probabilistic XML | 2007 | VLDB | 7.7783189e-05 |
| 3,929 | Maximally Joining Probabilistic Data | 2007 | PODS | 6.620459e-05 |
| 4,860 | Integrating Data Lake Tables | 2023 | VLDB | 5.867964e-05 |
| 5,137 | Full Disjunctions: Polynomial-Delay Iterators in Action | 2006 | VLDB | 5.6653126e-05 |
| 8,076 | An Incremental Algorithm for Computing Ranked Full Disjunctions | 2005 | PODS | 4.587923e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7 | Extending the Data Base Relational Model to Capture More Meaning | 1979 | SIGMOD | 0.0015464728 |
| 500 | Independent Database Schemas (Extended Abstract) | 1982 | PODS | 0.00021622167 |
| 1,034 | Outerjoins as Disjunctions | 1994 | SIGMOD | 0.00014532543 |
| 1,455 | Extending the Algebraic Framework of Query Processing to Handle Outerjoins | 1984 | VLDB | 0.00011912375 |
| 2,680 | LORE: A Lightweight Object REpository for Semistructured Data | 1996 | SIGMOD | 8.3203995e-05 |
| 2,776 | On The Integrity Of Databases With Incomplete Information | 1986 | PODS | 8.1371926e-05 |
| 2,972 | Integrating Information by Outerjoins and Full Disjunctions (Extended Abstract) | 1996 | PODS | 7.7933514e-05 |
| 3,338 | Hypergraph based reorderings of outer join queries with complex predicates | 1995 | SIGMOD | 7.1990012e-05 |
| 3,683 | Queries with Incomplete Answers over Semistructured Data | 1999 | PODS | 6.84255e-05 |
| 6,505 | Representing and Querying XML with Incomplete Information | 2001 | PODS | 5.0282726e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 12,944 | Complexity of Query Processing in Databases with OR-Objects | 1989 | PODS | 4.1905499e-05 |
| 2,972 | Integrating Information by Outerjoins and Full Disjunctions (Extended Abstract) | 1996 | PODS | 7.7933514e-05 |
| 8,076 | An Incremental Algorithm for Computing Ranked Full Disjunctions | 2005 | PODS | 4.587923e-05 |
| 3,929 | Maximally Joining Probabilistic Data | 2007 | PODS | 6.620459e-05 |
| 12,808 | Normalizing Incomplete Databases | 1995 | PODS | 4.1905499e-05 |
| 7,829 | Optimization of Multiple-Relation Multiple-Disjunct Queries | 1988 | PODS | 4.6373918e-05 |
| 7,722 | On the complexity of division and set joins in the relational algebra | 2005 | PODS | 4.6628934e-05 |
| 6,094 | Towards an Efficient Evaluation of General Queries: Quantifier and Disjunction Processing Revisited | 1989 | SIGMOD | 5.2099705e-05 |
| 912 | The Complexity of Evaluating Relational Queries | 1983 | PODS | 0.00015374685 |
| 5,137 | Full Disjunctions: Polynomial-Delay Iterators in Action | 2006 | VLDB | 5.6653126e-05 |