J. Widom, S. J. Finkelstein: Set-oriented Production Rules in Relational Database Systems , in Proc. SIGMOD 1990, 259-270 24  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the database. The action part consists of a sequence of basic operations to insert, delete or update tuples (or objects respectively) in the database. The current research on ADBs (see e.g. 4] is dominated by implementational aspects, whilst foundations of RTSs are seldom approached. The work in [2, 3, 5, 10, 11] and partly in [4] considers the problem to enforce database integrity by the use of RTSs. The results concern the generation of repairing ECA rules and partly the analysis of the resulting RTS. 1 This analysis concentrates on the termination of the rule system, the independence of the nal ....

J. Widom, S. J. Finkelstein: Set-oriented Production Rules in Relational Database Systems , in Proc. SIGMOD 1990, 259-270 24

....to the user. In principle the rst problem vanishes, if veri cation techniques are used at design time [9] whereas the second one still remains. As an alternative a lot of attention has been paid to integrity enforcement. In most cases the envisioned solution is a Rule Triggering System (RTS) [1, 3, 4, 11, 15], where production rules are used to repair inconsistencies instead of rolling back. This is often coupled with design time or run time analysis of the rules [1, 3, 5, 13] In order to become a reasonable solution of the integrity enforcement problem an RTS has to satisfy several properties. In ....

J. Widom, S. J. Finkelstein: Set-oriented Production Rules in Relational Database Systems , in Proc. SIGMOD 1990, pp. 259-270

....to the user. In principle the rst problem vanishes, if veri cation techniques are used at design time [44, 57, 58] whereas the second one still remains. As an alternative a lot of attention has been paid to integrity enforcement. In most cases the envisioned solution is an active database [18, 27, 59, 64, 65], where production rules are used to repair inconsistencies instead of rolling back. Although this is sometimes coupled with design time (or even run time) analysis of the rules [18, 27, 33, 63] the approach is not always successfull. Moreover, a satisfying theory for rule triggering systems with ....

J. Widom, S. J. Finkelstein: Set-oriented Production Rules in Relational Database Systems , in Proc. SIGMOD 1990, pp. 259 - 270

....events resulting from operations on the database. Conditions are usually given by boolean queries that have to be evaluated against the database. The action part consists of a sequence of basic operations to insert, delete or update tuples (or objects respectively) in the database. The work in [2, 3, 7, 14, 15] and partly in [4] considers the problem to enforce database integrity by the use of RTSs. The results concern the generation of repairing ECA rules and partly the analysis of the resulting RTS. This analysis concentrates on the termination of the rule system, the independence of the nal database ....

J. Widom, S. J. Finkelstein: Set-oriented Production Rules in Relational Database Systems, in Proc. SIGMOD 1990, 259-270

....events resulting from operations on the database. Conditions are usually given by boolean queries that have to be evaluated against the database. The action part consists of a sequence of basic operations to insert, delete or update tuples (or objects respectively) in the database. The work in [3, 4, 8, 16, 17] and partly in [5] considers the problem to enforce database integrity by the use of RTSs. The results concern the generation of repairing ECA rules and partly the analysis of the resulting RTS. This analysis concentrates on the termination of the rule system, the independence of the nal database ....

J. Widom, S. J. Finkelstein: Set-oriented Production Rules in Relational Database Systems, in Proc. SIGMOD 1990, 259-270. 23

....the database. The action part consists of a sequence of basic operations to insert, delete or update tuples (or objects respectively) in the database. The current research on ADBs (see e.g. 2] is dominated by implementational aspects, whilst foundations of RTSs are seldom examined. The work in [1, 3, 4, 7, 8] and partly in [2] considers the problem of enforcing database integrity by the use of RTSs. The results concern the generation of repairing ECA rules and partly the analysis of the resulting RTS. This analysis concentrates on the termination of the rule system, the independence of the nal ....

J. Widom, S. J. Finkelstein: Set-oriented Production Rules in Relational Database Systems , in Proc. SIGMOD 1990, 259-270

....database systems like Ariel, Postgres or Starburst, delta relations (often also called transition tables) are a typical means to keep information about the triggering operations instances occurred in a transaction. They can be referred to in the condition as well as in the action part of a trigger [Han91, WF90, SJGP90]. In our approach we will utilize delta relations to formulate e#cient integrity checks and repair actions. 2.2 Example Database To illustrate our techniques by examples, we utilize a database schema describing a personal database of a company. The schema comprises the following relations: ....

....to other systems. The main advantage of the rule system provided in Starburst is that triggers (rules) are deferred to the end of a transaction and that priorities between triggers can be specified. A detailed description of Starburst and the integrated production rule system can be found in [HCLM90, WF90, WCL91]. Here we focus on the features relevant to our trigger generation. The syntax for specifying a trigger (synonymously called a rule) is as follows: create rule name on relation when triggering operations [if condition ] then list of actions [precedes rule list ] follows ....

[Article contains additional citation context not shown here]

J. Widom, S. J. Finkelstein: Set-Oriented Production Rules in Relational Database Systems. In H. Garcia-Molina, H. V. Jagadish (eds.), Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, 259--270, ACM Press, 1990. 48

....triggers. An event can be any set of elementary operation pattern. An action can be any sequence of database operations. We also require triggers to be deferred to the end of a transaction and the capability of specifying priorities between triggers, like it is for example supported in Starburst [6, 14]. A dependency graph must not necessarily be connected, e.g. there may exist constraints which are independent from any other constraint and on which also no other constraint depends. For such a constraint typically the set RC of reaction specifications is empty and the default reaction(i) is ....

J. Widom, S. J. Finkelstein: Set-Oriented Production Rules in Relational Database Systems. In H. GarciaMolina, H. V. Jagadish (eds.), Proc. SIGMOD 1990, 259--270.

....the database. The action part consists of a sequence of basic operations to insert, delete or update tuples (or objects respectively) in the database. The current research on ADBs (see e.g. 2] is dominated by implementational aspects, whilst foundations of RTSs are seldom examined. The work in [1, 3, 4, 7, 8] and partly in [2] considers the problem of enforcing database integrity by the use of RTSs. The results concern the generation of repairing ECA rules and partly the analysis of the resulting RTS. This analysis concentrates on the termination of the rule system, the independence of the final ....

J. Widom, S. J. Finkelstein: Set-oriented Production Rules in Relational Database Systems, in Proc. SIGMOD 1990, 259-270

....oe. Otherwise the entire transaction T ffi TR ffi : commits when rule processing terminates, i.e. when no rule is fired after a transaction. For more details on the semantics of rule execution in Starburst, in particular how transition tables are maintained during rule execution, we refer to [36]. 4 Deriving Triggers In this section we describe the main procedures to derive the triggers that ensure the constraints specified in the database scheme. The techniques presented here work for dynamic constraints and their corresponding transition graphs, respectively, as well as for simple ....

J. Widom, S. J. Finkelstein: Set-Oriented Production Rules in Relational Database Systems. In H. Garcia-Molina, H. V. E. Jagadish (eds.), Proc. ACM SIGMOD Int. Conf. on Management of Data 1990, 259--270, ACM Press, 1990.

....to the user. In principle the first problem vanishes, if verification techniques are used at design time [44, 57, 58] whereas the second one still remains. As an alternative a lot of attention has been paid to integrity enforcement. In most cases the envisioned solution is an active database [18, 27, 59, 64, 65], where production rules are used to repair inconsistencies instead of rolling back. Although this is sometimes coupled with design time (or even run time) analysis of the rules [18, 27, 33, 63] the approach is not always successfull. Moreover, a satisfying theory for rule triggering systems with ....

J. Widom, S. J. Finkelstein: Set-oriented Production Rules in Relational Database Systems, in Proc. SIGMOD 1990, pp. 259 -- 270

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC