On the decidability and complexity of query answering over inconsistent and incomplete databases

Abstract

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.

DOI: 10.1145/773153.773179

Extracted Key Phrases

1 Figure or Table

0204060'04'06'08'10'12'14'16
Citations per Year

334 Citations

Semantic Scholar estimates that this publication has 334 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Cal2003OnTD, title={On the decidability and complexity of query answering over inconsistent and incomplete databases}, author={Andrea Cal{\`i} and Domenico Lembo and Riccardo Rosati}, booktitle={PODS}, year={2003} }