research-article

First-Order Rewritability in Consistent Query Answering with Respect to Multiple Keys

Authors:

Paraschos Koutris,

Jef WijsenAuthors Info & Claims

PODS'20: Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

Pages 113 - 129

https://doi.org/10.1145/3375395.3387654

Published: 14 June 2020 Publication History

Abstract

We study consistent query answering with respect to key dependencies. Given a (possibly inconsistent) database instance and a set of key dependencies, a repair is an inclusion-maximal subinstance that satisfies all key dependencies. Consistent query answering for a Boolean query is the following problem: given a database instance as input, is the query true in every repair? In [Koutris and Wijsen, ICDT 2019], it was shown that for every self-join-free Boolean conjunctive query and set of key dependencies containing exactly one key dependency per relation name (also called the primary key), this problem is in FO, L-complete, or coNP-complete, and it is decidable which of the three cases applies. In this paper, we consider the more general case where a relation name can be associated with more than one key dependency. It is shown that in this more general setting, it remains decidable whether or not the above problem is in FO, for self-join-free Boolean conjunctive queries. Moreover, it is possible to effectively construct a first-order query that solves the problem whenever such a query exists.

References

[1]

Marcelo Arenas, Leopoldo E. Bertossi, and Jan Chomicki. 1999. 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

Digital Library

[2]

Leopoldo E. Bertossi. 2011. Database Repairing and Consistent Query Answering .Morgan & Claypool Publishers. https://doi.org/10.2200/S00379ED1V01Y201108DTM020

[3]

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

Digital Library

[4]

Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, and Riccardo Rosati. 2007. Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family. J. Autom. Reasoning, Vol. 39, 3 (2007), 385--429. https://doi.org/10.1007/s10817-007--9078-x

Digital Library

[5]

Ashok K. Chandra, Larry J. Stockmeyer, and Uzi Vishkin. 1984. Constant Depth Reducibility. SIAM J. Comput., Vol. 13, 2 (1984), 423--439. https://doi.org/10.1137/0213028

[6]

Stephen A. Cook and Pierre McKenzie. 1987. Problems Complete for Deterministic Logarithmic Space. J. Algorithms, Vol. 8, 3 (1987), 385--394. https://doi.org/10.1016/0196--6774(87)90018--6

Digital Library

[7]

Jan Van den Bussche and Marcelo Arenas (Eds.). 2018. Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, Houston, TX, USA, June 10--15, 2018. ACM. https://doi.org/10.1145/3196959

Digital Library

[8]

Akhil A. Dixit and Phokion G. Kolaitis. 2019. A SAT-Based System for Consistent Query Answering. In Theory and Applications of Satisfiability Testing - SAT 2019 - 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9--12, 2019, Proceedings (Lecture Notes in Computer Science), Mikolá s Janota and Inê s Lynce (Eds.), Vol. 11628. Springer, 117--135. https://doi.org/10.1007/978--3-030--24258--9_8

[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. https://doi.org/10.1145/2897518.2897564

Digital Library

[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. https://doi.org/10.1145/3061640.3061655

Digital Library

[11]

Gaë lle Fontaine. 2015. Why Is It Hard to Obtain a Dichotomy for Consistent Query Answering? ACM Trans. Comput. Log., Vol. 16, 1 (2015), 7:1--7:24. https://doi.org/10.1145/2699912

Digital Library

[12]

Ariel Fuxman and René e J. Miller. 2005. First-Order Query Rewriting for Inconsistent Databases. In Database Theory - ICDT 2005, 10th International Conference, Edinburgh, UK, January 5--7, 2005, Proceedings (Lecture Notes in Computer Science), Thomas Eiter and Leonid Libkin (Eds.), Vol. 3363. Springer, 337--351. https://doi.org/10.1007/978--3--540--30570--5_23

[13]

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. https://doi.org/10.1016/j.jcss.2006.10.013

Digital Library

[14]

Floris Geerts, Fabian Pijcke, and Jef Wijsen. 2017. First-order under-approximations of consistent query answers. Int. J. Approx. Reasoning, Vol. 83 (2017), 337--355. https://doi.org/10.1016/j.ijar.2016.10.005

Digital Library

[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. https://doi.org/10.1016/j.ipl.2011.10.018

Digital Library

[16]

Paraschos Koutris and Dan Suciu. 2014. A Dichotomy on the Complexity of Consistent Query Answering for Atoms with Simple Keys. In Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24--28, 2014. 165--176. https://doi.org/10.5441/002/icdt.2014.19

[17]

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. https://doi.org/10.1145/3068334

Digital Library

[18]

Paraschos Koutris and Jef Wijsen. 2018. Consistent Query Answering for Primary Keys and Conjunctive Queries with Negated Atoms, See citeNDBLP:conf/pods/2018, 209--224. https://doi.org/10.1145/3196959.3196982

Digital Library

[19]

Paraschos Koutris and Jef Wijsen. 2019. Consistent Query Answering for Primary Keys in Logspace. In 22nd International Conference on Database Theory, ICDT 2019, March 26--28, 2019, Lisbon, Portugal (LIPIcs), Pablo Barceló and Marco Calautti (Eds.), Vol. 127. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 23:1--23:19. https://doi.org/10.4230/LIPIcs.ICDT.2019.23

[20]

Leonid Libkin. 2004. Elements of Finite Model Theory. Springer. https://doi.org/10.1007/978--3--662-07003--1

[21]

Ester Livshits, Benny Kimelfeld, and Sudeepa Roy. 2018. Computing Optimal Repairs for Functional Dependencies, See citeNDBLP:conf/pods/2018, 225--237. https://doi.org/10.1145/3196959.3196980

Digital Library

[22]

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. https://doi.org/10.1145/1807085.1807111

Digital Library

[23]

Jef Wijsen. 2012. Certain conjunctive query answering in first-order logic. ACM Trans. Database Syst., Vol. 37, 2 (2012), 9:1--9:35. https://doi.org/10.1145/2188349.2188351

Digital Library

[24]

Jef Wijsen. 2019. Foundations of Query Answering on Inconsistent Databases. SIGMOD Rec., Vol. 48, 3 (2019), 6--16. https://doi.org/10.1145/3377391.3377393

Digital Library

Cited By

Amezian El Khalfioui AWijsen J(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
https://doi.org/10.1145/3695836
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://doi.org/10.1145/3651139
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://doi.org/10.1145/3588718
Show More Cited By

Index Terms

First-Order Rewritability in Consistent Query Answering with Respect to Multiple Keys
1. Information systems
  1. Data management systems
    1. Query languages
      1. Relational database query languages
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory
      1. Incomplete, inconsistent, and uncertain databases
      2. Logic and databases

Recommendations

Consistent Query Answering for Primary Keys on Path Queries
PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

We study the data complexity of consistent query answering (CQA) on databases that may violate the primary key constraints. A repair is a maximal consistent subset of the database. For a Boolean query q, the problem CERTAINTY(q) takes a database as ...
Optimization of Answer Set Programs for Consistent Query Answering by Means of First-Order Rewriting
CIKM '20: Proceedings of the 29th ACM International Conference on Information & Knowledge Management

Consistent Query Answering (CQA) with respect to primary keys is the following problem. Given a database instance that is possibly inconsistent with respect to its primary key constraints, define a repair as an inclusion-maximal consistent subinstance. ...
Certain conjunctive query answering in first-order logic

Primary key violations provide a natural means for modeling uncertainty in the relational data model. A repair (or possible world) of a database is then obtained by selecting a maximal number of tuples without ever selecting two distinct tuples that ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODS'20: Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

June 2020

480 pages

ISBN:9781450371087

DOI:10.1145/3375395

General Chair:
Dan Suciu
University of Washington, USA
,
Program Chair:
Yufei Tao
Chinese University of Hong Kong, China
,
Publications Chair:
Zhewei Wei
Renmin University of China, China

Copyright © 2020 ACM.

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

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 June 2020

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

National Science Foundation

Conference

SIGMOD/PODS '20

Sponsor:

SIGMOD

SIGMOD/PODS '20: International Conference on Management of Data

June 14 - 19, 2020

OR, Portland, USA

Acceptance Rates

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
135
Total Downloads

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

Reflects downloads up to 07 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Amezian El Khalfioui AWijsen J(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
https://doi.org/10.1145/3695836
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://doi.org/10.1145/3651139
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://doi.org/10.1145/3588718
Hannula MWijsen JLibkin LBarceló P(2022)A Dichotomy in Consistent Query Answering for Primary Keys and Unary Foreign KeysProceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3517804.3524157(437-449)Online publication date: 12-Jun-2022
https://dl.acm.org/doi/10.1145/3517804.3524157
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
Calautti MConsole MPieris ALibkin LPichler RGuagliardo P(2021)Benchmarking Approximate Consistent Query AnsweringProceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3452021.3458309(233-246)Online publication date: 20-Jun-2021
https://dl.acm.org/doi/10.1145/3452021.3458309
Amezian El Khalfioui AJoertz JLabeeuw DStaquet GWijsen Jd'Aquin MDietze SHauff CCurry ECudre Mauroux P(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
https://dl.acm.org/doi/10.1145/3340531.3411911

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.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents