Why is it Hard to Obtain a Dichotomy for Consistent Query Answering?

A database may for various reasons become inconsistent with respect to a given set of integrity constraints. To overcome the problem, a formal approach to querying such inconsistent databases has been proposed and since then, a lot of efforts have been spent to classify the complexity of consistent query answering under various classes of constraints. It is known that for the most common constraints and queries, the problem is in CONP and might be CONP-hard, yet several relevant tractable classes have been identified. Additionally, the results that emerged suggested that given a set of key constraints and a conjunctive query, the problem of consistent query answering is either in PTIME or is CONP-complete. However, despite all the work, as of today this dichotomy remains a conjecture. The main contribution of this paper is to explain why it appears so difficult to obtain a dichotomy result in the setting of consistent query answering. Namely, we prove that such a dichotomy w.r.t. common classes of constraints and queries, is harder to achieve than a dichotomy for the constraint satisfaction problem, which is a famous open problem since the 1990s.

[1]  Tomás Feder,et al.  Monotone monadic SNP and constraint satisfaction , 1993, STOC.

[2]  Ronald Fagin,et al.  Data exchange: semantics and query answering , 2003, Theor. Comput. Sci..

[3]  Catriel Beeri,et al.  A Proof Procedure for Data Dependencies , 1984, JACM.

[4]  Richard E. Ladner,et al.  On the Structure of Polynomial Time Reducibility , 1975, JACM.

[5]  Jan Chomicki,et al.  Consistent query answers in the presence of universal constraints , 2008, Inf. Syst..

[6]  Diego Calvanese,et al.  View-based query processing and constraint satisfaction , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[7]  Jan Chomicki,et al.  Declarative inconsistency handling in relational and semi-structured databases , 2007 .

[8]  FontaineGaëlle.  Why Is It Hard to Obtain a Dichotomy for Consistent Query Answering , 2015 .

[9]  Tomás Feder,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..

[10]  Maurizio Lenzerini,et al.  Data integration: a theoretical perspective , 2002, PODS.

[11]  Andrei A. Bulatov,et al.  A dichotomy theorem for constraint satisfaction problems on a 3-element set , 2006, JACM.

[12]  Libor Barto,et al.  The Dichotomy for Conservative Constraint Satisfaction Problems Revisited , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

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

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

[15]  Moshe Y. Vardi.  Constraint satisfaction and database theory: a tutorial , 2000, PODS.

[16]  Peter Jeavons,et al.  Constraint Satisfaction Problems and Finite Algebras , 2000, ICALP.

[17]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[18]  Phokion G. Kolaitis,et al.  Repair checking in inconsistent databases: algorithms and complexity , 2009, ICDT '09.

[19]  Marc Gyssens,et al.  Closure properties of constraints , 1997, JACM.

[20]  Marcelo Arenas,et al.  On the Decidability of Consistent Query Answering , 2010, AMW.

[21]  Marcelo Arenas,et al.  Relational and XML Data Exchange , 2010, Relational and XML Data Exchange.

[22]  Andrei A. Bulatov,et al.  Tractable conservative constraint satisfaction problems , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[23]  Jan Chomicki,et al.  Consistent Query Answering: Five Easy Pieces , 2007, ICDT.

[24]  Jan Chomicki,et al.  Minimal-change integrity maintenance using tuple deletions , 2002, Inf. Comput..

[25]  Gaëlle Fontaine.  Why Is It Hard to Obtain a Dichotomy for Consistent Query Answering? , 2015, TOCL.

[26]  Phokion G. Kolaitis,et al.  Conjunctive-query containment and constraint satisfaction , 1998, PODS.

[27]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[28]  Pedro Meseguer,et al.  Constraint Satisfaction Problems: An Overview , 1989, AI Commun..

[29]  Marcelo Arenas,et al.  Foundations of Data Exchange , 2014 .

[30]  Phokion G. Kolaitis,et al.  On the Data Complexity of Consistent Query Answering , 2012, ICDT '12.

[31]  Leopoldo E. Bertossi,et al.  Consistent query answering in databases , 2006, SGMD.

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