Full Disjunctions: Polynomial-Delay Iterators in Action
Summary: Introduces the first polynomial-delay iterator for full disjunctions, enabling pipelined tuple streaming with output-linear total runtime. A novel biconnected-component decomposition and selective outerjoins improve efficiency over prior algorithms and integrate with SQL. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Sara Cohen (Technion)
- 2. Itzhak Fadida (Technion)
- 3. Yaron Kanza (University of Toronto)
- 4. Benny Kimelfeld (Hebrew University)
- 5. Yehoshua Sagiv (Hebrew University)
BibTeX Citation
@article{cohen_vldb06,
title = {{Full Disjunctions: Polynomial-Delay Iterators in Action}},
author = {Cohen, Sara and Fadida, Itzhak and Kanza, Yaron and Kimelfeld, Benny and Sagiv, Yehoshua},
journal = {PVLDB},
series = {{VLDB} '06},
pages = {739--750},
year = {2006}
}Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,133 | Matching Twigs in Probabilistic XML | 2007 | VLDB | 7.6103114e-05 |
| 3,636 | Static Analysis and Optimization of Semantic Web Queries | 2012 | PODS | 7.1450443e-05 |
| 4,159 | Integrating Data Lake Tables | 2023 | VLDB | 6.7687144e-05 |
| 4,262 | Maximally Joining Probabilistic Data | 2007 | PODS | 6.6954238e-05 |
| 5,432 | Fast Shapley Value Computation in Data Assemblage Tasks as Cooperative Simple Games | 2024 | SIGMOD | 6.1310946e-05 |
| 8,202 | Counting and Enumerating (Preferred) Database Repairs | 2017 | PODS | 5.3774362e-05 |
| 9,527 | Efficiently Enumerating Minimal Triangulations | 2017 | PODS | 5.1666108e-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 |
|---|---|---|---|---|
| 1,057 | Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins | 1990 | SIGMOD | 0.00012226471 |
| 1,199 | Outerjoins as Disjunctions | 1994 | SIGMOD | 0.00011559895 |
| 2,853 | Integrating Information by Outerjoins and Full Disjunctions (Extended Abstract) | 1996 | PODS | 7.9375001e-05 |
| 3,699 | Canonical Abstraction for Outerjoin Optimization | 2004 | SIGMOD | 7.0832149e-05 |
| 8,241 | An Incremental Algorithm for Computing Ranked Full Disjunctions | 2005 | PODS | 5.3686457e-05 |
| 9,795 | Computing Full Disjunctions | 2003 | PODS | 5.1241373e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,138 | Optimization of Multi-Way Join Queries for Parallel Execution | 1991 | VLDB |
| 2 | 7,294 | Computing the Difference of Conjunctive Queries Efficiently | 2023 | SIGMOD |
| 3 | 7,616 | Computing Complex Temporal Join Queries Efficiently | 2022 | SIGMOD |
| 4 | 7,900 | On the complexity of division and set joins in the relational algebra | 2005 | PODS |
| 5 | 6,469 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS |
| 6 | 6,198 | Towards an Efficient Evaluation of General Queries: Quantifier and Disjunction Processing Revisited | 1989 | SIGMOD |
| 7 | 8,020 | Optimization of Multiple-Relation Multiple-Disjunct Queries | 1988 | PODS |
| 8 | 1,199 | Outerjoins as Disjunctions | 1994 | SIGMOD |
| 9 | 9,795 | Computing Full Disjunctions | 2003 | PODS |
| 10 | 8,241 | An Incremental Algorithm for Computing Ranked Full Disjunctions | 2005 | PODS |