Incremental Integrity Checking: Limitations and Possibilities

Henning Christiansen, Davide Martinenghi

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review


    Integrity checking is an essential means for the preservation of the intended semantics of a deductive database. Incrementality is the only feasible approach to checking and can be obtained with respect to given update patterns by exploiting query optimization techniques. By reducing the problem to query containment, we show that no procedure exists that always returns the best incremental test (aka simplification of integrity constraints), and this according to any reasonable criterion measuring the checking effort. In spite of this theoretical limitation, we develop an effective procedure allowing general parametric updates that, for given database classes, returns ideal simplifications and also applies to recursive databases. Finally, we point out the improvements with respect to previous methods based on an experimental evaluation.
    Original languageEnglish
    Title of host publicationLogic for Programming, Artificial Intelligence, and Reasoning 12th International Conference, LPAR 2005, Montego Bay, Jamaica, Proceedings, LPAR
    EditorsGeoff Sutcliffe, Andrei Voronkov
    Number of pages16
    PublisherKluwer Academic Publishers
    Publication date2005
    ISBN (Print)3-540-30553-X
    Publication statusPublished - 2005
    EventLPAR, Logic for Programming, Artificial Intelligence, and Reasoning - Montego Bay, Jamaica
    Duration: 2 Dec 20056 Dec 2005
    Conference number: 12


    ConferenceLPAR, Logic for Programming, Artificial Intelligence, and Reasoning
    CityMontego Bay
    SeriesLecture Notes in Computer Science

    Cite this