Simplification of integrity constraints with aggregates and arithmetic built-ins

Davide Martinenghi

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearch

    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.
    Original languageEnglish
    Title of host publicationFlexible Query Answering Systems : 6th International Conference, FQAS 2004, Lyon, France, June 24-26, 2004, Proceedings
    EditorsChristiansen, H., Hacid, M.-S., Andreasen, T., Larsen, H.L.
    PublisherKluwer Academic Publishers
    Publication date2004
    Pages348-361
    Publication statusPublished - 2004
    Event6th International Conference On Flexible Query Answering Systems - Lyon, France, France
    Duration: 24 Jun 200426 Jun 2004
    Conference number: 6

    Conference

    Conference6th International Conference On Flexible Query Answering Systems
    Number6
    Country/TerritoryFrance
    CityLyon, France
    Period24/06/200426/06/2004

    Cite this