ACM Home Page
Please provide us with feedback. Feedback
Update semantics of relational views
Full text PdfPdf (1.22 MB)
Source ACM Transactions on Database Systems (TODS) archive
Volume 6 ,  Issue 4  (December 1981) table of contents
Pages: 557 - 575  
Year of Publication: 1981
ISSN:0362-5915
Authors
F. Bancilhon  INRIA, Le Chesnay, France
N. Spyratos  INRIA, Le Chesnay, France
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 94,   Citation Count: 102
Additional Information:

abstract   references   cited by   index terms   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/319628.319634
What is a DOI?

ABSTRACT

A database view is a portion of the data structured in a way suitable to a specific application. Updates on views must be translated into updates on the underlying database. This paper studies the translation process in the relational model. The procedure is as follows: first, a “complete” set of updates is defined such that together with every update the set contains a “return” update, that is, one that brings the view back to the original state; given two updates in the set, their composition is also in the set. To translate a complete set, we define a mapping called a “translator,” that associates with each view update a unique database update called a “translation.” The constraint on a translation is to take the database to a state mapping onto the updated view. The constraint on the translator is to be a morphism. We propose a method for defining translators. Together with the user-defined view, we define a “complementary” view such that the database could be computed from the view and its complement. We show that a view can have many different complements and that the choice of a complement determines an update policy. Thus, we fix a view complement and we define the translation of a given view update in such a way that the complement remains invariant (“translation under constant complement”). The main result of the paper states that, given a complete set U of view updates, U has a translator if and only if U is translatable under constant complement.


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
ARMSTRONG, W.W. Dependency structures of data base relationships. Information Processing 74, North-Holland, Amsterdam, 1974, pp. 580-583.
2
 
3
BANCILHON, F.M., AND SPYRATOS, N. Independent views of relational data bases. To appear.
 
4
CnAMBERLIN, D.D., ET AL. Views, authorization and locking in a relational data base system. In Proc. 1975 Nat. Computer Conf., AFIPS Press, Arlington, Va.
 
5
DAYAL, U., AND BERNSTEIN, P.A. On the updatability of relational views. In Proc. 4th VLDN Conf., West Berlin, Sept. 1978.
 
6
SEVCIK, K.C.., AND FURTAOO, A.L. Complete and compatible sets of update operations. In Proc. ICMOD 78 Conf., Milano, Italy, June 1978, pp. 247-260.
7

CITED BY  102

Collaborative Colleagues:
F. Bancilhon: colleagues
N. Spyratos: colleagues