Full Disjunctions: Polynomial-Delay Iterators in Action
Summary: Full disjunctions over arbitrary relations; a polynomial-delay streaming iterator for results. Biconnected-component decomposition with per-component iterators and selective outerjoins yields linear total time in output and strong SQL integration. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Sara Cohen
- 2. Itzhak Fadida
- 3. Yaron Kanza
- 4. Benny Kimelfeld
- 5. Yehoshua Sagiv
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 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,201 | Static Analysis and Optimization of Semantic Web Queries | 2012 | PODS | 6.3588034e-05 |
| 4,860 | Integrating Data Lake Tables | 2023 | VLDB | 5.867964e-05 |
| 6,262 | Fast Shapley Value Computation in Data Assemblage Tasks as Cooperative Simple Games | 2024 | SIGMOD | 5.1300221e-05 |
| 7,701 | Counting and Enumerating (Preferred) Database Repairs | 2017 | PODS | 4.6690279e-05 |
| 9,088 | Efficiently Enumerating Minimal Triangulations | 2017 | PODS | 4.3940132e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 898 | Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins | 1990 | SIGMOD | 0.00015476243 |
| 1,034 | Outerjoins as Disjunctions | 1994 | SIGMOD | 0.00014532543 |
| 2,972 | Integrating Information by Outerjoins and Full Disjunctions (Extended Abstract) | 1996 | PODS | 7.7933514e-05 |
| 3,849 | Canonical Abstraction for Outerjoin Optimization | 2004 | SIGMOD | 6.7000711e-05 |
| 8,076 | An Incremental Algorithm for Computing Ranked Full Disjunctions | 2005 | PODS | 4.587923e-05 |
| 9,512 | Computing Full Disjunctions | 2003 | PODS | 4.3299485e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,051 | Optimization of Multi-Way Join Queries for Parallel Execution | 1991 | VLDB | 9.6871984e-05 |
| 7,161 | Computing the Difference of Conjunctive Queries Efficiently | 2023 | SIGMOD | 4.8086254e-05 |
| 8,163 | Computing Complex Temporal Join Queries Efficiently | 2022 | SIGMOD | 4.5685178e-05 |
| 8,972 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS | 4.4150824e-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 |
| 7,829 | Optimization of Multiple-Relation Multiple-Disjunct Queries | 1988 | PODS | 4.6373918e-05 |
| 1,034 | Outerjoins as Disjunctions | 1994 | SIGMOD | 0.00014532543 |
| 9,512 | Computing Full Disjunctions | 2003 | PODS | 4.3299485e-05 |
| 8,076 | An Incremental Algorithm for Computing Ranked Full Disjunctions | 2005 | PODS | 4.587923e-05 |