Database Paper Browser

Back to papers

Counting Database Repairs Entailing a Query: The Case of Functional Dependencies

Summary: Extends the FP/#P-complete dichotomy for counting repairs that entail a self-join-free CQ from primary keys to general functional dependencies, characterizing exact data complexity. Shows counting can be inapproximable under FDs, but FDs with a left-hand-side chain admit an FPRAS (an island of approximability). (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1841
Venue
PODS
Year
2022
Pagerank
4.5784634e-05
Overall Rank
8,132 | 43.43%
DOI
10.1145/3517804.3524147

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 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
627 Management of Probabilistic Data: Foundations and Challenges 2007 PODS 0.00018959005
5,360 Counting Database Repairs under Primary Keys Revisited 2019 PODS 5.5481038e-05
Previous Page 1 / 1 Next

Semantically Similar Papers