A dichotomy in the complexity of consistent query answering for queries with two atoms

Authors:
Phokion G. Kolaitis;Enela Pema
Affiliations:
Computer Science Department, University of California Santa Cruz, Santa Cruz, CA 95064, USA;Computer Science Department, University of California Santa Cruz, Santa Cruz, CA 95064, USA
Venue:
Information Processing Letters
Year:
2012

Citing 8
Cited 7

Consistent query answers in inconsistent databases

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computational problems related to the design of normal form relational schemas

ACM Transactions on Database Systems (TODS)
On the Structure of Polynomial Time Reducibility

Journal of the ACM (JACM)
Data integration: a theoretical perspective

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Scalar aggregation in inconsistent databases

Theoretical Computer Science - Database theory
First-order query rewriting for inconsistent databases

Journal of Computer and System Sciences
Repair checking in inconsistent databases: algorithms and complexity

Proceedings of the 12th International Conference on Database Theory
On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databases

Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Certain conjunctive query answering in first-order logic

ACM Transactions on Database Systems (TODS)
On the data complexity of consistent query answering

Proceedings of the 15th International Conference on Database Theory
Certain conjunctive query answering in SQL

SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Charting the tractability frontier of certain conjunctive query answering

Proceedings of the 32nd symposium on Principles of database systems
A dichotomy in the complexity of counting database repairs

Journal of Computer and System Sciences
Efficient querying of inconsistent databases with binary integer programming

Proceedings of the VLDB Endowment
Why is it Hard to Obtain a Dichotomy for Consistent Query Answering?

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

We establish a dichotomy in the complexity of computing the consistent answers of a Boolean conjunctive query with exactly two atoms and without self-joins. Specifically, we show that the problem of computing the consistent answers of such a query either is in P or it is coNP-complete. Moreover, we give an efficiently checkable criterion for determining which of these two possibilities holds for a given query.