Database Paper Browser

Back to papers

Dichotomies in the Complexity of Preferred Repairs

Summary: Shows a dichotomy for globally‑optimal preferred repairs under functional dependencies: for any fixed schema repair‑checking is either in P or coNP‑complete, with tractability exactly when each relation's FDs are equivalent to a single FD or two key constraints. Provides a polynomial‑time test to distinguish the cases and a separate, different dichotomy when preferences may relate non‑conflicting facts. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1647
Venue
PODS
Year
2015
Pagerank
7.669374e-05
Overall Rank
3,042 | 78.84%
DOI
10.1145/2745754.2745762

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

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.

Previous Page 1 / 1 Next

Semantically Similar Papers