A Dichotomy for Non-repeating Queries with Negation in Probabilistic Databases
Summary: Extends Dalvi–Suciu dichotomy to non-repeating conjunctive queries with negation over tuple-independent probabilistic DBs, showing each has either PTIME or #P-hard data complexity. Tractable cases = hierarchical queries, decidable in PTIME. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Robert Fink
- 2. Dan Olteanu
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,169 | Approximate Lifted Inference with Probabilistic Databases | 2015 | VLDB | 5.1716068e-05 |
| 6,997 | Tractable Lineages on Treelike Instances: Limits and Extensions | 2016 | PODS | 4.8676446e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 74 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB | 0.00057857292 |
| 571 | The Complexity of Query Reliability | 1998 | PODS | 0.00019910719 |
| 627 | Management of Probabilistic Data: Foundations and Challenges | 2007 | PODS | 0.00018959005 |
| 1,268 | The Dichotomy of Conjunctive Queries on Probabilistic Structures | 2007 | PODS | 0.00012931993 |
| 2,728 | Secondary-Storage Confidence Computation for Conjunctive Queries with Inequalities | 2009 | SIGMOD | 8.2185032e-05 |
| 2,875 | MayBMS: A Probabilistic Database Management System | 2009 | SIGMOD | 7.9742313e-05 |
| 4,706 | Aggregation in Probabilistic Databases via Knowledge Compilation | 2012 | VLDB | 5.9820914e-05 |
| 5,057 | Queries with Guarded Negation | 2012 | VLDB | 5.7294436e-05 |
| 6,415 | Queries with Difference on Probabilistic Databases | 2011 | VLDB | 5.0731258e-05 |
Previous
Page 1 / 1
Next