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

Department of Computer Science and Engineering

University of Wrocław
SUNY Buffalo

Research output: Contribution to conference › Paper › peer-review

84 Scopus citations

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 language	English
Pages	417-426
Number of pages	10
DOIs	https://doi.org/10.1145/1031171.1031254
State	Published - 2004
Event	CIKM 2004: Proceedings of the Thirteenth ACM Conference on Information and Knowledge Management - Washington, DC, United States Duration: Nov 8 2004 → Nov 13 2004

Conference

Conference	CIKM 2004: Proceedings of the Thirteenth ACM Conference on Information and Knowledge Management
Country/Territory	United States
City	Washington, DC
Period	11/8/04 → 11/13/04

Keywords

Inconsistency
Integrity constraints
Query processing

Access to Document

10.1145/1031171.1031254

Cite this

@conference{ff31f52587634ae787a524490d063a82,

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

keywords = "Inconsistency, Integrity constraints, Query processing",

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

year = "2004",

doi = "10.1145/1031171.1031254",

language = "English",

pages = "417--426",

note = "CIKM 2004: Proceedings of the Thirteenth ACM Conference on Information and Knowledge Management ; Conference date: 08-11-2004 Through 13-11-2004",

}

TY - CONF

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.

KW - Inconsistency

KW - Integrity constraints

KW - Query processing

UR - https://www.scopus.com/pages/publications/18744400818

U2 - 10.1145/1031171.1031254

DO - 10.1145/1031171.1031254

M3 - Paper

AN - SCOPUS:18744400818

SP - 417

EP - 426

T2 - CIKM 2004: Proceedings of the Thirteenth ACM Conference on Information and Knowledge Management

Y2 - 8 November 2004 through 13 November 2004

ER -

Computing consistent query answers using conflict hypergraphs

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this