Simplification of integrity constraints with aggregates and arithmetic built-ins

Davide Martinenghi

    Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskning

    Abstract

    Both aggregates and arithmetic built-ins are widely used in current database query languages: Aggregates are second-order constructs such as CNT and SUM of SQL; arithmetic built-ins include relational and other mathematical operators that apply to numbers, such as < and +. These features are also of interest in the context of database integrity constraints: correct and efficient integrity checking is crucial, as, without any guarantee of data consistency, the answers to queries cannot be trusted. In this paper we propose a method of practical relevance that can be used to derive, at database design time, simplified versions of such integrity constraints that can be tested before the execution of any update. In this way, virtually no time is spent for optimization or rollbacks at run time. Both set and bag semantics are considered.
    OriginalsprogEngelsk
    TitelFlexible Query Answering Systems : 6th International Conference, FQAS 2004, Lyon, France, June 24-26, 2004, Proceedings
    RedaktørerChristiansen, H., Hacid, M.-S., Andreasen, T., Larsen, H.L.
    ForlagKluwer Academic Publishers
    Publikationsdato2004
    Sider348-361
    StatusUdgivet - 2004
    Begivenhed6th International Conference On Flexible Query Answering Systems - Lyon, France, Frankrig
    Varighed: 24 jun. 200426 jun. 2004
    Konferencens nummer: 6

    Konference

    Konference6th International Conference On Flexible Query Answering Systems
    Nummer6
    LandFrankrig
    ByLyon, France
    Periode24/06/200426/06/2004

    Citer dette