The logic of a relational data manipulation language

Authors:
Marco A. Casanova;Philip A. Bernstein
Affiliations:
Harvard University, Cambridge, MA;Harvard University, Cambridge, MA
Venue:
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Year:
1979

Citing 6
Cited 8

Search strategy and selection function for an inferential relational system

ACM Transactions on Database Systems (TODS)
Some high level language constructs for data of type relation

ACM Transactions on Database Systems (TODS)
The notions of consistency and predicate locks in a database system

Communications of the ACM
A relational model of data for large shared data banks

Communications of the ACM
First order logic formalization for functional, multivalued and mutual dependencies

SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
Axiomatic Proof Techniques for Parallel Programs

Axiomatic Proof Techniques for Parallel Programs

On first-order-logic databases

ACM Transactions on Database Systems (TODS)
Properties and update semantics of consistent views

ACM Transactions on Database Systems (TODS)
Automatic verification of database transaction safety

ACM Transactions on Database Systems (TODS)
Formal semantics for time in databases

ACM Transactions on Database Systems (TODS)
Logic and Databases: A Deductive Approach

ACM Computing Surveys (CSUR)
A Formal System for Reasoning about Programs Accessing a Relational Database

ACM Transactions on Programming Languages and Systems (TOPLAS)
A Pragmatic Approach to Structured Database Design

VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Impacts of logic and databases (invited paper)

VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7

Quantified Score

Hi-index	0.00

Visualization

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.