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,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 |
| 7,768 | On the Complexity of Package Recommendation Problems | 2012 | PODS | 4.6523419e-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 |
|---|---|---|---|---|
| 8 | Optimal Aggregation Algorithms for Middleware [Extended Abstract] | 2001 | PODS | 0.0015436578 |
| 551 | Supporting Incremental Join Queries on Ranked Inputs | 2001 | VLDB | 0.00020310856 |
| 603 | On the Complexity of Bounded-Variable Queries | 1995 | PODS | 0.00019334592 |
| 673 | Supporting Top-k Join Queries in Relational Databases | 2003 | VLDB | 0.00018325667 |
| 1,034 | Outerjoins as Disjunctions | 1994 | SIGMOD | 0.00014532543 |
| 2,249 | Rank-aware Query Optimization | 2004 | SIGMOD | 9.1956569e-05 |
| 2,972 | Integrating Information by Outerjoins and Full Disjunctions (Extended Abstract) | 1996 | PODS | 7.7933514e-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 |
|---|---|---|---|---|
| 8,972 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS | 4.4150824e-05 |
| 7,165 | Ranked Enumeration of Join Queries with Projections | 2022 | VLDB | 4.807833e-05 |
| 12,199 | Efficient Rank Join with Aggregation Constraints | 2011 | VLDB | 4.1905499e-05 |
| 2,965 | Evaluating Rank Joins with Optimal Cost | 2008 | PODS | 7.8049517e-05 |
| 7,829 | Optimization of Multiple-Relation Multiple-Disjunct Queries | 1988 | PODS | 4.6373918e-05 |
| 9,512 | Computing Full Disjunctions | 2003 | PODS | 4.3299485e-05 |
| 3,702 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB | 6.8251643e-05 |
| 5,963 | Beyond Equi-joins: Ranking, Enumeration and Factorization | 2021 | VLDB | 5.2485815e-05 |
| 551 | Supporting Incremental Join Queries on Ranked Inputs | 2001 | VLDB | 0.00020310856 |
| 5,137 | Full Disjunctions: Polynomial-Delay Iterators in Action | 2006 | VLDB | 5.6653126e-05 |