A generalization of Dijkstra's calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Predicate calculus and program semantics
Predicate calculus and program semantics
Automatic generation of production rules for integrity maintenance
ACM Transactions on Database Systems (TODS)
Consistency enforcement in entity-relationship and object-oriented models
Data & Knowledge Engineering - Special issue on ER '97
An algebraic approach to static analysis of active database rules
ACM Transactions on Database Systems (TODS)
Accomodating Integrity Constraints During Database Design
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
Effect Preservation as a Means for Achieving Update Consistency
FQAS '02 Proceedings of the 5th International Conference on Flexible Query Answering Systems
Deriving Production Rules for Constraint Maintainance
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Further Improvements on Integrity Constraint Checking for Stratifiable Deductive Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Supporting Transaction Design in Conceptual Modelling of Information Systems
CAiSe '95 Proceedings of the 7th International Conference on Advanced Information Systems Engineering
Hi-index | 0.01 |
Todays technologies are capable to assist database developers in designing complex actions (e.g. stored procedures, active database rules). However, automatic generation and extention of given actions holds a danger -- The original intention of actions might get canceled or even reversed, e.g. by some appended repairing action enforcing an integrity constraint. This problem might cause non-desired situations where an action commits although one of the intended database modifications was not applied.In this paper, we deal with the characterization and preservation of effects (intentions) of database actions. As an extention of our current approach for effect preservation, we present a method for handling updates including non-nested loops. A transformation process is proposed that modifies a given action S to S', such that S' does preserve the effects. In order to reduce additional run-time overhead of S', most of the computation is shifted to compile-time.