eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2016-03-14
21:1
21:18
10.4230/LIPIcs.ICDT.2016.21
article
Complexity of Repair Checking and Consistent Query Answering
Arming, Sebastian
Pichler, Reinhard
Sallinger, Emanuel
Inconsistent databases (i.e., databases violating some given set of integrity constraints) may arise in many applications such as, for instance, data integration. Hence, the handling of inconsistent data has evolved as an active field of research. In this paper, we consider two fundamental problems in this context: Repair Checking (RC) and Consistent Query Answering (CQA).
So far, these problems have been mainly studied from the point of view of data complexity (where all parts of the input except for the database are considered as fixed). While for some kinds of integrity constraints, also combined complexity (where all parts of the input are allowed to vary) has been considered, for several other kinds of integrity constraints, combined complexity has been left unexplored. Moreover, a more detailed analysis (keeping other parts of the input fixed - e.g., the constraints only) is completely missing.
The goal of our work is a thorough analysis of the complexity of the RC and CQA problems. Our contribution is a complete picture of the complexity of these problems for a wide range of integrity constraints. Our analysis thus allows us to get a better understanding of the true sources of complexity.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol048-icdt2016/LIPIcs.ICDT.2016.21/LIPIcs.ICDT.2016.21.pdf
inconsistency
consistent query answering
complexity