论文信息 - Views, authorization, and locking in a relational data base system

Views, authorization, and locking in a relational data base system

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)

[1] E. F. Codd,et al. A Relational Model for Large Shared Data Banks , 1970 .

[2] R. C. Owens. PRIMARY ACCESS CONTROL IN LARGE-SCALE TIME-SHARED DECISION SYSTEMS , 1971 .

[3] E. F. Codd,et al. Further Normalization of the Data Base Relational Model , 1971, Research Report / RJ / IBM / San Jose, California.

[4] E. F. Codd,et al. A data base sublanguage founded on the relational calculus , 1971, SIGFIDET '71.

[5] E. F. Codd,et al. Relational Completeness of Data Base Sublanguages , 1972, Research Report / RJ / IBM / San Jose, California.

[6] Donald D. Chamberlin,et al. Using a Structured English Query Language as a Data Definition Facility , 1973, Research Report / RJ / IBM / San Jose, California.

[7] Donald D. Chamberlin,et al. SEQUEL: A structured English query language , 1974, SIGFIDET '74.

[8] W. F. King,et al. Specifying queries as relational expressions , 1974 .

[9] Michael Stonebraker,et al. Access control in a relational data base management system by query modification , 1974, ACM '74.

[10] E. F. Codd,et al. Recent Investigations in Relational Data Base Systems , 1974, ACM Pacific.

[11] Irving L. Traiger,et al. The notions of consistency and predicate locks in a database system , 1976, CACM.