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
- 2. Pablo Barceló
- 3. Mikaël Monet
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,683 | Probabilistic Databases for All | 2020 | PODS | 4.9638979e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 49 | Consistent Query Answers in Inconsistent Databases | 1999 | PODS | 0.00067660624 |
| 101 | ULDBs: Databases with Uncertainty and Lineage | 2006 | VLDB | 0.0004955674 |
| 2,293 | Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation | 2019 | PODS | 9.0899933e-05 |
| 2,566 | Database Repairs and Consistent Query Answering: Origins and Further Developments | 2019 | PODS | 8.5243847e-05 |
| 5,360 | Counting Database Repairs under Primary Keys Revisited | 2019 | PODS | 5.5481038e-05 |
| 5,494 | Incomplete Data: What Went Wrong, and How to Fix It | 2014 | PODS | 5.4759469e-05 |
| 5,548 | Foundations of Uncertain-Data Integration | 2010 | VLDB | 5.4446854e-05 |
Previous
Page 1 / 1
Next