|
|
|
@inproceedings{DBLP:conf/sigmod/BernsteinB82,
author = {Philip A. Bernstein and
Barbara T. Blaustein},
editor = {Mario Schkolnick},
title = {Fast Methods for Testing Quantified Relational Calculus Assertions},
booktitle = {Proceedings of the 1982 ACM SIGMOD International Conference on
Management of Data, Orlando, Florida, June 2-4, 1982},
publisher = {ACM Press},
year = {1982},
pages = {39-50},
ee = {http://doi.acm.org/10.1145/582353.582361, db/conf/sigmod/BernsteinB82.html},
crossref = {DBLP:conf/sigmod/82},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Semantic integrity assertions are predicates that define consistent states. A database system enforces assertions by ensuring that consistency is maintained as the database is updated.
Most research on the efficient enforcement of assertions has concentrated on assertion simplification algorithms - algorithms that produce simplified assertions that can be evaluated before the update is executed. This paper describes a strategy for further improving the efficiency of assertion enforcement.
We develop an efficient algorithm for evaluating an assertion produced by an assertion simplification algorithm. We characterize a class of assertions that can be evaluated using a simple two-step procedure. The first step defines and evaluates simple selection queries on each relation. The second step applies set emptiness tests to the results of these selections. We also show how these techniques may be used to improve the efficiency of evaluating assertions outside our class.
Copyright © 1982 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.
CDROM Version: Load the CDROM "Volume 1 Issue 2, SIGMOD '75-'92" and ...
