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,857 | A Dichotomy in the Complexity of Deletion Propagation with Functional Dependencies | 2012 | PODS | 8.0037703e-05 |
| 4,260 | Multi-Tuple Deletion Propagation: Approximations and Complexity | 2013 | VLDB | 6.3124474e-05 |
| 4,720 | Read-Once Functions and Query Evaluation in Probabilistic Databases | 2010 | VLDB | 5.973811e-05 |
| 5,266 | Probabilistic Databases with MarkoViews | 2012 | VLDB | 5.5972559e-05 |
| 6,415 | Queries with Difference on Probabilistic Databases | 2011 | VLDB | 5.0731258e-05 |
| 6,997 | Tractable Lineages on Treelike Instances: Limits and Extensions | 2016 | PODS | 4.8676446e-05 |
| 7,163 | Probabilistic Query Evaluation: The Combined FPRAS Landscape | 2023 | PODS | 4.8132033e-05 |
| 7,434 | Local Structure and Determinism in Probabilistic Databases | 2012 | SIGMOD | 4.7314358e-05 |
| 12,052 | Provenance-based Dictionary Refinement in Information Extraction | 2013 | SIGMOD | 4.1945683e-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.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 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,163 | Probabilistic Query Evaluation: The Combined FPRAS Landscape | 2023 | PODS | 4.8132033e-05 |
| 8,538 | A Query Engine for Probabilistic Preferences | 2018 | SIGMOD | 4.4937074e-05 |
| 74 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB | 0.00057857292 |
| 7,601 | Conjunctive Queries on Probabilistic Graphs: Combined Complexity | 2017 | PODS | 4.698961e-05 |
| 4,720 | Read-Once Functions and Query Evaluation in Probabilistic Databases | 2010 | VLDB | 5.973811e-05 |
| 8,541 | Querying Probabilistic Preferences in Databases | 2017 | PODS | 4.4937074e-05 |
| 9,653 | Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked Enumeration | 2021 | PODS | 4.3109001e-05 |
| 7,149 | Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases | 2020 | PODS | 4.8173876e-05 |
| 1,268 | The Dichotomy of Conjunctive Queries on Probabilistic Structures | 2007 | PODS | 0.00012931993 |
| 6,169 | Approximate Lifted Inference with Probabilistic Databases | 2015 | VLDB | 5.1716068e-05 |