Fast maintenance of semantic integrity assertions using redundant aggregate data

Authors:
Philip A. Bernstein;Barbara T. Blaustein;Edmund M. Clarke
Affiliations:
-;-;-
Venue:
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
Year:
1980

Citing 5
Cited 1

Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems

Journal of the ACM (JACM)
An axiomatic basis for computer programming

Communications of the ACM
Implementation of integrity constraints and views by query modification

SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
Efficient monitoring of database assertions

SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
A Discipline of Programming

A Discipline of Programming

A decompositional approach to database constraint enforcement

CSC '93 Proceedings of the 1993 ACM conference on Computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Semantic integrity assertions are predicates that define consistent database states. To enforce such assertions, a database system must prevent any update from mapping a consistent state to an inconsistent one. In this paper, we describe an enforcement method that is efficient for a large class of relational calculus assertions. The method automatically selects minima and maxima of certain sets to maintain as redundant data in the database. This redundant data is sufficient for enforcing all of the assertions in the class, yet it can be easily maintained. Correctness proofs are expressed in Hoare's program logic.