ACM Home Page
Please provide us with feedback. Feedback
The logic of a relational data manipulation language
Full text PdfPdf (745 KB)
Source Annual Symposium on Principles of Programming Languages archive
Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages table of contents
San Antonio, Texas
Pages: 101 - 109  
Year of Publication: 1979
Authors
Marco A. Casanova  Harvard University, Cambridge, MA
Philip A. Bernstein  Harvard University, Cambridge, MA
Sponsors
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 26,   Citation Count: 8
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/567752.567762
What is a DOI?

ABSTRACT

A logic for a relational data manipulation language is defined by augmenting a known logic of programs with rules for two new statements: the relational assignment, which assign a relational expression to a relation, and the random tuple selection, which extracts an arbitrary tuple from a relation. The usual operations on relations-retrieve, insert, delete, update-are then defined as special cases of the relational assignment, and the for-each construct scanning a relation tuple by tuple is introduced with the help of the random tuple selection.


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
{BE1} Bernstein, P. A. et al. "The Concurrency Control Mechanism of SDD-1: A System for Distributed Databases", Computer Corporation of America Tech. Rep. 77-09, Dec. 1977.
 
2
{BE2} Bernstein, P. A. et al. "An Approach to the Design and Implementation of Interactive Information Systems", (Draft, Nov. 1977).
 
3
{CA1} Cadiou, J. M. "On Semantic Issues in the Relational Model of Data", Proc. Int. Symp. on Math. Foundations of Computer Science, Gdansk, Poland, "Lecture Notes in Computer Science", Springer-Verlag, Sept. 1976.
 
4
{CA2} Casanova, M. A. "The Logic of a Data Manipulation Language" (technical report in progress).
 
5
{CH1} Chamberlin, D. D. et al. "SEQUEL 2: A Unified Approach to Data Definition, Manipulation and Control", IBM Tech. Rep. RJ1798, June 1976.
 
6
{CO1} Codd, E. F. "A Database Sublanguage Founded on the Relational Calculus", Proc. 1971 ACM SIGFIDET Workshop on Data Description, Access and Control.
7
 
8
{CO3} Cook, S. A. "Axiomatic and Interpretative Semantics for an ALGOL Fragment", TR-79, Univ. of Toronto, Feb. 1975.
 
9
{ES1} Eswaran, K. P. and D. D. Chamberlin. "Functional Specifications of a Subsystem for Database Integrity", Proc. of the Int. Conf. on Very Large Data Bases, 1975.
10
 
11
{HA1} Hammer, M. M. and D. J. McLeod. "Semantic Integrity in a Relational Data Base Management System", Proc. of the Int. Conf. on Very Large Data Bases, 1975.
 
12
{HA2} Harel, D. "Arithmetical Completeness in Logics of Programs", MIT Laboratory for Computer Science TM-103 April 1978.
 
13
{HE1} Held, G. D., M. R. Stonebraker and E. Wong. "INGRESS--A Relational Database System", Proc. AFIPS National Computer Conf., 1975 (pp. 409-416).
 
14
{LA1} Lacroix, M. and A. Pirotte. "Domain Oriented Relational Languages", Proc. of the Int. Conf. on Very Large Data Bases, 1977 (pp. 370-378).
 
15
{LA2} Lamport, L. "Towards a Theory of Correctness for Multi-User Data Base Systems", Massachusetts Computer Associates Tech. Rep. CA-7610-0712, Oct. 1976.
16
17
 
18
 
19
{PA1} Papadimitriou, C. H., P. A. Bernstein and J. B. Rothnie. "Some Computational Problems Related to Database Concurrency Control", Proc. of Conf. on Theoretical Comp. Science, Waterloo, Aug. 1977 (pp. 275-282).
 
20
{PR1} Pratt, V. R. "Semantical Considerations on Floyd-Hoare Logic", Proc. of the 17th IEEE Found. of Comp. Science Conf., Oct. 1976 (pp. 109-120).
21
 
22
{ST1} Stearns, R. E., P. M. Lewis and D. J. Rosenkrantz. "Concurrency Control for Data Base Systems", Proc. of the 17th IEEE Found. of Comp. Science Conf., Oct. 1976 (pp. 19-32).
 
23
{TH1} Thomas, R. H. "A Solution to the Update Problem for Multiple Copy Databases which Uses Distributed Control", BBN Tech. Rep. 3340, July 1975.
 
24
{VA1} van Emden, M. H. "Computational and Deductive Information Retrieval", Proc. of the IFIP Conf. of the Working Group on Formal Specifications of Prog. Lang., Aug. 1977 (pp. 17.1-17.19).
 
25
{YA1} Yasuhara, A. Recursive Function Theory and Logic, Academic Press, 1971.

Collaborative Colleagues:
Marco A. Casanova: colleagues
Philip A. Bernstein: colleagues