Consistent Query Answering for Primary Keys in Logspace
ICDT 2019, Volume abs/1810.03386, 2019.
We study the complexity of consistent query answering on databases that may violate primary key constraints. A repair of such a database is any consistent database that can be obtained by deleting a minimal set of tuples. For every Boolean query q, CERTAINTY(q) is the problem that takes a database as input and asks whether q evaluates to ...More
Full Text (Upload PDF)
PPT (Upload PPT)