Consistent Query Answers in the Presence of Universal Constraints

Slawomir Staworko 1, 2, * Jan Chomicki 3
* Corresponding author
1 MOSTRARE - Modeling Tree Structures, Machine Learning, and Information Extraction
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
Abstract : The framework of consistent query answers and repairs has been introduced to alleviate the impact of inconsistent data on the answers to a query. A repair is a minimally different consistent instance and an answer is consistent if it is present in every repair. In this article we study the complexity of consistent query answers and repair checking in the presence of universal constraints. We propose an extended version of the conflict hypergraph which allows to capture all repairs w.r.t. a set of universal constraints. We show that repair checking is in PTIME for the class of full tuple-generating dependencies and denial constraints, and we present a polynomial repair algorithm. This algorithm is sound, i.e. always produces a repair, but also complete, i.e. every repair can be constructed. Next, we present a polynomial-time algorithm computing consistent answers to ground quantifier-free queries in the presence of denial constraints, join dependencies, and acyclic full-tuple generating dependencies. Finally, we show that extending the class of constraints leads to intractability. For arbitrary full tuple-generating dependen- cies consistent query answering becomes coNP-complete. For arbitrary universal constraints consistent query answering is Πp2-complete and repair checking coNP- complete.
Document type :
Journal articles
Complete list of metadatas

Cited literature [39 references]  Display  Hide  Download

https://hal.inria.fr/inria-00489298
Contributor : Slawomir Staworko <>
Submitted on : Monday, September 5, 2011 - 7:06:07 PM
Last modification on : Tuesday, August 13, 2019 - 11:40:13 AM
Long-term archiving on : Tuesday, November 13, 2012 - 9:51:04 AM

File

staworko-is09.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00489298, version 1

Collections

Citation

Slawomir Staworko, Jan Chomicki. Consistent Query Answers in the Presence of Universal Constraints. Information Systems, Elsevier, 2010, 35 (1), pp.1-22. ⟨inria-00489298⟩

Share

Metrics

Record views

319

Files downloads

286