2000 character limit reached
A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join (2309.12059v2)
Published 21 Sep 2023 in cs.DB
Abstract: 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.
- Consistent Query Answers in Inconsistent Databases. In Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 31 - June 2, 1999, Philadelphia, Pennsylvania, USA, Victor Vianu and Christos H. Papadimitriou (Eds.). ACM Press, 68–79. https://doi.org/10.1145/303976.303983
- Leopoldo E. Bertossi. 2019. Database Repairs and Consistent Query Answering: Origins and Further Developments. In Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2019, Amsterdam, The Netherlands, June 30 - July 5, 2019, Dan Suciu, Sebastian Skritek, and Christoph Koch (Eds.). ACM, 48–58. https://doi.org/10.1145/3294052.3322190
- A Simple Algorithm for Consistent Query Answering under Primary Keys. Submitted to a journal. A preliminary version was presented to ICDT 2023. CoRR abs/2301.08482 (2023). https://doi.org/10.48550/ARXIV.2301.08482
- John E. Hopcroft and Richard M. Karp. 1973. An n5/25/2{}^{\mbox{5/2}}start_FLOATSUPERSCRIPT 5/2 end_FLOATSUPERSCRIPT Algorithm for Maximum Matchings in Bipartite Graphs. SIAM J. Comput. 2, 4 (1973), 225–231. https://doi.org/10.1137/0202019
- Phokion G. Kolaitis and Enela Pema. 2012. A dichotomy in the complexity of consistent query answering for queries with two atoms. Inf. Process. Lett. 112, 3 (2012), 77–85. https://doi.org/10.1016/j.ipl.2011.10.018
- Consistent Query Answering for Primary Keys on Path Queries. In PODS’21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, Virtual Event, China, June 20-25, 2021, Leonid Libkin, Reinhard Pichler, and Paolo Guagliardo (Eds.). ACM, 215–232. https://doi.org/10.1145/3452021.3458334
- Paraschos Koutris and Jef Wijsen. 2017. Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints. ACM Trans. Database Syst. 42, 2 (2017), 9:1–9:45. https://doi.org/10.1145/3068334