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

  • Authors:
  • Andrea Calì;Domenico Lembo;Riccardo Rosati

  • Affiliations:
  • Università di Roma "La Sapienza", Via Salaria 113, Roma, Italy;Università di Roma "La Sapienza", Via Salaria 113, Roma, Italy;Università di Roma "La Sapienza", Via Salaria 113, Roma, Italy

  • Venue:
  • Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

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.