skip to main content
10.1145/3196959.3196982acmconferencesArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
research-article

Consistent Query Answering for Primary Keys and Conjunctive Queries with Negated Atoms

Published: 27 May 2018 Publication History

Abstract

This paper studies query answering on databases that may be inconsistent with respect to primary key constraints. A repair is any consistent database that is obtained by deleting a minimal set of tuples. Given a Boolean query q, the problem CERTAINTY(q) takes a database as input and asks whether q is true in every repair of the database. A significant complexity classification task is to determine, given q, whether CERTAINTY(q) is first-order definable (and thus solvable by a single SQL query). This problem has been extensively studied for self-join-free conjunctive queries. An important extension of this class of queries is to allow negated atoms. It turns out that if negated atoms are allowed, CERTAINTY(q) can express some classical matching problems. This paper studies the existence and construction of first-order definitions for CERTAINTY(q) for q in the class of self-join-free conjunctive queries with negated atoms.

References

[1]
Marcelo Arenas, Leopoldo E. Bertossi, and Jan Chomicki. 1999. Consistent Query Answers in Inconsistent Databases 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.
[2]
Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki, Xin He, Vijay Raghavan, and Jeremy P. Spinrad. 2003. Scalar aggregation in inconsistent databases. Theor. Comput. Sci. Vol. 296, 3 (2003), 405--434.
[3]
Vince Bárány, Balder ten Cate, and Luc Segoufin. 2015. Guarded Negation. J. ACM Vol. 62, 3 (2015), 22:1--22:26.
[4]
Leopoldo E. Bertossi. 2011. Database Repairing and Consistent Query Answering. Morgan & Claypool Publishers.
[5]
Meghyn Bienvenu, Camille Bourgaux, and Franccois Goasdoué. 2016. Explaining Inconsistency-Tolerant Query Answering over Description Logic Knowledge Bases. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, February 12--17, 2016, Phoenix, Arizona, USA., Dale Schuurmans and Michael P. Wellman (Eds.). AAAI Press, 900--906. http://www.aaai.org/ocs/index.php/AAAI/AAAI16/paper/view/12025
[6]
Andrei A. Bulatov. 2011. Complexity of conservative constraint satisfaction problems. ACM Trans. Comput. Log. Vol. 12, 4 (2011), 24:1--24:66.
[7]
Ashok K. Chandra, Larry J. Stockmeyer, and Uzi Vishkin. 1984. Constant Depth Reducibility. SIAM J. Comput. Vol. 13, 2 (1984), 423--439.
[8]
Stephen A. Cook and Pierre McKenzie. 1987. Problems Complete for Deterministic Logarithmic Space. J. Algorithms Vol. 8, 3 (1987), 385--394.
[9]
Stephen A. Fenner, Rohit Gurjar, and Thomas Thierauf. 2016. Bipartite perfect matching is in quasi-NC. In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18--21, 2016, Daniel Wichs and Yishay Mansour (Eds.). ACM, 754--763.
[10]
Stephen A. Fenner, Rohit Gurjar, and Thomas Thierauf. 2017. Guest Column: Parallel Algorithms for Perfect Matching. SIGACT News Vol. 48, 1 (2017), 102--109.
[11]
Gaëlle Fontaine. 2013. Why is it Hard to Obtain a Dichotomy for Consistent Query Answering? 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25--28, 2013. IEEE Computer Society, 550--559.
[12]
Ariel Fuxman and Renée J. Miller. 2007. First-order query rewriting for inconsistent databases. J. Comput. Syst. Sci. Vol. 73, 4 (2007), 610--635.
[13]
V'ıctor Gutiérrez-Basulto, Yazmin Angélica Ibá nez-Garc'ıa, and Roman Kontchakov. 2012. An Update on Query Answering with Restricted Forms of Negation Web Reasoning and Rule Systems - 6th International Conference, RR 2012, Vienna, Austria, September 10--12, 2012. Proceedings (Lecture Notes in Computer Science), Markus Krötzsch and Umberto Straccia (Eds.), Vol. Vol. 7497. Springer, 75--89.
[14]
Philip Hall. 1935. On Representatives of Subsets. J. London Math. Soc. Vol. 10, 1 (1935), 26--30.
[15]
Phokion G. Kolaitis and Enela Pema. 2012. A dichotomy in the complexity of consistent query answering for queries with two atoms. Inf. Process. Lett. Vol. 112, 3 (2012), 77--85.
[16]
Phokion G. Kolaitis, Enela Pema, and Wang-Chiew Tan. 2013. Efficient Querying of Inconsistent Databases with Binary Integer Programming. PVLDB Vol. 6, 6 (2013), 397--408. http://www.vldb.org/pvldb/vol6/p397-tan.pdf
[17]
Paraschos Koutris and Dan Suciu. 2014. A Dichotomy on the Complexity of Consistent Query Answering for Atoms with Simple Keys, See citeNDBLP:conf/icdt/2014, 165--176.
[18]
Paraschos Koutris and Jef Wijsen. 2015. The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints. In Proceedings of the 34th ACM Symposium on Principles of Database Systems, PODS 2015, Melbourne, Victoria, Australia, May 31 - June 4, 2015, Tova Milo and Diego Calvanese (Eds.). ACM, 17--29.
[19]
Paraschos Koutris and Jef Wijsen. 2017. Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints. ACM Trans. Database Syst. Vol. 42, 2 (2017), 9:1--9:45.
[20]
Domenico Lembo, Maurizio Lenzerini, Riccardo Rosati, Marco Ruzzi, and Domenico Fabio Savo. 2015. Inconsistency-tolerant query answering in ontology-based data access. J. Web Sem. Vol. 33 (2015), 3--29.
[21]
Thomas Lukasiewicz, Maria Vanina Martinez, Andreas Pieris, and Gerardo I. Simari. 2015. From Classical to Consistent Query Answering under Existential Rules Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25--30, 2015, Austin, Texas, USA., Blai Bonet and Sven Koenig (Eds.). AAAI Press, 1546--1552. http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9817
[22]
Carsten Lutz and Frank Wolter. 2015. On the Relationship between Consistent Query Answering and Constraint Satisfaction Problems. In 18th International Conference on Database Theory, ICDT 2015, March 23--27, 2015, Brussels, Belgium (LIPIcs), Marcelo Arenas and Martın Ugarte (Eds.), Vol. Vol. 31. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 363--379.
[23]
Marco Manna, Francesco Ricca, and Giorgio Terracina. 2015. Taming primary key violations to query large inconsistent data via ASP. TPLP Vol. 15, 4--5 (2015), 696--710.
[24]
Mónica Caniupán Marileo and Leopoldo E. Bertossi. 2007. The Consistency Extractor System: Querying Inconsistent Databases Using Answer Set Programs. In Scalable Uncertainty Management, First International Conference, SUM 2007, Washington, DC, USA, October 10--12, 2007, Proceedings (Lecture Notes in Computer Science), Henri Prade and V. S. Subrahmanian (Eds.), Vol. Vol. 4772. Springer, 74--88.
[25]
Dany Maslowski and Jef Wijsen. 2013. A dichotomy in the complexity of counting database repairs. J. Comput. Syst. Sci. Vol. 79, 6 (2013), 958--983.
[26]
Dany Maslowski and Jef Wijsen. 2014. Counting Database Repairs that Satisfy Conjunctive Queries with Self-Joins, See citeNDBLP:conf/icdt/2014, 155--164.
[27]
Nicole Schweikardt, Vassilis Christophides, and Vincent Leroy (Eds.). 2014. Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24--28, 2014. OpenProceedings.org. http://openproceedings.org/edbticdt2014/ICDT_toc.html
[28]
Jef Wijsen. 2010. On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databases. In Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2010, June 6--11, 2010, Indianapolis, Indiana, USA, Jan Paredaens and Dirk Van Gucht (Eds.). ACM, 179--190.
[29]
Jef Wijsen. 2012. Certain conjunctive query answering in first-order logic. ACM Trans. Database Syst. Vol. 37, 2 (2012), 9:1--9:35.

Cited By

View all
  • (2024)Naive Bayes classifiers over missing dataProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3692227(3913-3934)Online publication date: 21-Jul-2024
  • (2024)Computing Range Consistent Answers to Aggregation Queries via RewritingProceedings of the ACM on Management of Data10.1145/36958362:5(1-19)Online publication date: 7-Nov-2024
  • (2024)Approximately Counting Answers to Conjunctive Queries with Disequalities and NegationsACM Transactions on Algorithms10.1145/368963421:1(1-29)Online publication date: 23-Aug-2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PODS '18: Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
May 2018
462 pages
ISBN:9781450347068
DOI:10.1145/3196959
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 May 2018

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. conjunctive queries
  2. consistent query answering
  3. negation
  4. primary keys

Qualifiers

  • Research-article

Conference

SIGMOD/PODS '18
Sponsor:

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)6
  • Downloads (Last 6 weeks)0
Reflects downloads up to 17 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Naive Bayes classifiers over missing dataProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3692227(3913-3934)Online publication date: 21-Jul-2024
  • (2024)Computing Range Consistent Answers to Aggregation Queries via RewritingProceedings of the ACM on Management of Data10.1145/36958362:5(1-19)Online publication date: 7-Nov-2024
  • (2024)Approximately Counting Answers to Conjunctive Queries with Disequalities and NegationsACM Transactions on Algorithms10.1145/368963421:1(1-29)Online publication date: 23-Aug-2024
  • (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
  • (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
  • (2022)Approximately Counting Answers to Conjunctive Queries with Disequalities and NegationsProceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3517804.3526231(315-324)Online publication date: 12-Jun-2022
  • (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
  • (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
  • (2020)Optimization of Answer Set Programs for Consistent Query Answering by Means of First-Order RewritingProceedings of the 29th ACM International Conference on Information & Knowledge Management10.1145/3340531.3411911(25-34)Online publication date: 19-Oct-2020
  • (2020)Consistent Query Answering for Primary Keys in DatalogTheory of Computing Systems10.1007/s00224-020-09985-6Online publication date: 30-Jun-2020
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media