Computing consistent query answers using conflict hypergraphs

Jan Chomicki; Jerzy Marcinkowski; Slawomir Staworko

doi:10.1145/1031171.1031254

Computing consistent query answers using conflict hypergraphs

Jan Chomicki, Jerzy Marcinkowski, Slawomir Staworko

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract / Description of output

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 language	English
Title of host publication	Proceedings of the 2004 ACM CIKM International Conference on Information and Knowledge Management, Washington, DC, USA, November 8-13, 2004
Pages	417-426
Number of pages	10
DOIs	https://doi.org/10.1145/1031171.1031254
Publication status	Published - 2004

Access to Document

10.1145/1031171.1031254

http://doi.acm.org/10.1145/1031171.1031254

Cite this

@inproceedings{696ea7dbff4841c7b6756069d118675e,

title = "Computing consistent query answers using conflict hypergraphs",

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.",

author = "Jan Chomicki and Jerzy Marcinkowski and Slawomir Staworko",

year = "2004",

doi = "10.1145/1031171.1031254",

language = "English",

pages = "417--426",

booktitle = "Proceedings of the 2004 ACM CIKM International Conference on Information and Knowledge Management, Washington, DC, USA, November 8-13, 2004",

}

TY - GEN

T1 - Computing consistent query answers using conflict hypergraphs

AU - Chomicki, Jan

AU - Marcinkowski, Jerzy

AU - Staworko, Slawomir

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

U2 - 10.1145/1031171.1031254

DO - 10.1145/1031171.1031254

M3 - Conference contribution

SP - 417

EP - 426

BT - Proceedings of the 2004 ACM CIKM International Conference on Information and Knowledge Management, Washington, DC, USA, November 8-13, 2004

ER -

Computing consistent query answers using conflict hypergraphs

Abstract / Description of output

Access to Document

Fingerprint

Cite this