Consistent Query Answering for Primary Keys

We study the complexity of consistent query answering with respect to primary key violations, for self-join-free conjunctive queries. A repair of a possibly inconsistent database is obtained by selecting a maximal number of tuples without selecting two distinct tuples with the same primary key value. For any Boolean query q, CERTAINTY(q) is the problem that takes a database as input, and asks whether q is true in every repair of the database. The complexity of this problem has been extensively studied for q ranging over the class of self-join-free Boolean conjunctive queries. A research challenge is to determine, given q, whether CERTAINTY(q) belongs to complexity classes FO, P, or coNP-complete. We show that for any self-join-free Boolean conjunctive query q, it can be decided whether or not CERTAINTY(q) is in FO. Further, CERTAINTY(q) is either in P or coNP-complete, and the complexity dichotomy is effective. This settles a research question of practical relevance that has been open for ten years.

[1]  Jef Wijsen,et al.  A Survey of the Data Complexity of Consistent Query Answering under Key Constraints , 2014, FoIKS.

[2]  Jef Wijsen,et al.  The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints , 2015, ACM Trans. Database Syst..

[3]  Jef Wijsen,et al.  On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databases , 2010, PODS '10.

[4]  Leonid Libkin,et al.  Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series) , 2004 .

[5]  Gaëlle Fontaine,et al.  Why is it Hard to Obtain a Dichotomy for Consistent Query Answering? , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[6]  Jef Wijsen,et al.  Counting Database Repairs that Satisfy Conjunctive Queries with Self-Joins , 2019, ICDT.

[7]  Sergio Greco,et al.  A Logical Framework for Querying and Repairing Inconsistent Databases , 2003, IEEE Trans. Knowl. Data Eng..

[8]  Phokion G. Kolaitis,et al.  Efficient Querying of Inconsistent Databases with Binary Integer Programming , 2013, Proc. VLDB Endow..

[9]  George J. Minty,et al.  On maximal independent sets of vertices in claw-free graphs , 1980, J. Comb. Theory B.

[10]  Leonid Libkin,et al.  Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.

[11]  Jef Wijsen,et al.  A dichotomy in the complexity of counting database repairs , 2013, J. Comput. Syst. Sci..

[12]  Catriel Beeri,et al.  On the Desirability of Acyclic Database Schemes , 1983, JACM.

[13]  Phokion G. Kolaitis,et al.  A dichotomy in the complexity of consistent query answering for queries with two atoms , 2012, Inf. Process. Lett..

[14]  Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24-28, 2014 , 2014, ICDT.

[15]  Leopoldo E. Bertossi,et al.  Database Repairing and Consistent Query Answering , 2011, Database Repairing and Consistent Query Answering.

[16]  Jan Chomicki,et al.  Hippo: A System for Computing Consistent Answers to a Class of SQL Queries , 2004, EDBT.

[17]  Renée J. Miller,et al.  First-order query rewriting for inconsistent databases , 2005, J. Comput. Syst. Sci..

[18]  Jan Chomicki,et al.  Consistent query answers in inconsistent databases , 1999, PODS '99.

[19]  Dan Suciu,et al.  A Dichotomy on the Complexity of Consistent Query Answering for Atoms with Simple Keys , 2012, ICDT.

[20]  Renée J. Miller,et al.  ConQuer: efficient management of inconsistent databases , 2005, SIGMOD '05.

[21]  Jef Wijsen,et al.  A remark on the complexity of consistent conjunctive query answering under primary key violations , 2010, Inf. Process. Lett..

[22]  Jef Wijsen,et al.  A Trichotomy in the Data Complexity of Certain Query Answering for Conjunctive Queries , 2015, ArXiv.

[23]  Andrei A. Bulatov,et al.  Complexity of conservative constraint satisfaction problems , 2011, TOCL.

[24]  Jef Wijsen,et al.  Certain conjunctive query answering in first-order logic , 2012, TODS.