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)

Paper ID: hf2a1fcec2000727f
Venue: PODS
Year: 2010
Pagerank: 7.4484242e-05
Overall Rank: 3,291 | 77.89%
DOI: 10.1145/1807085.1807113

Incoming Non-self Citations Over Time

Authors

1. Nilesh Dalvi (Yahoo)
2. Karl Schnaitter (University of California Santa Cruz)
3. Dan Suciu (University of Washington)

BibTeX Citation

@inproceedings{dalvi_pods10,
        address = {New York, NY, USA},
        series = {{PODS} '10},
        title = {{Computing Query Probability with Incidence Algebras}},
        url = {https://dl.acm.org/doi/10.1145/1807085.1807113},
        doi = {10.1145/1807085.1807113},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Dalvi, Nilesh and Schnaitter, Karl and Suciu, Dan},
        year = {2010}
}

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
4,323	Multi-Tuple Deletion Propagation: Approximations and Complexity	2013	VLDB	6.6628189e-05
4,390	Read-Once Functions and Query Evaluation in Probabilistic Databases	2010	VLDB	6.6197307e-05
4,766	Probabilistic Databases with MarkoViews	2012	VLDB	6.424681e-05
5,994	A Dichotomy in the Complexity of Deletion Propagation with Functional Dependencies	2012	PODS	5.9198073e-05
6,657	Queries with Difference on Probabilistic Databases	2011	VLDB	5.7169618e-05
7,431	Local Structure and Determinism in Probabilistic Databases	2012	SIGMOD	5.528036e-05
7,470	Probabilistic Query Evaluation: The Combined FPRAS Landscape	2023	PODS	5.5173503e-05
7,801	Tractable Lineages on Treelike Instances: Limits and Extensions	2016	PODS	5.4489473e-05
12,547	Provenance-based Dictionary Refinement in Information Extraction	2013	SIGMOD	4.9769913e-05

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
51	Efficient Query Evaluation on Probabilistic Databases	2004	VLDB	0.00042926566
587	Management of Probabilistic Data: Foundations and Challenges	2007	PODS	0.00015927027
660	The Complexity of Query Reliability	1998	PODS	0.00015045167
1,066	The Dichotomy of Conjunctive Queries on Probabilistic Structures	2007	PODS	0.00012194105
2,859	Secondary-Storage Confidence Computation for Conjunctive Queries with Inequalities	2009	SIGMOD	7.9303364e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	7,470	Probabilistic Query Evaluation: The Combined FPRAS Landscape	2023	PODS
2	8,914	A Query Engine for Probabilistic Preferences	2018	SIGMOD
3	51	Efficient Query Evaluation on Probabilistic Databases	2004	VLDB
4	7,862	Conjunctive Queries on Probabilistic Graphs: Combined Complexity	2017	PODS
5	4,390	Read-Once Functions and Query Evaluation in Probabilistic Databases	2010	VLDB
6	8,916	Querying Probabilistic Preferences in Databases	2017	PODS
7	10,012	Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked Enumeration	2021	PODS
8	7,575	Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases	2020	PODS
9	1,066	The Dichotomy of Conjunctive Queries on Probabilistic Structures	2007	PODS
10	5,342	Approximate Lifted Inference with Probabilistic Databases	2015	VLDB