Keywords (1)

Academic
Publications
The logic of a relational data manipulation language

The logic of a relational data manipulation language,10.1145/567752.567762,Marco A. Casanova,Philip A. Bernstein

The logic of a relational data manipulation language   (Citations: 11)
BibTex | RIS | RefWorks Download
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.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...Our work is related to other work on mechanical proofs of transaction safety [3,4,6,8]...

    Tim Sheardet al. Automatic verification of database transaction safety

    • ...literature (although the need for a temporal semantics in databases is discussed, for example, in [5, 7, 26, 28,38,44])...
    • ...Where they have been examined (e.g., by Smith and Smith [46], Nicolas and Yazdanian [38], and Casanova and Bernstein [7] as “MC constraints” or constraints upon update operation& they have been considered as different in kind from extensional (or “static”) constraints...

    James Cliffordet al. Formal semantics for time in databases

    • ...Although the concept of transaction is widely used [4, 17, 24, 27, 31, 34], very little work has been done on DML logics [6, 19], and none accounts for the full use of aggregation operators [21]...
    • ...First-order languages have been favored to play the role of relational DDLs [2, 6, 19, 25, 26, 35] since predicate symbols can be used to denote tables and wellformed formulas (wffs) can be used to denote consistency criteria...
    • ...Given a special many-sorted language ~e chosen to act as a DDL, we define a DML appropriate for accessing databases described in ~. The DML is constructed from the regular programs of [28], plus a new basic statement taken from [6]...

    Marco R. Casanovaet al. A Formal System for Reasoning about Programs Accessing a Relational Da...

Sort by: