A theory for rule triggering systems

Zhou, Yuli; Hsu, Meichun

doi:10.1007/bfb0022186

Cited by 28 publications

(8 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By contrast, we provide techniques for analyzing the behavior of arbitrary rule sets. In addition, in Aiken et al [1995] it has been shown that the methods in Hellerstein and Hsu [1991] and Zhou and Hsu [1990] are subsumed by their techniques, which in turn are subsumed by the methods presented here. The methods in Aiken et al [1995] are developed in the context of the Starburst rule system, which Static Analysis of Active Database Rules • uses an ECA rule model.…”

Section: Previous Related Workmentioning

confidence: 79%

“…In Hellerstein and Hsu [1991] and Zhou and Hsu [1990] methods are given for analyzing condition-action rules. The goal of their work is to impose restrictions on rule sets so that confluence (a "unique fixed point" in their model) is guaranteed.…”

Section: Previous Related Workmentioning

confidence: 99%

“…The propagation algorithm is also useful for analyzing confluence because it can determine when the execution order of two rules is significant. The propagation algorithm determines these properties much more accurately than previous methods (for example, Aiken et al [1999], Hellerstein and Hsu [1991], Zhou and Hsu [1990]). In addition, since we take a general approach based on relational algebra and since we consider both event-condition-action and condition-action rules, our method is applicable to most active database systems that use the relational model and to triggers expressed in the language of the SQL:1999 standard [SQL3 1999;Eisenberg and Melton 1999].…”

Section: Introductionmentioning

confidence: 98%

See 2 more Smart Citations

An algebraic approach to static analysis of active database rules

Baralis

Widom

2000

ACM Trans. Database Syst.

View full text Add to dashboard Cite

Rules in active database systems can be very difficult to program due to the unstructured and unpredictable nature of rule processing. We provide static analysis techniques for predicting whether a given rule set is guaranteed to terminate and whether rule execution is confluent (guaranteed to have a unique final state). Our methods are based on previous techniques for analyzing rules in active database systems. We improve considerably on the previous techniques by providing analysis criteria that are much less conservative: our methods often determine that a rule set will terminate or is confluent when previous methods could not make this determination. Our improved analysis is based on a "propagation" algorithm, which uses an extended relational algebra to accurately determine when the action of one rule can affect the condition of another, and determine when rule actions commute. We consider both condition-action rules and event-condition-action rules, making our approach widely applicable to relational active database rule languages and to the trigger language in the SQL:1999 standard.

show abstract

Section: Previous Related Workmentioning

confidence: 79%

Section: Previous Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 98%

See 1 more Smart Citation

An algebraic approach to static analysis of active database rules

Baralis

Widom

2000

ACM Trans. Database Syst.

View full text Add to dashboard Cite

show abstract

“…A second approach, followed in our article, consists in generating a priori a rule set that is guaranteed to possess certain properties; this approach is followed by Hellerstein and Hsu [ 1991] and Zhou and Hsu [ 1990]. The preceding two references assume condition-action rules (i.e., rules in which triggering events are implicit) in a different manner than shown in this article.…”

Section: Previous Related Workmentioning

confidence: 99%

Modularization techniques for active rules design

Baralis

Ceri

Paraboschi

1996

ACM Trans. Database Syst.

View full text Add to dashboard Cite

Active database systems can be used to establish and enforce data management policies. A large amount of the semantics that normally needs to be coded in application programs can be abstracted and assigned to active rules. This trend is sometimes called "knowledge independence"; a nice consequence of achieving full knowledge independence is that data management policies can then effectively evolve just by modifying rules instead of application programs. Active rules, however, may be quite complex to understand and manage: rules react to arbitrary event sequences, they trigger each other, and sometimes the outcome of rule processing may depend on the order in which events occur or rules are scheduled. Although reasoning on a large collection of rules is very difficult, the task becomes more manageable when the rules are few. Therefore we are convinced that modularization, similar to what happens in any software development process, is the key principle for designing active rules; however, this important notion has not been addressed so far, This article introduces a modularization technique for active rules called stratification; it presents a theory of stratification and indicates how stratification can be practically applied. The emphasis of this article is on providing a solution tQa very concrete and practical problem; therefore, our approach is illustrated by several examples.

show abstract

“…e a such M non-terminating behavior from happening. Some dforts have been made in this direction [8,11,14,2,9,13. The second approach is to design a mechaniem for h andling various errors or failures during the execution of trigger rules.…”

Section: Introductionmentioning

confidence: 99%

A framework for handling errors during the execution of trigger rules for an active object-oriented DBMS

Wang

Yen

Wolter

Proceedings of IEEE International Workshop on Research Issues in Data Engineering: Active Databases Systems

View full text Add to dashboard Cite

As itigger systems i n aciivc object-orienicd daiabaac managcmcri rysicms (OODBMS) become ancnasingly wmplicaied, handling the e m r s , such as failuns and aborts, that may occur during the ezccution of trigger rules becomes an imporiani issue. This paper pnsenis a fimework for handling ihis iype of e m r s . I t ettends the ezisiing e m f handling mechanisms by modeling failuns, aboris and other e m r situaiions as events in ihc Eveni-Condiiion-Action (ECA) pamdigm. Thw, ihe contingency plans or handling e m r evcnis can be modeled as trigger ru f cs. Reuse of the DBMS funciionaliiies; uniform inaimeni of data objecis, trigger rules and contingency plans; and ihe jlctibiliir for users i o declamiivel define a coniingency plan i o suii a particular apptcation are among ihc main benefiia of ihis c m r handling framework. the trigger type definitions and add special attributes 0-8186-5360494 $3.00 0 1994 IEEE 132

show abstract

A theory for rule triggering systems

Cited by 28 publications

References 9 publications

An algebraic approach to static analysis of active database rules

An algebraic approach to static analysis of active database rules

Modularization techniques for active rules design

A framework for handling errors during the execution of trigger rules for an active object-oriented DBMS

Contact Info

Product

Resources

About