ACM Home Page
Please provide us with feedback. Feedback
Views, authorization, and locking in a relational data base system
Full text PdfPdf (713 KB)
Source AFIPS Joint Computer Conferences archive
Proceedings of the May 19-22, 1975, national computer conference and exposition table of contents
Anaheim, California
SESSION: Data base management: relational data base technology table of contents
Pages 425-430  
Year of Publication: 1975
Authors
D. D. Chamberlin  IBM Research Laboratory, San Jose, California
J. N. Gray  IBM Research Laboratory, San Jose, California
I. L. Traiger  IBM Research Laboratory, San Jose, California
Sponsor
AFIPS : American Federation of Information Processing Societies
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 19,   Citation Count: 5
Additional Information:

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

ABSTRACT

In the interest of brevity we assume that the reader is familiar with the notion of a relational data base. In particular, we assume a familiarity with the work of Codd or Boyce and Chamberlin. The examples in this paper will be drawn from a data base which describes a department store and consists of three relations:

EMP(NAME, SAL, MGR, DEPT)

SALES(DEPT, ITEM, VOL)

LOC(DEPT, FLOOR)


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
 
2
Codd, E. F., "A Data Base Sublanguage Founded on the Relational Calculus," Proceedings of 1971 ACM SIGFIDET Workshop on Data Description, Access, and Control, San Diego, California, November 1971.
 
3
Codd, E. F., "Further Normalization of the Data Base Relational Model," Courant Computer Science Symposia, Vol. 6, Data Base Systems, Prentice Hall, New York, May 1971.
 
4
Codd, E. F., "Relational Completeness of Data Base Sublanguages," Courant Computer Science Symposia, Vol. 6, Data Base Systems, Prentice Hall, New York, May 1971.
 
5
Codd, E. F., "Recent Investigations in Relational Data Base Systems," Proceedings of IFIP Congress 74, Stockholm, Sweden, August 1974.
6
 
7
Boyce, R. F., D. D. Chamberlin, Using a Structured English Query Language as a Data Definition Facility, IBM Research report: RJ 1318, San Jose, California, December 1973.
8
 
9
Anonymous, Information Management System Virtual Storage System (IMS/VS)---System/Application Design Guide, IBM form No: SH20-9025, pp. 3.72--3.73, IBM Corporation, Palo Alto' California, 1971.
 
10
CODASYL, "Data Base task group report," ACM, New York, 1971.
 
11
Summers, R. C., C. D. Coleman, E. B. Fernandez, A Programming Language Approach to Secure Data Bases, IBM Los Angeles Scientific Center Technical Report: G320-2662, Los Angeles California, May 1974.
 
12
Stonebraker, M., E. Wong, Access Control in a Relational Data Base Management System by Query Modification, Electronics Research Laboratory memorandum: ERL-M438, UC Berkeley, California, May 1974.
 
13
Minsky, N., Protection of Data-Bases, and the Process of Data-Base Interaction, Computer Science Department, Rutgers, New Brunswick, N.J., September 1974.
 
14
 
15
Eswaran, K. E., J. N. Gray, R. A. Lorie, I. L. Traiger, The Notions of Consistency and Predicate Locks, IBM Research report: RJ 1487, San Jose, California, December 1974.

Collaborative Colleagues:
D. D. Chamberlin: colleagues
J. N. Gray: colleagues
I. L. Traiger: colleagues