Ariel supports traditional relational database query and update operations efficiently, using a System R-like query processing strategy. In addition, the Ariel rule system is tightly coupled with query and update processing.
Ariel rules can have conditions based on a mix of selections, joins, events, and transitions.
In addition, the notions of tokens and a-memory nodes are generalized to support event and transition conditions. 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. All Rights Reserved. The full text of is available to members of the IEEE Computer Society who have an online subscription and an e-account .