ACM Home Page
Please provide us with feedback. Feedback
Updates of Relational Views
Full text PdfPdf (1.24 MB)
Source Journal of the ACM (JACM) archive
Volume 31 ,  Issue 4  (October 1984) table of contents
Pages: 742 - 760  
Year of Publication: 1984
ISSN:0004-5411
Authors
Stavros S. Cosmadakis  Massachusetts Institute of Technology, Cambidge, Massachusetts
Christos H. Papadimitriou  Massachusetts Institute of Technology, Cambridge Massachusetts and National Techntcal University of Athens, Athens, Greece
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 39,   Citation Count: 33
Additional Information:

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/1634.1887
What is a DOI?

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 database relationships. In Proceedings oflFIP 74. North-Holland, Amsterdam, 1974, pp. 580-583.
2
3
4
 
5
BEERI, C., BERNSTEIN, P.A., AND GOODMAN, N. A sophisticate's introduction to database norrealization theory. In Proceedings of the 4th VLDB Conference (West Berlin, Germany, Sept. 13- 15). ACM, New York, 1978, pp. 113-124.
 
6
BEEm, C., AND V^RDI, M. Y.On the complexity of testing implications of data dependencies. Res. Rep., Depl. of Computer Science, Hebrew Univ. of Jerusalem, Jerusalem, Israel, Dec. 1980.
 
7
BEERI, C., AND VARDI, M. Y.On acyclic database decompositions. Inf. Control, to be pubfished.
 
8
CARLSON, C.R., AND ARORA, A.K.The updatability of relational views based on functional dependencies. In 3rd International Computer Software and Applications Conference (Nov.). IEEE Computer Society, Chicago, I11., 1979.
 
9
CHAMBERLIN, D. D., GRAY, J. N., AND TRAINER, I. L. Views, authorization and locking in a relational data base system. In Proceedings of 1975 Nauonal Computer Conference. AFIPS Press, Reston, Va., 1975, pp. 425.-430.
10
 
11
CODD, E. F. Relational completeness of database sublanguages. In Data Base Systems, R. Rustin, Ed. Prentice Hall, Englewood Cliffs, N.J., 1972, pp. 65-98.
 
12
CODD, E. F.Further normahzation of the database relational model. In Data Base Systems, R. Rustin, F_xt. Prentice Hall, Englewood Cliffs, N.J., 1972, pp. 33-64.
13
 
14
CODASYL Data Base Task Group, April 71 Report. ACM, New York, 1971.
15
 
16
 
17
DAYAL, U., AND BERNSTEIN, P, A.On the updatability of relational views. In Proceedings of the 4th VLDB Conference (West Berlin, Germany, Sept. 13-15). ACM, New York, 1978, 368-377.
18
19
 
20
FUgTADO, A. L., SI~VClK, K. C., AND DOS SANTOS, C. S.Permitting updates through views of data bases. Inform. Syst. 4, 4 (t979), 269-283.
 
21
 
22
IMS/VS publications GH20-1260, SH20-9025, SH20-9026, SH20-9027. IBM, White Plmns, New York, 1978.
23
 
24
KAed', R.M.Reducibihty among combinatorial problems. In Complexity of Computer Compurations, R. E. Miller and J. W. Thatcher, Eds. Plenum Press, New York, 1972, pp. 85-104.
25
26
27
 
28
RlSSANEN, J.Theory of relations for databases--A tutorial survey. In Proceedings of the 7th Sympostum on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 64. Spnnger-Vedag, New York, 1978, pp. 536-551.
 
29
ROWE, L., AND STONEBRAKER, M.Manuscript. Univ. Cal., Berkeley, Berkeley, Calif., 1979.
30
 
31
SPYRATOS, N.Translation structures of relational views. In Proceedings of the 6th VLDB Confer. ence (Montreal, Canada, Oct. 1-3). ACM, New York, ! 980, pp. 411--416.
 
32
STOCKMEYER, L. J.The polynomial time hierarchy. Theor. Comput. Sci. 3, 1 (1976), 1-22.
33
 
34
TODD, S. J. P.The Peterlee relational test vehicle--A system overview. IBM SFst. J. 15, 4 (1976), 285-308.
 
35
36
 
37
VARDI, M. Y. On decomposition of relational databases. In Proceedings of the 23rd Sympostum on Foundattons of Computer Science (Chicago, I11., Nov.), IEEE, New York, 1982.
 
38
VARDI, M. Y.Inferring muhlvalued dependencies from funcuonal and join dependencies. Res. Rep., Dept. of Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel, March 1980.
 
39
WRATHALL, C.Complete sets and the polynomial-time hierarchy. Theor. Comput. Sci. 3, 1 (1976), 23-33.
 
40
ZANIOLO, C.Analysts and design of relational schemata for database systems. Tech. Pep. UCLA- ENG-7669, Dept. of Computer Science, Univ. of California, Los Angeles, Calif., July 1976.
41
 
42
ZLOOF, M. M.Query-by-Example: A data base language. IBM Syst. J. 16, 4 (1977), 324-343.

CITED BY  33


REVIEW

"Udo Walter Lipeck : Reviewer"

This article contributes to the subject of how to translate updates of relational database views to updates of the underlying database. Following the approach in [1], the authors assume a specified view complement to remain constant so that ambi  more...

Collaborative Colleagues:
Stavros S. Cosmadakis: colleagues
Christos H. Papadimitriou: colleagues