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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [33 references]  Display  Hide  Download

https://hal.inria.fr/hal-00643104
Contributor : Slawomir Staworko <>
Submitted on : Thursday, April 5, 2012 - 10:42:12 PM
Last modification on : Tuesday, August 13, 2019 - 11:40:13 AM
Long-term archiving on : Tuesday, December 13, 2016 - 6:49:06 PM

File

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

Identifiers

  • HAL Id : hal-00643104, version 1

Collections

Citation

Slawomir Staworko, Jan Chomicki, Jerzy Marcinkowski. Prioritized Repairing and Consistent Query Answering in Relational Databases. Annals of Mathematics and Artificial Intelligence, Springer Verlag, 2012, Special SUM'08 issue. ⟨hal-00643104⟩

Share

Metrics

Record views

399

Files downloads

357