skip to main content
research-article

Foundations of Query Answering on Inconsistent Databases

Published: 20 December 2019 Publication History

Abstract

Notwithstanding the traditional view that database instances must respect all integrity constraints imposed on them, it is relevant to develop theories about how to handle database instances that violate some integrity constraints, and more particularly, how to cope with query answering in the presence of inconsistency. Such a theory developed over the past twenty years is currently known as consistent query answering (CQA). The aim of this article is to summarize and discuss some core concepts and theoretical developments in CQA.

References

[1]
F. N. Afrati and P. G. Kolaitis. Repair checking in inconsistent databases: Algorithms and complexity. In ICDT, pages 31--41, 2009.
[2]
M. Arenas, L. E. Bertossi, and J. Chomicki. Consistent query answers in inconsistent databases. In PODS, pages 68--79, 1999.
[3]
M. Arenas, L. E. Bertossi, and J. Chomicki. Answer sets for consistent query answering in inconsistent databases. TPLP, 3(4--5):393--424, 2003.
[4]
S. Arming, R. Pichler, and E. Sallinger. Complexity of repair checking and consistent query answering. In ICDT, pages 21:1--21:18, 2016.
[5]
L. Barto. The dichotomy for conservative constraint satisfaction problems revisited. In LICS, pages 301--310, 2011.
[6]
L. E. Bertossi. Database repairs and consistent query answering: Origins and further developments. In PODS, pages 48--58, 2019.
[7]
A. A. Bulatov. Complexity of conservative constraint satisfaction problems. ACM Trans. Comput. Log., 12(4):24:1--24:66, 2011.
[8]
A. A. Bulatov. Conservative constraint satisfaction re-revisited. J. Comput. Syst. Sci., 82(2):347--356, 2016.
[9]
A. A. Bulatov. A dichotomy theorem for nonuniform CSPs. In FOCS, pages 319--330, 2017.
[10]
M. Calautti, M. Console, and A. Pieris. Counting database repairs under primary keys revisited. In PODS, pages 104--118, 2019.
[11]
L. Caroprese, S. Greco, and E. Zumpano. Active integrity constraints for database consistency maintenance. IEEE Trans. Knowl. Data Eng., 21(7):1042--1058, 2009.
[12]
J. Chomicki and J. Marcinkowski. Minimal-change integrity maintenance using tuple deletions. Inf. Comput., 197(1--2):90--121, 2005.
[13]
N. N. Dalvi, C. R´e, and D. Suciu. Probabilistic databases: Diamonds in the dirt. Commun. ACM, 52(7):86--94, 2009.
[14]
N. N. Dalvi, C. R´e, and D. Suciu. Queries and materialized views on probabilistic databases. J. Comput. Syst. Sci., 77(3):473--490, 2011.
[15]
C. J. Date. An introduction to database systems (7. ed.). Addison-Wesley-Longman, 2000.
[16]
R. Fagin, B. Kimelfeld, and P. G. Kolaitis. Dichotomies in the complexity of preferred repairs. In PODS, pages 3--15, 2015.
[17]
R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: Semantics and query answering. Theor. Comput. Sci., 336(1):89--124, 2005.
[18]
G. Fontaine. Why is it hard to obtain a dichotomy for consistent query answering? ACM Trans. Comput. Log., 16(1):7:1--7:24, 2015.
[19]
G. Greco, S. Greco, and E. Zumpano. A logical framework for querying and repairing inconsistent databases. IEEE Trans. Knowl. Data Eng., 15(6):1389--1408, 2003.
[20]
B. Kimelfeld, E. Livshits, and L. Peterfreund. Detecting ambiguity in prioritized database repairing. In ICDT, pages 17:1--17:20, 2017.
[21]
P. Koutris and J. Wijsen. Consistent query answering for self-join-free conjunctive queries under primary key constraints. ACM Trans. Database Syst., 42(2):9:1--9:45, 2017.
[22]
P. Koutris and J. Wijsen. Consistent query answering for primary keys and conjunctive queries with negated atoms. In PODS, pages 209--224, 2018.
[23]
P. Koutris and J. Wijsen. Consistent query answering for primary keys in logspace. In ICDT, pages 23:1--23:19, 2019.
[24]
E. Livshits and B. Kimelfeld. Counting and enumerating (preferred) database repairs. In PODS, pages 289--301, 2017.
[25]
A. Lopatenko and L. E. Bertossi. Complexity of consistent query answering in databases under cardinality-based and incremental repair semantics. In ICDT, pages 179--193, 2007.
[26]
C. Lutz and F. Wolter. On the relationship between consistent query answering and constraint satisfaction problems. In ICDT, pages 363--379, 2015.
[27]
M. V. Martinez, F. Parisi, A. Pugliese, G. I. Simari, and V. S. Subrahmanian. Policy-basedinconsistency management in relational databases. Int. J. Approx. Reasoning, 55(2):501--528, 2014.
[28]
D. Maslowski and J. Wijsen. A dichotomy in the complexity of counting database repairs. J. Comput. Syst. Sci., 79(6):958--983, 2013.
[29]
D. Maslowski and J. Wijsen. Counting database repairs that satisfy conjunctive queries with self-joins. In ICDT, pages 155--164, 2014.
[30]
S. Staworko. Declarative Inconsistency Handling in Relational and Semi-Structured Databases. PhD thesis, State University of New York at Buffalo, 2007.
[31]
S. Staworko and J. Chomicki. Consistent query answers in the presence of universal constraints. Inf. Syst., 35(1):1--22, 2010.
[32]
S. Staworko, J. Chomicki, and J. Marcinkowski. Prioritized repairing and consistent query answering in relational databases. Ann. Math. Artif. Intell., 64(2--3):209--246, 2012.
[33]
B. ten Cate, G. Fontaine, and P. G. Kolaitis. On the data complexity of consistent query answering. Theory Comput. Syst., 57(4):843--891, 2015.
[34]
J. Wijsen. Corrigendum to ?Counting database repairs that satisfy conjunctive queries with self-joins". CoRR, abs/1903.12469, 2019.
[35]
D. Zhuk. A proof of CSP dichotomy conjecture. In FOCS, pages 331--342, 2017.

Cited By

View all
  • (2024)Consistent query answering over SHACL constraintsProceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning10.24963/kr.2024/1(2-13)Online publication date: 2-Nov-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)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
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMOD Record
ACM SIGMOD Record  Volume 48, Issue 3
September 2019
39 pages
ISSN:0163-5808
DOI:10.1145/3377391
Issue’s Table of Contents
Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 December 2019
Published in SIGMOD Volume 48, Issue 3

Check for updates

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

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

Other Metrics

Citations

Cited By

View all
  • (2024)Consistent query answering over SHACL constraintsProceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning10.24963/kr.2024/1(2-13)Online publication date: 2-Nov-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)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)Uncertain Data Processing Algorithm for Base Station Energy Consumption: Optimized Branch Energy Consumption Algorithm for Multi-Functional DC Power Meter DevicesProceedings of the 2023 7th International Conference on Electronic Information Technology and Computer Engineering10.1145/3650400.3650433(204-208)Online publication date: 20-Oct-2023
  • (2023)Query-Guided Resolution in Uncertain DatabasesProceedings of the ACM on Management of Data10.1145/35893251:2(1-27)Online publication date: 20-Jun-2023
  • (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)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
  • (2022)Approximation and inapproximability results on computing optimal repairsThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-022-00738-032:1(173-197)Online publication date: 12-Apr-2022
  • (2022)Approximate Keys and Functional Dependencies in Incomplete Databases with Limited DomainsFoundations of Information and Knowledge Systems10.1007/978-3-031-11321-5_9(147-167)Online publication date: 20-Jun-2022
  • (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
  • 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