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 (University of Oxford)
- 2. Dan Olteanu (LogicBlox Incorporated; University of Oxford)
BibTeX Citation
@inproceedings{fink_pods14,
address = {New York, NY, USA},
series = {{PODS} '14},
title = {{A Dichotomy for Non-repeating Queries with Negation in Probabilistic Databases}},
url = {https://dl.acm.org/doi/10.1145/2594538.2594549},
doi = {10.1145/2594538.2594549},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Fink, Robert and Olteanu, Dan},
year = {2014}
}
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,225 | Approximate Lifted Inference with Probabilistic Databases | 2015 | VLDB | 6.310093e-05 |
| 7,640 | Tractable Lineages on Treelike Instances: Limits and Extensions | 2016 | PODS | 5.5766474e-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 |
|---|---|---|---|---|
| 50 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB | 0.00043596705 |
| 574 | Management of Probabilistic Data: Foundations and Challenges | 2007 | PODS | 0.00016278855 |
| 644 | The Complexity of Query Reliability | 1998 | PODS | 0.00015367965 |
| 1,041 | The Dichotomy of Conjunctive Queries on Probabilistic Structures | 2007 | PODS | 0.00012453494 |
| 2,775 | MayBMS: A Probabilistic Database Management System | 2009 | SIGMOD | 8.1359291e-05 |
| 2,831 | Secondary-Storage Confidence Computation for Conjunctive Queries with Inequalities | 2009 | SIGMOD | 8.0788784e-05 |
| 4,098 | Aggregation in Probabilistic Databases via Knowledge Compilation | 2012 | VLDB | 6.9035475e-05 |
| 4,163 | Queries with Guarded Negation | 2012 | VLDB | 6.8603553e-05 |
| 6,527 | Queries with Difference on Probabilistic Databases | 2011 | VLDB | 5.8509088e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,819 | Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked Enumeration | 2021 | PODS |
| 2 | 7,317 | Probabilistic Query Evaluation: The Combined FPRAS Landscape | 2023 | PODS |
| 3 | 4,098 | Aggregation in Probabilistic Databases via Knowledge Compilation | 2012 | VLDB |
| 4 | 644 | The Complexity of Query Reliability | 1998 | PODS |
| 5 | 7,851 | A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries | 2021 | PODS |
| 6 | 2,831 | Secondary-Storage Confidence Computation for Conjunctive Queries with Inequalities | 2009 | SIGMOD |
| 7 | 1,707 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS |
| 8 | 7,706 | Conjunctive Queries on Probabilistic Graphs: Combined Complexity | 2017 | PODS |
| 9 | 4,301 | Read-Once Functions and Query Evaluation in Probabilistic Databases | 2010 | VLDB |
| 10 | 1,041 | The Dichotomy of Conjunctive Queries on Probabilistic Structures | 2007 | PODS |