E. Hanson. Rule condition testing and action execution in ariel. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 49--58, San Diego, CA, Jun. 1992.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....The language and a constraint satisfaction processor are used in UF s automated negotiation server [HAM00, HUA00, SU00a] for evaluating the contents of a negotiation proposal against some pre registered constraints. 7 Event and action oriented rules are commonly used in active database systems [HAA90, HAN92, MCC89, STO88, WID96]. There are two general types of event andaction oriented rules: triggers and event condition action (ECA) rules. Triggers in active databases enforce business knowledge by automatically invoking data operations when a predefined condition is satisfied. In a trigger definition, a condition and ....

....event andaction oriented rules: triggers and event condition action (ECA) rules. Triggers in active databases enforce business knowledge by automatically invoking data operations when a predefined condition is satisfied. In a trigger definition, a condition and some data operations are specified [HAN92]. A database operation such as Delete, Insert or Update would trigger the evaluation of the condition part of a trigger. If the condition is True, then the data operations of the trigger are performed automatically. For example, a business rule specifies that, if a customer s address is modified, ....

Hanson, E. N., "Rule Condition Testing and Action Execution in Ariel," Proceedings of the ACM SIGMOD Conference, San Diego, CA, June 1992, pp. 49-58.

....controlled in a database. When applied to an open information universe as the Internet, these assumptions no longer hold, and some of the techniques do not easily extend to scale up to the distributed interoperable environment. Comparing with the state of art of research in active databases [12, 9, 10, 4, 11, 3], the JCQ system differs primarily in the following three ways: First, the JCQ system targets at update monitoring on the Web, handling both structured database sources and semistructured sources such as HTML files. Second, the continual query concept can be seen as a practical and useful ....

E. Hanson. Rule condition testing and action execution in ariel. In Proceedings of ACM SIGMOD Conference, 1992.

....of a condition, which in turn (if true) triggers an action. Most of the active database systems [43] provide facilities that allow users to specify, in the form of ECA rules, actions to be performed following changes of database state. Some popular active database research prototypes include Ariel [15], Postgres [39] and Starburst [14] These systems provide powerful rules and allow general events, conditions, and actions, and therefore are more di#cult to provide e#cient implementation. Despite the conceptual generality, rules have been so far supported in a fairly restricted form in ....

E. Hanson. Rule condition testing and action execution in ariel. In Proceedings of ACM SIGMOD Conference, 1992. 37

....future directions. 1. Introduction Conditional expressions are a useful way of describing the interest of a user with respect to some expected data. For example in a Content based subscription system [AS 99] a user may express his interest in an event Car4Sale (using the syntax defined in [Han92] ) as follows: ON Car4Sale IF (Model = Taurus and Price 20000) THEN notify( scott yahoo.com ) Here the expression (Model = Taurus and Price 20000) describes the user s interest and the referenced variables, Model and Price, constitute the relevant evaluation context (defined in ....

....our intent of storing expressions is to capture interest in terms of filtering criteria, which evaluate to TRUE or FALSE for an input data item. Existing content based subscription systems and other active systems employ some form of in memory indexes ( AS 99] CDTW00] RETE [For82] Ariel [Han92]) for filtering expressions efficiently. In contrast, our indexing scheme creates persistent relational database objects for storage. Index processing involves issuing SQL queries on these objects and this mechanism can potentially scale to large expression sets. Oracle Rules evaluation engine ....

Hanson, E. N. "Rule Condition testing and action execution in Ariel", SIGMOD Conference 1992 : 49-58.

....on top of the EXODUS storage manager. Ariel focuses on extensions to relational DBMS towards production rules. Production rule processing, especially condition evaluation, has to be efficient. The Ariel publications also discuss suitable data structures and indexes. References: Han89] HB91] Han92b] Han92a] Han96] Secondary: CHS92] HW93] PDW 93] SZ96] VK93] 2.5 ATM ATM (Activity Transaction Model) is an activity started at DIGITAL in 1990. Based on (and extending) the HiPAC execution model it provides a framework to specify complex dependencies among transactions. ATM ....

....Databases are addressed in: References: BZBW95] Cha92] CZ93] Etz93d] Jas94] 3. 9 Implementation Issues There are prototypes implemented, and the following papers discuss details of implementations: References: BZBW95] Car92] CKAK93] CN90] Coh89] DM89] GD93b] GJS92a] Han92b] Han92a] HB91] HK87] HK89] KD93] Mor83] RCBB89] SZ96] TJD95] WCL91] 3.10 Optimization Optimization of rule execution spans from efficient event detection to efficient data condition evaluation to fast and non redundant rule action execution. References: AVG92] BGLM91] ....

E.N. Hanson. Rule condition testing and action execution in Ariel. In Proc

....on top of the EXODUS storage manager. Ariel focuses on extensions to relational DBMS towards production rules. Production rule processing, especially condition evaluation, has to be efficient. The Ariel publications also discuss suitable data structures and indexes. References: Han89] HB91] Han92b] Han92a] Secondary: CHS92] HW93] PDW 93] VK93] 2.4 ATM ATM (Activity Transaction Model) is an activity started at DIGITAL in 1990. Based on (and extending) the HiPAC execution model it provides a framework to specify complex dependencies among transactions. ATM uses ECA rules to ....

....of Active Databases are addressed in: References: Cha92] CZ93] Jas94] 3 SPECIAL ISSUES 6 3. 8 Implementation Issues There are prototypes implemented, and the following papers discuss details of implementations: References: Car92] CKAK93] CN90] Coh89] DM89] GD93b] GJS92a] Han92b] Han92a] HB91] HK87] HK89] KD93] Mor83] RCBB89] WCL91] 3.9 Optimization Optimization of rule execution spans from efficient event detection to efficient data condition evaluation to fast and non redundant rule action execution. References: AVG92] BGLM91] BM93] Cha89] ....

E.N. Hanson. Rule condition testing and action execution in Ariel. In Proc

....the stock is too high) This need has led to the design of active databases, in which events of various kinds (e.g. a query, an update) may cause the firing of so called active rules. Many proposals for using active rules in databases have appeared, both commercial [3,4,19,26,36] and academic [11,14,18,21,25,30,33,37,38,40,41,42] (the latter usually being more flexible than the former) In order to assign a clear semantics to active rules, several approaches have been proposed to integrate active rules in a deductive framework. In assigning a semantics to these activedeductive languages, two main approaches emerged. The ....

.... states that both of the conflicting updates should be discarded, e#ectively leaving EDB in the same state as before with regard to a (in our framework, this can be obtained by returning insert if a was already in EDB, delete otherwise) The rule priority policy, found in systems such as Ariel [25], Postgres [37] and Starburst [42] assumes that each rule has a (static or dynamic) priority associated with it; sel returns insert or delete as needed to execute the update requested by the highest priority rule (in our framework, this can be obtained by looking up priorities in P ) Other ....

E. Hanson. Rule Condition Testing and Action Execution in Ariel. In Proc. of the ACM SIGMOD Int. Conf. on Management of Data, pages 49--58, 1992.

....the second step of the algorithm, and it only uses single predicates as grouping criterium. Our performance evaluation bellow shows the bene t of using prefetching and multi attribute hashing tables. The second technique consists in compiling subscription predicates in a test network ala A TREAT[5] (that could be a tree structure) Internal nodes represent tests (i.e. predicates) the leaves of the network contain references to subscriptions. Events enter the network at the root of the network they are tested at internal nodes progressing from node to node if node test succeeds. Event ....

E. Hanson. Rule condition testing and action execution in ariel. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 4958, 1992.

....Java Beans [8] or active objects [15] Typically, the model adopted is quite a low level one, and consists in system observers merely accepting events from the reactive elements of the system. In the database area, a number of research prototypes of active DBMS have been developed, such as Ariel [11], Sentinel [4] Starburst [29] Postgress [24] Chimera [5] etc. Most of them support composite events, allowing internal ECA rules to be activated when two or more events occur. Our Synchronizer component of the Observation Interface abstraction performs a work that could be analogous to the ....

E.N. Hanson, Rule Condition Testing and Action Execution in Ariel. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 49--58, 1992.

....complexity and computation of all these semantics. 3.1 INTRODUCTION During the last several years, active databases have been studied extensively by researchers around the world. Following the lead provided by many successful implementations (Ceri and Widom, 1991; Ghandeharizadeh et al. 1993; Hanson, 1992; Dayal et al. 1995) formal semantics have recently been proposed for eventcondition action (ECA) rules, cf. Fraternali and Tanca, 1995; Gottlob et al. 1996; Picouet and Vianu, 1995; Zaniolo, 1993) In this paper, we introduce the concept of an Action Policy. Intuitively, given a feasible ....

....Active databases monitor conditions on databases and take actions as specified by the active rules defined by the application developer. Early work on active databases focused on building scalable implementations, e.g. the Starburst system of IBM (Ceri and Widom, 1991) and the Ariel system (Hanson, 1992). More recently, there has been a trend towards developing a formal semantics for active databases. Zaniolo, 1993) suggested the use of Datalog 1S for this purpose. Fraternali and Tanca, 1995) also proposed a semantics for ECA rules. The expressive power of implemented active database systems ....

Hanson, E. (1992). Rule Condition Testing and Action Execution in Ariel. In Proceedings ACM SIGMOD '92, pages 49--58.

....updates) then inferencing will more often produce definite information about the truth falsity of conditions, and so performing mixed execution will give commensurately greater speed ups. 6. 1 Related Work There has been a much work on local optimisation of the condition parts of active rules: [8] proposes discrimination networks for optimising repetitive evaluations of single rules, and strategies used by other systems are reviewed in [16, 12] There has been less research, however, on global rule optimisation. The two main papers containing relevant work in this area are [11] and [4] ....

E. Hanson. Rule condition testing and action execution in Ariel. In Proc. SIGMOD 1992, pages 49--58, San Diego, 1992.

....that should be reached in order to fire, while ECA (or event driven) rules have an extra event attribute: 21 HYHQW , FRQGLWLRQ 7 (1 DFWLRQ, which means that they are considered for firing only when the certain event has occurred. The main difference between these two kinds of active rules [25] is that data driven rules are more expressive and declarative since they describe a firing situation (implicit triggers) without an exact description of the way this situation is detected, while event driven rules are more procedural because they describe exactly when they should be considered ....

....while all relevant constraints are inefficiently checked every time an object is accessed. There is no notion of incremental condition checking for both types of rules. Relational database systems, on the other hand, support production rules, using variations of the RETE algorithm, like Ariel [25], or implementing a completely new approach, like DIPS [32] Ariel supports both implicit and explicit triggers, therefore it integrates production and ECA rules in a relational database context. The main difference with DEVICE is that Ariel supports data driven rules, at the low level, which are ....

[Article contains additional citation context not shown here]

Hanson, E N, Rule condition testing and action execution in Ariel n: Stonebraker, M, ed., Proc. ACM SIGMOD Int. Conf. on Management of Data, 1992, 1992, 49-58.

....(i.e. the rule is triggered) when the condition becomes true. We believe that CA rules are more suitable for integration in a query language, since they are more declarative. CA rules make physical events implicit, just as a query language makes database navigation implicit. OPS5 [Bro85] and Ariel [Han92] have similar rule semantics. Unlike those systems, the condition in an AMOS rule can refer to derived AMOSQL functions (which correspond to views) Data can be passed from the condition to the action of each rule by using shared query variables. By quantifying query variables set oriented action ....

Hanson E. N., 'Rule Condition Testing and Action Execution in Ariel ', Proc. ACM SIGMOD, 1992, pp. 49-58.

....by hand to analyze (and consequently modify) several rule applications. Although our methods have been designed for the Starburst Rule System, we expect that they can be adapted to accommodate the syntax and semantics of many other active database rule languages, including A RDL [SKdM92] Ariel [Han92] Chimera [CM93] POSTGRES [SJGP90] Sentinel [AMC93] and others [CL92, DHW94] We also expect that our techniques should be applicable to the upcoming standard for triggers in SQL3. To apply our methods to an alternative rule language, the fundamental definitions of Section 5 (Triggers, ....

E.N. Hanson. Rule condition testing and action execution in Ariel. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 49--58, San Diego, California, June 1992.

.... when conforming the styles of their rule processing to those of relational framework [15] 20] 23] Some works such as [5] 18] 21] feature such attempts to implement relational production languages, relocating facts into the relational databases from working memory in discrimination networks [6][8][16] Currently, production languages such as OPS5 [6] and ECLPS [9] are being used to implement the relational production languages, since their structures are inherently similar to the relational framework. However, much of the advantages could be restricted if target databases contain a ....

....However, our rule instantiations are assumed to be set oriented, contrary to other systems assuming instanceoriented ones. The set orientation means that when a rule fires, all combinations of tuples that have matched the rule condition since the last time the rule fired are processed at once [8]. The adoption of the set oriented behavior is helpful in conforming our framework to relational one, since set orientation is one of the inherent semantics that the relational framework has [5] 23] From now on we will say a rule is eligible to fire if its waiting event occurs, fired when its ....

[Article contains additional citation context not shown here]

E.N. Hanson, Rule condition testing and action execution in Ariel, In proceedings of the ACM SIGMOD Int. Conf. on Management of Data, San Diego, California, (Jun., 1992) 49-58.

.... [Rou82b] Rou91] RK91] Val87] The use and refreshment of materialized views has been de2 scribed in [BM90] CKPS95] GL95] GMR95] HK95] Han87] LMSS95] SJGP90] SR87] ZGMHW95] Incremental techniques has been described for active databases [CSL 90] CW91] HCKW90] Han92] RCBB89] WDSY91] for deductive databases [GMS93] and for temporal databases [BM95c] JMR91] McK88] However, we are not aware of existing incremental algorithms that combine materialized view, partially materialized views, and ViewCaches. In Section 2 we discuss a set of methods that ....

E.N. Hanson. Rule Condition Testing and Action Execution in ARIAL. In Proceedings of the 1992 ACM SIGMOD International Conference on Management of Data, San Diego, California, USA, 1992.

....knowledge about the data semantics and the design of the database is moved into the database itself, thus simplifying applicative software and reducing the chance for consistency breaking data manipulations. The field has produced various results, both commercial [2, 3, 10, 18, 24] and academic [8, 9, 13, 15, 21, 25, 26, 31, 32] (the latter usually being more flexible than the former) However, the experience with these languages has often exposed the lack of a clear, unified and formal foundation for active rules [30] These two approaches to improve database management systems are not in opposition, but rather they can ....

.... states that both of the conflicting updates should be discarded, effectively leaving EDB in the same state as before with regard to a (in our framework, this can be obtained by returning insert if a was already in EDB, delete otherwise) The rule priority policy, found in systems such as Ariel [15], Postgres [25] and Starburst [32] assumes that each rule has a (static or dynamic) priority associated with it; sel returns insert or delete as needed to preserve the update requested by the highest priority rule. Other policies, like voting schemes and user queries, are also reasonable, but ....

E. Hanson. Rule condition testing and action execution in Ariel. In Proc. of the ACM SIGMOD Conference on Management of Data, pages 49--58, San Diego, CA, June 1992.

No context found.

Eric N. Hanson, `Rule condition testing and action execution in Ariel', Proc. ACM SIGMOD International Conference on Management of Data, June 1992, pp. 49--58.

No context found.

Hanson, E.N., "Rule Condition Testing and Action Execution in Ariel," Proceedings of ACM SIGMOD, San Diego, CA, June 1992.

No context found.

E. Hanson. Rule condition testing and action execution in ariel. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 49--58, San Diego, CA, Jun. 1992.

No context found.

Hanson, E., "Rule condition testing and action execution in ariel," in Proceedings of ACM SIGMOD Conference, 1992. 171

No context found.

Hanson, E.N. Rule Condition Testing and Action Execution in Ariel. Proc. ACM SIGMOD 1992, San Diego, CA, 49-58, June 2-5, 1992.

No context found.

E. Hanson. Rule condition testing and action execution in ariel. In Proceedings of the ACM SIGMOD Int. Conf. on Management of Data, 1992.

No context found.

E. Hanson. Rule condition testing and action execution in Ariel. In Proc. of the ACM SIGMOD International Conference on Management of Data, June 1992.

No context found.

Han92 E.N. Hanson: "Rule Condition Testing and Action Execution in Ariel", Proc. of the ACM SIGMOD International Conference on Management of Data, 1992.

First 50 documents  Next 50

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