Updating derived relations: detecting irrelevant and autonomously computable updates
- 1 September 1989
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 14 (3), 369-400
- https://doi.org/10.1145/68012.68015
Abstract
Consider a database containing not only base relations but also stored derived relations (also called materialized or concrete views). When a base relation is updated, it may also be necessary to update some of the derived relations. This paper gives sufficient and necessary conditions for detecting when an update of a base relation cannot affect a derived relation (an irrelevant update), and for detecting when a derived relation can be correctly updated using no data other than the derived relation itself and the given update operation (an autonomously computable update). The class of derived relations considered is restricted to those defined by PSJ -expressions, that is, any relational algebra expressions constructed from an arbitrary number of project, select and join operations (but containing no self-joins). The class of update operations consists of insertions, deletions, and modifications, where the set of tuples to be deleted or modified is specified by a selection condition on attributes of the relation being updated.Keywords
This publication has 9 references indexed in Scilit:
- The HiPAC project: combining active databases and timing constraintsACM SIGMOD Record, 1988
- Extending a database system with proceduresACM Transactions on Database Systems, 1987
- Efficiently updating materialized viewsPublished by Association for Computing Machinery (ACM) ,1986
- A snapshot differential refresh algorithmPublished by Association for Computing Machinery (ACM) ,1986
- Modeling the storage architectures of commercial database systemsACM Transactions on Database Systems, 1985
- Fragments of relationsPublished by Association for Computing Machinery (ACM) ,1983
- Efficiently monitoring relational databasesACM Transactions on Database Systems, 1979
- Efficient monitoring of database assertionsPublished by Association for Computing Machinery (ACM) ,1978
- Algorithm 97: Shortest pathCommunications of the ACM, 1962