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,978 | Matching Twigs in Probabilistic XML | 2007 | VLDB | 7.7845728e-05 |
| 3,929 | Maximally Joining Probabilistic Data | 2007 | PODS | 6.6248763e-05 |
| 4,251 | Static Analysis and Optimization of Semantic Web Queries | 2012 | PODS | 6.3235328e-05 |
| 4,859 | Integrating Data Lake Tables | 2023 | VLDB | 5.8732433e-05 |
| 6,262 | Fast Shapley Value Computation in Data Assemblage Tasks as Cooperative Simple Games | 2024 | SIGMOD | 5.1349507e-05 |
| 7,702 | Counting and Enumerating (Preferred) Database Repairs | 2017 | PODS | 4.6736471e-05 |
| 9,091 | Efficiently Enumerating Minimal Triangulations | 2017 | PODS | 4.39823e-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 |
|---|---|---|---|---|
| 901 | Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins | 1990 | SIGMOD | 0.00015487777 |
| 1,032 | Outerjoins as Disjunctions | 1994 | SIGMOD | 0.00014544529 |
| 2,966 | Integrating Information by Outerjoins and Full Disjunctions (Extended Abstract) | 1996 | PODS | 7.8002072e-05 |
| 3,850 | Canonical Abstraction for Outerjoin Optimization | 2004 | SIGMOD | 6.7059122e-05 |
| 8,072 | An Incremental Algorithm for Computing Ranked Full Disjunctions | 2005 | PODS | 4.5922874e-05 |
| 9,511 | Computing Full Disjunctions | 2003 | PODS | 4.3340927e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,044 | Optimization of Multi-Way Join Queries for Parallel Execution | 1991 | VLDB | 9.6953608e-05 |
| 7,162 | Computing the Difference of Conjunctive Queries Efficiently | 2023 | SIGMOD | 4.8132423e-05 |
| 8,159 | Computing Complex Temporal Join Queries Efficiently | 2022 | SIGMOD | 4.5729025e-05 |
| 7,724 | On the complexity of division and set joins in the relational algebra | 2005 | PODS | 4.6673705e-05 |
| 8,966 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS | 4.4193184e-05 |
| 6,090 | Towards an Efficient Evaluation of General Queries: Quantifier and Disjunction Processing Revisited | 1989 | SIGMOD | 5.2148332e-05 |
| 7,824 | Optimization of Multiple-Relation Multiple-Disjunct Queries | 1988 | PODS | 4.6418459e-05 |
| 1,032 | Outerjoins as Disjunctions | 1994 | SIGMOD | 0.00014544529 |
| 9,511 | Computing Full Disjunctions | 2003 | PODS | 4.3340927e-05 |
| 8,072 | An Incremental Algorithm for Computing Ranked Full Disjunctions | 2005 | PODS | 4.5922874e-05 |