article

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

Authors:

Phokion G. Kolaitis,

Enela PemaAuthors Info & Claims

Information Processing Letters, Volume 112, Issue 3

Pages 77 - 85

https://doi.org/10.1016/j.ipl.2011.10.018

Published: 01 January 2012 Publication History

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.

References

[1]

M. Arenas, L. Bertossi, J. Chomicki, Consistent query answers in inconsistent databases, in: 18th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS¿99, 1999, pp. 68-79.

Digital Library

Google Scholar

[2]

M. Lenzerini, Data integration: A theoretical perspective, in: PODS, 2002, pp. 233-246.

Digital Library

Google Scholar

[3]

Chomicki, J. and Marcinkowski, J., Minimal-change integrity maintenance using tuple deletions. Inf. Comput. v197 i1/2. 90-121.

Digital Library

Google Scholar

[4]

First-order query rewriting for inconsistent databases. J. Comput. Syst. Sci. v73 i4. 610-635.

Digital Library

Google Scholar

[5]

Wijsen, J., A remark on the complexity of consistent conjunctive query answering under primary key violations. Inf. Process. Lett. v110 i21. 950-955.

Digital Library

Google Scholar

[6]

J. Wijsen, On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databases, in: PODS, 2010, pp. 179-190.

Digital Library

Google Scholar

[7]

F.N. Afrati, P.G. Kolaitis, Repair checking in inconsistent databases: algorithms and complexity, in: ICDT, 2009, pp. 31-41.

Digital Library

Google Scholar

[8]

Ladner, R.E., On the structure of polynomial time reducibility. J. ACM. v22 i1. 155-171.

Digital Library

Google Scholar

[9]

Beeri, C. and Bernstein, P.A., Computational problems related to the design of normal form relational schemas. ACM Trans. Database Syst. v4 i1. 30-59.

Digital Library

Google Scholar

[10]

Gold, E.M., Complexity of automaton identification from given data. Inform. and Control. v37 i3. 302-320.

Google Scholar

[11]

Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979. W.H. Freeman.

Digital Library

Google Scholar

[12]

Minty, G.J., On maximal independent sets of vertices in claw-free graphs. J. Comb. Theory Ser. B. v28 i3. 284-304.

Google Scholar

[13]

Arenas, M., Bertossi, L., Chomicki, J., He, X., Raghavan, V. and Spinrad, J., Scalar aggregation in inconsistent databases. Theoret. Comput. Sci. v296 i3.

Digital Library

Google Scholar

Cited By

View all

Koutris POuyang XWijsen J(2024)Consistent Query Answering for Primary Keys on Rooted Tree QueriesProceedings of the ACM on Management of Data10.1145/36511392:2(1-26)Online publication date: 14-May-2024
https://dl.acm.org/doi/10.1145/3651139
Padmanabha ASegoufin LSirangelo C(2024)A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-JoinProceedings of the ACM on Management of Data10.1145/36511372:2(1-15)Online publication date: 14-May-2024
https://dl.acm.org/doi/10.1145/3651137
Kimelfeld BKolaitis P(2024)A Unifying Framework for Incompleteness, Inconsistency, and Uncertainty in DatabasesCommunications of the ACM10.1145/362471767:3(74-83)Online publication date: 22-Feb-2024
https://dl.acm.org/doi/10.1145/3624717
Show More Cited By

Index Terms

A dichotomy in the complexity of consistent query answering for queries with two atoms
1. Information systems
  1. Data management systems
    1. Database design and models
    2. Database management system engines
      1. Database query processing
2. Theory of computation
  1. Design and analysis of algorithms
  2. Theory and algorithms for application domains
    1. Database theory
      1. Database query processing and optimization (theory)

Index terms have been assigned to the content through auto-classification.

Recommendations

On the tractability and intractability of consistent conjunctive query answering
PhD '11: Proceedings of the 2011 Joint EDBT/ICDT Ph.D. Workshop

The consistent query answering framework has received considerable attention since it was first introduced as an alternative to coping with inconsistent databases. The framework was defined based on two notions: repairs and consistent query answers. ...
A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join
PODS

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 ...
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. In the late 1990s, the formal approach of consistent query answering was proposed in order to query such databases. Since then, a lot of efforts ...

Comments

Information & Contributors

Information

Published In

Information Processing Letters Volume 112, Issue 3

January, 2012

51 pages

ISSN:0020-0190

Issue’s Table of Contents

Publisher

Elsevier North-Holland, Inc.

United States

Publication History

Published: 01 January 2012

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

32
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Koutris POuyang XWijsen J(2024)Consistent Query Answering for Primary Keys on Rooted Tree QueriesProceedings of the ACM on Management of Data10.1145/36511392:2(1-26)Online publication date: 14-May-2024
https://dl.acm.org/doi/10.1145/3651139
Padmanabha ASegoufin LSirangelo C(2024)A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-JoinProceedings of the ACM on Management of Data10.1145/36511372:2(1-15)Online publication date: 14-May-2024
https://dl.acm.org/doi/10.1145/3651137
Kimelfeld BKolaitis P(2024)A Unifying Framework for Incompleteness, Inconsistency, and Uncertainty in DatabasesCommunications of the ACM10.1145/362471767:3(74-83)Online publication date: 22-Feb-2024
https://dl.acm.org/doi/10.1145/3624717
Fan ZKoutris POuyang XWijsen J(2023)LinCQA: Faster Consistent Query Answering with Linear Time GuaranteesProceedings of the ACM on Management of Data10.1145/35887181:1(1-25)Online publication date: 30-May-2023
https://dl.acm.org/doi/10.1145/3588718
Koutris POuyang XWijsen JLibkin LPichler RGuagliardo P(2021)Consistent Query Answering for Primary Keys on Path QueriesProceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3452021.3458334(215-232)Online publication date: 20-Jun-2021
https://dl.acm.org/doi/10.1145/3452021.3458334
Feng SGlavic BHuber AKennedy OLi GLi ZIdreos SSrivastava D(2021)Efficient Uncertainty Tracking for Complex Queries with Attribute-level BoundsProceedings of the 2021 International Conference on Management of Data10.1145/3448016.3452791(528-540)Online publication date: 9-Jun-2021
https://dl.acm.org/doi/10.1145/3448016.3452791
Koutris PWijsen JSuciu DTao YWei Z(2020)First-Order Rewritability in Consistent Query Answering with Respect to Multiple KeysProceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3375395.3387654(113-129)Online publication date: 14-Jun-2020
https://dl.acm.org/doi/10.1145/3375395.3387654
Freire CGatterbauer WImmerman NMeliou ASuciu DTao YWei Z(2020)New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-JoinsProceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3375395.3387647(271-284)Online publication date: 14-Jun-2020
https://dl.acm.org/doi/10.1145/3375395.3387647
Feng SHuber AGlavic BKennedy OBoncz PManegold SAilamaki ADeshpande AKraska T(2019)Uncertainty Annotated Databases - A Lightweight Approach for Approximating Certain AnswersProceedings of the 2019 International Conference on Management of Data10.1145/3299869.3319887(1313-1330)Online publication date: 25-Jun-2019
https://dl.acm.org/doi/10.1145/3299869.3319887
Dixit ABoncz PManegold SAilamaki ADeshpande AKraska T(2019)CAvSATProceedings of the 2019 International Conference on Management of Data10.1145/3299869.3300095(1823-1825)Online publication date: 25-Jun-2019
https://dl.acm.org/doi/10.1145/3299869.3300095
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

On the tractability and intractability of consistent conjunctive query answering

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

Why Is It Hard to Obtain a Dichotomy for Consistent Query Answering?

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations