A Dichotomy on the Complexity of Consistent Query Answering for Atoms with Simple Keys
ICDT, pp. 165-176, 2014.
We study the problem of consistent query answering under primary key violations. In this setting, the relations in a database violate the key constraints and we are interested in maximal subsets of the database that satisfy the constraints, which we call repairs. For a boolean query Q, the problem CERTAINTY(Q) asks whether every such re...More
PPT (Upload PPT)