ACM Home Page
Please provide us with feedback. Feedback
Updating derived relations: detecting irrelevant and autonomously computable updates
Full text PdfPdf (2.71 MB)
Source ACM Transactions on Database Systems (TODS) archive
Volume 14 ,  Issue 3  (September 1989) table of contents
Pages: 369 - 400  
Year of Publication: 1989
ISSN:0362-5915
Authors
José A. Blakeley  Indiana Univ., Bloomington
Neil Coburn  Univ. of Waterloo, Waterloo, Ont., Canada
Per-:1Vke Larson  Univ. of Waterloo, Waterloo, Ont., Canada
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 36,   Citation Count: 70
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/68012.68015
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
ADIBA, M. E., AND LINDSAY, B.G. Database snapshots. In Proceedings of the 6th international Conference on Very Large Data Bases (Montreal, 1980), 86-91.
2
 
3
BERNSTEIN, P. A., AND BLAUSTEIN, B.T. A simplification algorithm for integrity assertions and concrete views. In Proceedings COMPSAC 81 (Chicago, 1981), 90-99.
 
4
 
5
 
6
BLAKELEY, J. A., COBURN, N., AND LARSON, P.-/~. Updating derived relations: Detecting irrelevant and autonomously computable updates. Tech. Rep. 235, Computer Science Dept., Indiana Univ., 1987.
7
8
 
9
10
11
 
12
GARDARIN, G., SIMON, E., AND VERLAINE, L. Querying real time relational data bases. In IEEE-ICC International Conference (Amsterdam, 1984), 757-761.
13
 
14
LARSON, P.-/k., AND YANG, H.Z. Computing queries from derived relations. In Proceedings of the 11th International Conference on Very Large Data Bases (Stockholm, 1985), 259-269.
15
 
16
17
 
18
ROSENKRANTZ, D. J., AND HUNT, H. B., III. Processing conjunctive predicates and queries. In Proceedings of the 6th International Conference on Very Large Data Bases (Montreal, 1980), 64-72.
19
 
20
 
21

CITED BY  70


REVIEW

"Diane M. Miller : Reviewer"

This useful paper addresses the maintenance of derived relations that are materially stored rather than virtually represented, a strategy that might be employed for very large databases in order to speed query processing. In such situations, an   more...

Collaborative Colleagues:
José A. Blakeley: colleagues
Neil Coburn: colleagues
Per-:1Vke Larson: colleagues