Towards Effect Preservation of Updates with Loops
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.
KeywordsIntention/Effects of Database Updates Contradictory Updates Code Transformation Transaction Design
- E. Baralis and J. Widom. An algebraic approach to static analysis of active database rules. In ACM Transactions on Database Systems, volume 25(3), pages 269–332, September 2000.Google Scholar
- S. Ceri, P.Fraternali, S. Paraboschia, and L. Tanca. Automatic gerneration of production rules for integrity maintenance. In ACM Transactions on Database Systems, volume 19(3), pages 367–422, 1994.Google Scholar
- E.W. Dijkstra and C.S. Scholten. Predicate calculus and program semantics. Springer-Verlag, Texts and Monographs in Computer Science, 1989.Google Scholar
- M. Balaban, S. Jurk. Effect Preservation As A Means For Achieving Update Consistency. In 5th International Conf. on Flexible Query Answering Systems,Lecture Notes in Computer Science, 2002 (to appear).Google Scholar
- M. Balaban, S. Jurk. Intentions of Operations — Characterization and Preservation. In 2nd International Workshop on Evolution and Change in Data Management,Lecture Notes in Computer Science, 2002 (to appear).Google Scholar
- F. Bry. Intensional updates: Abduction via deduction. In Proc. 7th Conf. on Logi Programming, 1990.Google Scholar
- P. Fraternali and S. Paraboschi and L. Tanca. Automatic Rule Generation for Constraints Enforcement in Active Databases. Springer WICS, 1993.Google Scholar
- Joan Antoni Pastor. Extending the synthesis of update transaction programs to handle existential rules in deductive databases. In Deductive Approach to Information Systems and Databases, pages 189–218, 1994.Google Scholar
- D. Plexousakis and J. Mylopoulos. Accommodating integrity constraints during database design. Lecture Notes in Computer Science, 1057, 1996.Google Scholar
- S.Y. Lee, T.W. Ling. Further Improvement on Integrity Constraint Checking for Stratisfiable Deductive Databases. In Proc. 22th Conf. on VLDB, 1996.Google Scholar
- J. Widom and S. Ceri. Deriving production rules for constraint maintenance. In Proc. 16th Conf. on VLDB, pages 566–577, 1990.Google Scholar
- J. Widom and S. Ceri. Active Database Systems. Morgan-Kaufmann, 1996.Google Scholar