An Incremental Algorithm for Computing Ranked Full Disjunctions
Summary: Introduces IncrementalFD, an incremental algorithm for computing full disjunctions that reduces total runtime and offers lower cost for retrieving only k tuples (for any constant k). For a natural class of ranking functions it emits tuples in ranking order and supports block-based execution. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Sara Cohen
- 2. Yehoshua Sagiv
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 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,859 | Integrating Data Lake Tables | 2023 | VLDB | 5.8732433e-05 |
| 5,141 | Full Disjunctions: Polynomial-Delay Iterators in Action | 2006 | VLDB | 5.6673499e-05 |
| 7,770 | On the Complexity of Package Recommendation Problems | 2012 | PODS | 4.6562597e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 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 | Optimal Aggregation Algorithms for Middleware [Extended Abstract] | 2001 | PODS | 0.0015496097 |
| 552 | Supporting Incremental Join Queries on Ranked Inputs | 2001 | VLDB | 0.00020310903 |
| 602 | On the Complexity of Bounded-Variable Queries | 1995 | PODS | 0.00019352415 |
| 674 | Supporting Top-k Join Queries in Relational Databases | 2003 | VLDB | 0.00018327585 |
| 1,032 | Outerjoins as Disjunctions | 1994 | SIGMOD | 0.00014544529 |
| 2,393 | Rank-aware Query Optimization | 2004 | SIGMOD | 8.9016542e-05 |
| 2,966 | Integrating Information by Outerjoins and Full Disjunctions (Extended Abstract) | 1996 | PODS | 7.8002072e-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 |
|---|---|---|---|---|
| 8,966 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS | 4.4193184e-05 |
| 7,166 | Ranked Enumeration of Join Queries with Projections | 2022 | VLDB | 4.8124491e-05 |
| 12,191 | Efficient Rank Join with Aggregation Constraints | 2011 | VLDB | 4.1945683e-05 |
| 2,961 | Evaluating Rank Joins with Optimal Cost | 2008 | PODS | 7.8110394e-05 |
| 7,824 | Optimization of Multiple-Relation Multiple-Disjunct Queries | 1988 | PODS | 4.6418459e-05 |
| 9,511 | Computing Full Disjunctions | 2003 | PODS | 4.3340927e-05 |
| 3,715 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB | 6.8220943e-05 |
| 5,962 | Beyond Equi-joins: Ranking, Enumeration and Factorization | 2021 | VLDB | 5.2536266e-05 |
| 552 | Supporting Incremental Join Queries on Ranked Inputs | 2001 | VLDB | 0.00020310903 |
| 5,141 | Full Disjunctions: Polynomial-Delay Iterators in Action | 2006 | VLDB | 5.6673499e-05 |