Maintenance of views
Authors:
Open Access
- 1 June 1984
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 14 (2) , 240-255
Abstract
In relational databases a view definition is a query against the database, and a view materialization is the result of applying the view definition to the current database A view materialization over a database may change as relations in the database undergo modificationsIn this paper a mechanism is proposed in which the view is materialized at all times The problem which this mechanism addresses is how to quickly update the view in response to database changes A structure is maintained which provides information useful in minimizing the amount of work caused by updatesMethods are presented for handling both general databases and the much simpler tree databases (also called acyclic database) In both cases adding or deleting a tuple can be performed in polynomial time For tree databases the degree of the polynomial is independent of the schema structure while for cyclic databases the degree depends on the schema structure The cost of a sequence of tuple additions (deletions) is also analyzedKeywords
This publication has 10 references indexed in Scilit:
- On the Desirability of Acyclic Database SchemesJournal of the ACM, 1983
- GYO reductions, canonical connections, tree and cyclic schemas and tree projections1983
- Tree queriesACM Transactions on Database Systems, 1982
- The complexity of facets (and some facets of complexity)1982
- Transforming cyclic schemas into trees1982
- The tree property is fundamental for query processing1982
- Connections in acyclic hypergraphs1982
- Power of Natural SemijoinsSIAM Journal on Computing, 1981
- Using Semi-Joins to Solve Relational QueriesJournal of the ACM, 1981
- Properties of acyclic database schemes1981