Data intensive production systems: the DIPS approach

Authors:
T. Sellis;C. Lin;L. Raschid
Affiliations:
Department of Computer Science, and Institute for Advanced Computer Studies (UMIACS), University of Maryland, College Park, MD;Department of Computer Science, and Institute for Advanced Computer Studies (UMIACS), University of Maryland, College Park, MD;Department of Information Systems, and Institute for Advanced Computer Studies (UMIACS), University of Maryland, College Park, MD
Venue:
ACM SIGMOD Record
Year:
1989

Citing 0
Cited 11

A predicate matching algorithm for database rule systems

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Set-oriented constructs: from Rete rule bases to database systems

SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Managing Communication Networks by Monitoring Databases

IEEE Transactions on Software Engineering
Rule condition testing and action execution in Ariel

SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
PARDES: a data-driven oriented active database model

ACM SIGMOD Record
Index support for rule activation

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Collection oriented match

CIKM '93 Proceedings of the second international conference on Information and knowledge management
Temporal conditions and integrity constraints in active database systems

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
The Design and Implementation of the Ariel Active Database Rule System

IEEE Transactions on Knowledge and Data Engineering
Optimization of Materialization Strategies for Derived Data Elements

IEEE Transactions on Knowledge and Data Engineering
Data Management for Large Rule Systems

VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we highlight the basic approach taken in the design of the DIPS system, and briefly present the main contributions. These include the use of special data structures to store rule definitions; they are implemented using relations. A matching algorithm uses these structures to efficiently identify when the antecedents of productions are satisfied, making them applicable for execution. Partial match information stored in the data structures is used by the matching algorithm. We also describe a proposed concurrent execution strategy for applicable productions, which surpasses in performance, the traditional sequential OPS5 production execution algorithm. The requirements for a correct, serializable execution, based on locking, is described. An advantage of the matching technique in DIPS is that it is fully parallelizable, which makes it attractive for implementation in parallel computing environments.