Computing Query Probability with Incidence Algebras
Summary: Applies Möbius inversion in incidence algebras to compute probabilities of unions of conjunctive queries over tuple-independent PDBs, yielding a simple PTIME algorithm for the class of “safe” queries and FP#P-hardness for all unsafe ones. Shows Möbius-based inclusion–exclusion can compute some safe queries despite unsafe subqueries and uses lattice-theoretic analysis to prove lifted-conditioning approaches are incomplete. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Nilesh Dalvi
- 2. Karl Schnaitter
- 3. Dan Suciu
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,864 | A Dichotomy in the Complexity of Deletion Propagation with Functional Dependencies | 2012 | PODS | 7.9964194e-05 |
| 4,256 | Multi-Tuple Deletion Propagation: Approximations and Complexity | 2013 | VLDB | 6.3063725e-05 |
| 4,722 | Read-Once Functions and Query Evaluation in Probabilistic Databases | 2010 | VLDB | 5.9646931e-05 |
| 5,270 | Probabilistic Databases with MarkoViews | 2012 | VLDB | 5.5925747e-05 |
| 6,410 | Queries with Difference on Probabilistic Databases | 2011 | VLDB | 5.0682868e-05 |
| 6,996 | Tractable Lineages on Treelike Instances: Limits and Extensions | 2016 | PODS | 4.8629707e-05 |
| 7,162 | Probabilistic Query Evaluation: The Combined FPRAS Landscape | 2023 | PODS | 4.8085863e-05 |
| 7,429 | Local Structure and Determinism in Probabilistic Databases | 2012 | SIGMOD | 4.7275942e-05 |
| 12,060 | Provenance-based Dictionary Refinement in Information Extraction | 2013 | SIGMOD | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 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.00057797415 |
| 572 | The Complexity of Query Reliability | 1998 | PODS | 0.00019888988 |
| 630 | Management of Probabilistic Data: Foundations and Challenges | 2007 | PODS | 0.00018942778 |
| 1,269 | The Dichotomy of Conjunctive Queries on Probabilistic Structures | 2007 | PODS | 0.00012911894 |
| 2,733 | Secondary-Storage Confidence Computation for Conjunctive Queries with Inequalities | 2009 | SIGMOD | 8.2106718e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,162 | Probabilistic Query Evaluation: The Combined FPRAS Landscape | 2023 | PODS | 4.8085863e-05 |
| 8,537 | A Query Engine for Probabilistic Preferences | 2018 | SIGMOD | 4.4893996e-05 |
| 74 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB | 0.00057797415 |
| 7,604 | Conjunctive Queries on Probabilistic Graphs: Combined Complexity | 2017 | PODS | 4.6944524e-05 |
| 4,722 | Read-Once Functions and Query Evaluation in Probabilistic Databases | 2010 | VLDB | 5.9646931e-05 |
| 8,539 | Querying Probabilistic Preferences in Databases | 2017 | PODS | 4.4893996e-05 |
| 9,654 | Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked Enumeration | 2021 | PODS | 4.3067693e-05 |
| 7,151 | Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases | 2020 | PODS | 4.8127652e-05 |
| 1,269 | The Dichotomy of Conjunctive Queries on Probabilistic Structures | 2007 | PODS | 0.00012911894 |
| 6,167 | Approximate Lifted Inference with Probabilistic Databases | 2015 | VLDB | 5.1725053e-05 |