The Design and Implementation of the Ariel Active Database Rule System (1992)
| Venue: | IEEE Transactions on Knowledge and Data Engineering |
| Citations: | 34 - 8 self |
BibTeX
@ARTICLE{Hanson92thedesign,
author = {Eric N. Hanson},
title = {The Design and Implementation of the Ariel Active Database Rule System},
journal = {IEEE Transactions on Knowledge and Data Engineering},
year = {1992},
volume = {8},
pages = {157--172}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper describes the design and implementation of the Ariel DBMS and it's tightlycoupled forward-chaining rule system. The query language of Ariel is a subset of POSTQUEL, extended with a new production-rule sublanguage. Ariel supports traditional relational database query and update operations efficiently, using a System Rlike 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 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 ff-memory nodes which save storage since they contain only the predicate associated with the memory n...
