T.Weik and A.Heuer. "An algorithm for the analysis of Termination of Large Trigger Sets in an OODBMS", Proceedings of the International Workshop on Active and Real-Time Databases Systems, Skovde, Sweden, June 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....In Active Database applications usually more than one rule is triggered at a time. Important aspects of rule execution are execution order, confluence and termination of rule execution. References: ACL91] AWH92] BCP95] BCW93] BGB95] BW94a] BW94b] CW92] GGD95a] ST94] VS93] WH95] Distributed Environment Supporting active database functionality in a distributed environment poses additional challenges for maintaining and executing rules. References: BOGM92] CW92] Etz93a] Jae95] Ulu95] 3.8 Architecture Architecture of Active Databases are addressed in: ....

T. Weik and A. Heuer. An algorithm for the analysis of termination of large trigger sets in an oodbms. In Proc

....Real Time database Systems (ARTDB95) held in Skovde, Sweden in June 1995. The organization of this workshop is an indication of the timeliness and emerging importance of this area. Out of eleven papers in all at the workshop [42, 28, 33] were primarily concerned with pure real time issues, while [11, 10, 43] were primarily concerned with active database issues. In particular, 37, 6] concerned themselves with both active and real time issues. Especially, 6] set up the stage for forming a comprehensive active, real time systems model. These papers, notwithstanding their novelty and significance, are ....

T. Weik and A. Heuer. An Algorithm for the Analysis of Termination of Large Trigger Sets in an OODBMS. In Proceedings of the International Workshop on Active and Real-Time Database Systems, June 1995.

....of literature on termination analysis for active database rules. Among the earliest of these is the work of Aiken et al. 2] who Draft February 15, 2000 13 proposed using triggering graphs to reason about termination; this approach has subsequently been re ned and improved by various authors [4, 5, 7, 18, 22, 23]. The general idea here is to use acyclicity of the triggering graph to infer termination; the relative precision of di erent analyses depend on their use of di erent techniques to remove edges from the triggering graph prior to the acyclicity test. Weik and Heuer describe an approach to identify ....

....of the triggering graph to infer termination; the relative precision of di erent analyses depend on their use of di erent techniques to remove edges from the triggering graph prior to the acyclicity test. Weik and Heuer describe an approach to identify terminating cycles in triggering graphs [23]. They consider lattice structured domains: a cycle is then inferred to be terminating if it represents an increasing operation in the lattice (i.e. values get mapped to higher values according to the lattice ordering) with a non decreasing step size, and there is an upper bound on the ....

T. Weik and A. Heuer, \An Algorithm for the Analysis of Termination of Large Trigger Sets in an OODBMS", Proc. International Workshop on Active and RealTime Database Systems, June 1995.

....if, for any database state and initial modification, the final database state after rule processing is independent of the order in which activated rules are executed. Previous work on active rule analysis, e.g. Aiken et al. 1995; Karadimce and Urban 1994; van der Voort and Siebes 1993; Weik and Heuer 1995], has developed compile time techniques that allow a rule programmer to predict in advance aspects of rule behavior such as termination and confluence. These techniques are used to statically analyze a set of rules before installing the rules in the database. Thus, static rule analysis can form ....

....for constructing the graphs are assumed. Although building a Triggering Graph is straightforward, building an accurate Activation Graph is not. The techniques presented in this paper for analyzing rule activation can be used to build the Activation Graph needed in [Baralis et al. 1998] Work in [Weik and Heuer 1995] presents a technique for termination analysis of ECA rules in the context of OSCAR, an object oriented active database system. Although the data and rule model in OSCAR are quite different from ours, the analyzed rules correspond roughly to our quasi CA rules with delta relations (see Section ....

[Article contains additional citation context not shown here]

Weik, T. and Heuer, A. 1995. An algorithm for the analysis of termination of large trigger sets in an OODBMS. In Proceedings of the International Workshop on Active and RealTime Databases Systems (Skovde, Sweden, June 1995).

....activate each other indefinitely) A rule set is confluent if, for any database state and initial modification, the final database state after rule processing is independent of the order in which activated rules are executed. Previous work on active rule analysis, e.g. AHW95, KU94, vdVS93, WH95] has developed compile time techniques that allow a rule programmer to predict in advance aspects of rule behavior such as termination and confluence. These techniques are used to statically analyze a set of rules before installing the rules in the database. Thus, static rule analysis can form ....

....techniques in this paper are complementary to those presented in [BCP96] since the techniques presented here would be applied to the analysis of rules within a module. In the degenerate case of a single module, the techniques in [BCP96] are strictly weaker than those presented in this paper. In [WH95] a technique is presented for termination analysis of ECA rules in the context of OSCAR, an object oriented active database system. Although the data and rule model in OSCAR are quite different from ours, the analyzed rules correspond roughly to our quasi CA rules with delta relations (see ....

[Article contains additional citation context not shown here]

T. Weik and A. Heuer. An algorithm for the analysis of termination of large trigger sets in an OODBMS. In Proceedings of the International Workshop on Active and Real-Time Databases Systems, Skovde, Sweden, June 1995.

....is desirable that the DBMS detects the possibility of such non termination and notifies the database designer(s) since such behaviour could make a system unusable. Various static analysis techniques have been proposed for guaranteeing a priori that non termination cannot occur for a given rule set [1, 7, 17, 4, 12]. These techniques generally rely on identifying coarse relationships between the events, conditions and actions of pairs of rules, and although useful for preliminary investigation their precision is often limited. In this paper, we describe a new method for performing a deeper termination ....

....and also assumes a relational data model, we will adopt it as a point of comparison with our own approach below. Van der Voort and Siebes [16] consider the termination problem in the context of objectoriented rules. Their focus is on deciding termination in a fixed number of steps. Weik and Heuer [17] present an analysis method for object oriented rules which is essentially a refinement of the triggering graph method, except with an additional optimisation that if the net action of a cycle is monotonic and there is a bound on the domain, it may be possible to eliminate the cycle from the ....

T. Weik and A. Heuer. An algorithm for the analysis of termination of large trigger sets in an OODBMS. In Proceedings of the International Workshop on Active and Real-Time Databases, pages 170--189, Skovde, Sweden, 1995.

....then it is sure that the operation assign paper to referee will find a set of assigned referees for each paper such that authors assigned referees = 0. 5 Discussion Much work has been done in the area of termination investigation, covering static methods analyzing the specification of rules [1, 2, 3, 18, 20] (at compile time) and dynamic methods analyzing rule execution [4] at runtime) However, no method handle termination analysis for rules specified using composite events, although nowadays most advanced active database systems [5, 6, 7, 8, 10, 11, 14, 19] supports an event algebra. One main ....

....events, although nowadays most advanced active database systems [5, 6, 7, 8, 10, 11, 14, 19] supports an event algebra. One main contribution of our approach is the consideration of composite events. The basic idea of using a graph for termination analysis with rules as nodes is the same as in [1, 2, 3, 20]. We have extended it to make it applicable for rules defined for composite events as well. Another contribution is that we presented the whole process of termination analysis and considered all necessary steps (computing AC E relationships, building the relationship graph, eliminating false ....

[Article contains additional citation context not shown here]

Weik, T., Heuer, A.; An Algorithm for the Analysis of Termination of Large Trigger Sets in an OODBMS; Proceedings of the 1st Intl. Workshop on Active and Real-Time Database Systems, Skoevde, Sweden, June 95.

....database Systems (ARTDB95) was held in Skovde, Sweden in June 1995. The organization of this workshop is an indication of the timeliness and emerging importance of this area. Out of eleven papers in all at the workshop [65, 45, 51] were primarily concerned with pure real time issues, while [19, 18, 68] were primarily concerned with active database issues. In particular, 60, 10] concerned themselves with both active and real time issues. Note that while these papers did an admirable job of identifying the need to combine active and real time characteristics, their purpose was not to identify ....

T. Weik and A. Heuer. An Algorithm for the Analysis of Termination of Large Trigger Sets in an OODBMS. In Proceedings of the International Workshop on Active and Real-Time Database Systems, June 1995.

No context found.

T.Weik and A.Heuer. "An algorithm for the analysis of Termination of Large Trigger Sets in an OODBMS", Proceedings of the International Workshop on Active and Real-Time Databases Systems, Skovde, Sweden, June 1995.

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