Preference-Driven Querying of Inconsistent Relational Databases

Slawomir Staworko, Jan Chomicki, Jerzy Marcinkowski

Research output: Chapter in Book/Report/Conference proceedingConference contribution


One of the goals of cleaning an inconsistent database is to remove conflicts between tuples. Typically, the user specifies how the conflicts should be resolved. Sometimes this specification is incomplete, and the cleaned database may still be inconsistent. At the same time, data cleaning is a rather drastic approach to conflict resolution: It removes tuples from the database, which may lead to information loss and inaccurate query answers.

We investigate an approach which constitutes an alternative to data cleaning. The approach incorporates preference-driven conflict resolution into query answering. The database is not changed. These goals are achieved by augmenting the framework of consistent query answers through various notions of preferred repair. We axiomatize desirable properties of preferred repair families and propose different notions of repair optimality. Finally, we investigate the computational complexity implications of introducing preferences into the computation of consistent query answers.
Original languageEnglish
Title of host publicationCurrent Trends in Database Technology
Subtitle of host publicationEDBT 2006, EDBT 2006 Workshops PhD, DataX, IIDB, IIHA, ICSNW, QLQP, PIM, PaRMA, and Reactivity on the Web, Munich, Germany, March 26-31, 2006, Revised Selected Papers
PublisherSpringer Berlin Heidelberg
Number of pages18
ISBN (Electronic)978-3-540-46790-8
ISBN (Print)978-3-540-46788-5
Publication statusPublished - 2006


Dive into the research topics of 'Preference-Driven Querying of Inconsistent Relational Databases'. Together they form a unique fingerprint.

Cite this