Efficient Integrity Checking for Databases with Recursive Views

Davide Martinenghi, Henning Christiansen

    Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningpeer review

    Resumé

    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.
    OriginalsprogEngelsk
    TitelAdvances in Databases and Information Systems, ADBIS 2005
    RedaktørerJohann Eder, Hele-Mai Haav, Ahto Kalja, Jaan Penjam
    Antal sider16
    ForlagSpringer
    Publikationsdato2005
    Sider109-124
    ISBN (Trykt)3-540-28585-7
    StatusUdgivet - 2005
    BegivenhedEast-European Conference on Advances in Databases and Information Systems - Tallinn, Estland
    Varighed: 12 sep. 200515 sep. 2005
    Konferencens nummer: 9

    Konference

    KonferenceEast-European Conference on Advances in Databases and Information Systems
    Nummer9
    LandEstland
    ByTallinn
    Periode12/09/200515/09/2005
    NavnLecture Notes in Computer Science
    Vol/bind3631
    ISSN0302-9743

    Citer dette

    Martinenghi, D., & Christiansen, H. (2005). Efficient Integrity Checking for Databases with Recursive Views. I J. Eder, H-M. Haav, A. Kalja, & J. Penjam (red.), Advances in Databases and Information Systems, ADBIS 2005 (s. 109-124). Springer. Lecture Notes in Computer Science, Bind. 3631
    Martinenghi, Davide ; Christiansen, Henning. / Efficient Integrity Checking for Databases with Recursive Views. Advances in Databases and Information Systems, ADBIS 2005. red. / Johann Eder ; Hele-Mai Haav ; Ahto Kalja ; Jaan Penjam. Springer, 2005. s. 109-124 (Lecture Notes in Computer Science, Bind 3631).
    @inproceedings{db969ed06b6211dbb485000ea68e967b,
    title = "Efficient Integrity Checking for Databases with Recursive Views",
    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.",
    author = "Davide Martinenghi and Henning Christiansen",
    year = "2005",
    language = "English",
    isbn = "3-540-28585-7",
    pages = "109--124",
    editor = "Johann Eder and Hele-Mai Haav and Ahto Kalja and Jaan Penjam",
    booktitle = "Advances in Databases and Information Systems, ADBIS 2005",
    publisher = "Springer",

    }

    Martinenghi, D & Christiansen, H 2005, Efficient Integrity Checking for Databases with Recursive Views. i J Eder, H-M Haav, A Kalja & J Penjam (red), Advances in Databases and Information Systems, ADBIS 2005. Springer, Lecture Notes in Computer Science, bind 3631, s. 109-124, East-European Conference on Advances in Databases and Information Systems, Tallinn, Estland, 12/09/2005.

    Efficient Integrity Checking for Databases with Recursive Views. / Martinenghi, Davide; Christiansen, Henning.

    Advances in Databases and Information Systems, ADBIS 2005. red. / Johann Eder; Hele-Mai Haav; Ahto Kalja; Jaan Penjam. Springer, 2005. s. 109-124 (Lecture Notes in Computer Science, Bind 3631).

    Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningpeer review

    TY - GEN

    T1 - Efficient Integrity Checking for Databases with Recursive Views

    AU - Martinenghi, Davide

    AU - Christiansen, Henning

    PY - 2005

    Y1 - 2005

    N2 - 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.

    AB - 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.

    M3 - Article in proceedings

    SN - 3-540-28585-7

    SP - 109

    EP - 124

    BT - Advances in Databases and Information Systems, ADBIS 2005

    A2 - Eder, Johann

    A2 - Haav, Hele-Mai

    A2 - Kalja, Ahto

    A2 - Penjam, Jaan

    PB - Springer

    ER -

    Martinenghi D, Christiansen H. Efficient Integrity Checking for Databases with Recursive Views. I Eder J, Haav H-M, Kalja A, Penjam J, red., Advances in Databases and Information Systems, ADBIS 2005. Springer. 2005. s. 109-124. (Lecture Notes in Computer Science, Bind 3631).