A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join

09/21/2023
by   Anantha Padmanabha, et al.
0

We consider the dichotomy conjecture for consistent query answering under primary key constraints. It states that, for every fixed Boolean conjunctive query q, testing whether q is certain (i.e. whether it evaluates to true over all repairs of a given inconsistent database) is either polynomial time or coNP-complete. This conjecture has been verified for self-join-free and path queries. We show that it also holds for queries with two atoms.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset