Prioritized Repairing and Consistent Query Answering in Relational Databases - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Annals of Mathematics and Artificial Intelligence Year : 2012

Prioritized Repairing and Consistent Query Answering in Relational Databases

Abstract

A consistent query answer in an inconsistent database is an answer obtained in every (minimal) repair. The repairs are obtained by resolving all conflicts in all possible ways. Often, however, the user is able to provide a preference on how conflicts should be resolved. We investigate here the framework of preferred consistent query answers, in which user preferences are used to narrow down the set of repairs to a set of preferred repairs. We axiomatize desirable properties of preferred repairs. We present three different families of preferred repairs and study their mutual relationships. Finally, we investigate the complexity of preferred repairing and computing preferred consistent query answers.
Fichier principal
Vignette du fichier
staworko-amai09.pdf (457.1 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00643104 , version 1 (05-04-2012)

Identifiers

Cite

Slawomir Staworko, Jan Chomicki, Jerzy Marcinkowski. Prioritized Repairing and Consistent Query Answering in Relational Databases. Annals of Mathematics and Artificial Intelligence, 2012, Special SUM'08 issue, ⟨10.1007/s10472-012-9288-8⟩. ⟨hal-00643104⟩
195 View
196 Download

Altmetric

Share

Gmail Facebook X LinkedIn More