Ariel Database Rule System Project
Final rept. 15 Apr 1989-14 Jan 1992
WRIGHT STATE UNIV DAYTON OH DEPT OF COMPUTER SCIENCE AND ENGINEERING
Pagination or Media Count:
The Ariel project has culminated in several advancements in active database technology, and the development of a working prototype active database system. Ariel is unique in its support for efficient rule condition testing based on a discrimination network, and its tight integration of rule processing with database transaction processing. An efficient index for testing single-relation selection predicates was developed, which also resulted in the development of two new types of interval index data structures, the interval binary search tree, and the interval skip-list. For testing join conditions, a modified version of the TREAT algorithm, called A-TREAT, was developed. A-TREAT is suitable for use in a database environment. Its major new feature that makes it suitable for databases is the concept of virtual alpha-memory nodes, which, unlike normal alpha-memories, do not contain the data matching the associated selection predicate. Instead, virtual alpha-memories contain only the predicate.
- Computer Programming and Software