Efficient Integrity Checking for Databases with Recursive Views

Davide Martinenghi, Henning Christiansen

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

    Abstract

    Efficient and incremental maintenance of integrity constraints involving recursive views is a difficult issue that has received some attention in the past years, but for which no widely accepted solution exists yet. In this paper a technique is proposed for compiling such integrity constraints into incremental and optimized tests specialized for given update patterns. These tests may involve the introduction of new views, but for relevant cases of recursion, simplified integrity constraints are obtained that can be checked more efficiently than the original ones and without auxiliary views. Notably, these simplified tests are derived at design time and can be executed before the particular database update is made and without simulating the updated state. In this way all overhead due to optimization or execution of compensative actions at run time is avoided. It is argued that, in the recursive case, earlier approaches have not achieved comparable optimization with the same level of generality.
    Original languageEnglish
    Title of host publicationAdvances in Databases and Information Systems, ADBIS 2005
    EditorsJohann Eder, Hele-Mai Haav, Ahto Kalja, Jaan Penjam
    Number of pages16
    PublisherSpringer
    Publication date2005
    Pages109-124
    ISBN (Print)3-540-28585-7
    Publication statusPublished - 2005
    EventEast-European Conference on Advances in Databases and Information Systems - Tallinn, Estonia
    Duration: 12 Sep 200515 Sep 2005
    Conference number: 9

    Conference

    ConferenceEast-European Conference on Advances in Databases and Information Systems
    Number9
    Country/TerritoryEstonia
    CityTallinn
    Period12/09/200515/09/2005
    SeriesLecture Notes in Computer Science
    Volume3631
    ISSN0302-9743

    Cite this