Counting Problems over Incomplete Databases
Summary: Dichotomy for self-join-free CQs: classify poly-time vs #P-hard for two counting tasks over finite-domain incomplete DBs—counting completions vs counting valuations of labeled nulls. Counting completions is typically much harder (sometimes beyond #P and inapproximable); counting valuations lies in #P and admits an FPRAS; Codd-tables and equal-null domains lower complexity. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Marcelo Arenas (IMFD Chile; Pontifical Catholic University of Chile)
- 2. Pablo Barceló (IMFD Chile; Pontifical Catholic University of Chile)
- 3. Mikaël Monet (IMFD Chile)
BibTeX Citation
@inproceedings{arenas_pods20,
address = {New York, NY, USA},
series = {{PODS} '20},
title = {{Counting Problems over Incomplete Databases}},
url = {https://dl.acm.org/doi/10.1145/3375395.3387656},
doi = {10.1145/3375395.3387656},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Arenas, Marcelo and Barceló, Pablo and Monet, Mikaël},
year = {2020}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,741 | Probabilistic Databases for All | 2020 | PODS | 5.7866368e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 33 | Consistent Query Answers in Inconsistent Databases | 1999 | PODS | 0.00049907763 |
| 78 | ULDBs: Databases with Uncertainty and Lineage | 2006 | VLDB | 0.00036571789 |
| 2,565 | Database Repairs and Consistent Query Answering: Origins and Further Developments | 2019 | PODS | 8.4116912e-05 |
| 3,472 | Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation | 2019 | PODS | 7.3870922e-05 |
| 5,245 | Certain Answers Meet Zero-One Laws | 2018 | PODS | 6.3012734e-05 |
| 5,258 | Counting Database Repairs under Primary Keys Revisited | 2019 | PODS | 6.2967016e-05 |
| 5,271 | Incomplete Data: What Went Wrong, and How to Fix It | 2014 | PODS | 6.2907571e-05 |
| 5,513 | Foundations of Uncertain-Data Integration | 2010 | VLDB | 6.1909879e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,021 | Identifying the Extent of Completeness of Query Answers over Partially Complete Databases | 2015 | SIGMOD |
| 2 | 9,009 | Efficient Approximations of Conjunctive Queries | 2012 | PODS |
| 3 | 636 | Answering Conjunctive Queries under Updates | 2017 | PODS |
| 4 | 3,801 | On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates | 1998 | PODS |
| 5 | 4,495 | Queries with Incomplete Answers over Semistructured Data | 1999 | PODS |
| 6 | 633 | The Complexity of Querying Indefinite Data about Linearly Ordered Domains (Preliminary Version) | 1992 | PODS |
| 7 | 947 | On the Representation and Querying of Sets of Possible Worlds | 1987 | SIGMOD |
| 8 | 1,707 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS |
| 9 | 2,117 | Obtaining Complete Answers from Incomplete Databases | 1996 | VLDB |
| 10 | 1,467 | The Complexity of Evaluating Relational Queries | 1983 | PODS |