ACM Home Page
Please provide us with feedback. Feedback
Computing consistent query answers using conflict hypergraphs
Full text PdfPdf (262 KB)
Source Conference on Information and Knowledge Management archive
Proceedings of the thirteenth ACM international conference on Information and knowledge management table of contents
Washington, D.C., USA
SESSION: DB-5 (databases): potpourri table of contents
Pages: 417 - 426  
Year of Publication: 2004
ISBN:1-58113-874-1
Authors
Jan Chomicki  University at Buffalo
Jerzy Marcinkowski  Wroclaw University
Slawomir Staworko  University at Buffalo
Sponsors
SIGIR: ACM Special Interest Group on Information Retrieval
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 34,   Citation Count: 12
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1031171.1031254
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
 
4
 
5
 
6
 
7
L. Bertossi and J. Chomicki. Query Answering in Inconsistent Databases. In J. Chomicki, R. van der Meyden, and G. Snake, editors, Logics for Emerging Applications of Databases, pages 43--83. Springer-Verlag, 2003.
 
8
 
9
L. Bravo and L. Bertossi. Logic Programs for Consistently Querying Data Integration Systems. In International Joint Conference on Artificial Intelligence (IJCAI), pages 10--15, 2003.
 
10
11
 
12
 
13
J. Chomicki and J. Marcinkowski. Minimal-Change Integrity Maintenance Using Tuple Deletions. Information and Computation, 2004. To appear. Earlier version: Technical Report cs.DB/0212004, arXiv.org e-Print archive.
 
14
 
15
T. Eiter, M. Fink, G. Greco, and D. Lembo. Efficient Evaluation of Logic Programs for Querying Data Integration Systems. In International Conference on Logic Programming (ICLP), pages 163--177, 2003.
 
16
 
17
A. Fuxman and R. Miller. Towards Inconsistency Management in Data Integration Systems. In IJCAI-03 Workshop on Information Integration on the Web (IIWeb-03), 2003.
 
18
 
19
 
20
 
21
 
22
 
23

CITED BY  12

Collaborative Colleagues:
Jan Chomicki: colleagues
Jerzy Marcinkowski: colleagues
Slawomir Staworko: colleagues