Characterising relational view updates using relative information capacity
In 2013, Chris Date published a book about the view update problem in the context of the Relational Model. He presented several detailed examples of different varieties of view updates and characterised their behaviour, in the process deriving a set of principles for updating views based on the notion of information equivalence of view schemas. In this paper we discuss work in progress that examines how Date’s operational definition of information equivalence can be formally characterised using Hull’s concept of relative information capacity. As a proof of concept, we use an extension of Miller’s schema intension graph formalism to model the information equivalence of Date’s restriction view example.
Conference: Thirteenth Asia-Pacific Conference on Conceptual Modelling (APCCM 2017), Geelong, Victoria, Australia
Rights Statement: Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from email@example.com. ACSW ’17, January 31-February 03, 2017, Geelong, Australia © 2017 Copyright held by the owner/author(s). Publication rights licensed to ACM.
Keywords: view update problem, information equivalence, relative information capacity, schema intension graph, schema transformation
Research Type: Conference or Workshop Item (Paper published in proceedings)
This item includes a version that corrects to some minor errata that appeared in the published version.