Paper Info
Title
Rule condition testing and action execution in Ariel
Abstract
This paper describes testing of rule conditions and execution of rule actions in Ariel active DBMS. The Ariel rule system is tightly coupled with query and update processing. Ariel rules can have conditions based on a mix of patterns, events, and transitions. For testing rule conditions, Ariel makes use of a discrimination network composed of a special data structure for testing single-relation selection conditions efficiently, and a modified version of the TREAT algorithm, called A-TREAT, for testing join conditions. The key modification to TREAT (which could also be used in the Rete algorithm) is the use of virtual &agr;-memory nodes which save storage since they contain only the predicate associated with the memory node instead of copies of data matching the predicate. The rule-action executor in Ariel binds the data matching a rule's condition to the action of the rule at rule fire time, and executes the rule action using the query processor.
Year
DOI
Venue
1992
10.1145/130283.130295
SIGMOD Conference
Keywords
Field
DocType
data structure
Data structure,Data mining,Executor,Computer science,Rete algorithm,Predicate (grammar),Database
Conference
Volume
Issue
ISSN
21
2
0163-5808
ISBN
Citations 
PageRank 
0-89791-521-6
106
28.40
References 
Authors
14
1
Search Limit
100106
Name
Order
Citations
PageRank
Eric N. Hanson1917376.11