Computing consistent query answers using conflict hypergraphs

Jan Chomicki, Jerzy Marcinkowski, Slawomir Staworko

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

Abstract

A consistent query answer in a possibly inconsistent database is an answer which is true in every (minimal) repair of the database. We present here a practical framework for computing consistent query answers for large, possibly inconsistent relational databases. We consider relational algebra queries without projection, and denial constraints. Because our framework handles union queries, we can effectively (and efficiently) extract indefinite disjunctive information from an inconsistent database. We describe a number of novel optimization techniques applicable in this context and summarize experimental results that validate our approach.
Original languageEnglish
Title of host publicationProceedings of the 2004 ACM CIKM International Conference on Information and Knowledge Management, Washington, DC, USA, November 8-13, 2004
Pages417-426
Number of pages10
DOIs
Publication statusPublished - 2004

Fingerprint

Dive into the research topics of 'Computing consistent query answers using conflict hypergraphs'. Together they form a unique fingerprint.

Cite this