|
|
|
     |
                                     |
Return to Integration and Mining
In databases with integrity constraints, data may not satisfy the constraints. In this paper, we address the problem of obtaining consistent answers in such a setting, when key and inclusion dependencies are expressed on the database schema. We establish decidability and complexity results for query answering under different assumptions on data (soundness and/or completeness). In particular, after showing that the problem is in general undecidable, we identify the maximal class of inclusion dependencies under which query answering is decidable in the presence of key dependencies. Although obtained in a single database context, such results are directly applicable to data integration, where multiple information sources may provide data that are inconsistent with respect to the global view of the sources.
@inproceedings {DBLP:conf/pods/CaliLR03, author = {Andrea Calì and Domenico Lembo and Riccardo Rosati}, booktitle = {PODS}, title = {On the decidability and complexity of query answering over inconsistent and incomplete databases.}, pages = {260-271}, year = {2003}, url = {db/conf/pods/pods2003.html#CaliLR03}, ee = {http://doi.acm.org/10.1145/773153.773179}, crossref = {conf/pods/2003}, bibsource = {DBLP, http://dblp.uni-trier.de} }  ©2004 Association for Computing Machinery |
