Why is it Hard to Obtain a Dichotomy for Consistent Query Answering?

A database may for various reasons become inconsistent with respect to a given set of integrity constraints. To overcome the problem, a formal approach to querying such inconsistent databases has been proposed and since then, a lot of efforts have been spent to classify the complexity of consistent...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science S. 550 - 559
1. Verfasser: Fontaine, Gaelle
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.06.2013
Schlagworte:
Complexity theory
Computer science
Data integration
Educational institutions
Maintenance engineering
Polynomials
ISBN:1479904139, 9781479904136
ISSN:1043-6871
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A database may for various reasons become inconsistent with respect to a given set of integrity constraints. To overcome the problem, a formal approach to querying such inconsistent databases has been proposed and since then, a lot of efforts have been spent to classify the complexity of consistent query answering under various classes of constraints. It is known that for the most common constraints and queries, the problem is in CONP and might be CONP-hard, yet several relevant tractable classes have been identified. Additionally, the results that emerged suggested that given a set of key constraints and a conjunctive query, the problem of consistent query answering is either in PTIME or is CONP-complete. However, despite all the work, as of today this dichotomy remains a conjecture. The main contribution of this paper is to explain why it appears so difficult to obtain a dichotomy result in the setting of consistent query answering. Namely, we prove that such a dichotomy w.r.t. common classes of constraints and queries, is harder to achieve than a dichotomy for the constraint satisfaction problem, which is a famous open problem since the 1990s.
ISBN:1479904139
9781479904136
ISSN:1043-6871
DOI:10.1109/LICS.2013.62