BIROn - Birkbeck Institutional Research Online

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

    Calì, Andrea and Lembo, D. and Rosati, R. (2003) On the decidability and complexity of query answering over inconsistent and incomplete databases. In: Neven, F. and Beeri, C. and Milo, T. (eds.) Proceedings of the 22nd Symposium on Principles of Database Systems. ACM, pp. 260-271.

    Full text not available from this repository.

    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.

    Metadata

    Item Type: Book Section
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 02 Feb 2021 18:29
    Last Modified: 15 Feb 2021 15:05
    URI: https://eprints.bbk.ac.uk/id/eprint/42861

    Statistics

    Downloads
    Activity Overview
    0Downloads
    15Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item