Communications of the ACM
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Efficiently updating materialized views
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
Efficiently monitoring relational databases
ACM Transactions on Database Systems (TODS)
The notions of consistency and predicate locks in a database system
Communications of the ACM
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Using Common Subexpressions to Optimize Multiple Queries
Proceedings of the Fourth International Conference on Data Engineering
Updating Derived Relations: Detecting Irrelevant and Autonomously Computable Updates
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Multiple Query Processing in Deductive Databases using Query Graphs
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
The design and implementation techniques for an integrated knowledge base management system
The design and implementation techniques for an integrated knowledge base management system
Efficient support for rules and derived objects in relational database systems
Efficient support for rules and derived objects in relational database systems
Exploiting concurrency in a DBMS implementation for production systems
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
Relational database behavior: utilizing relational discrete event systems and models
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Set-oriented production rules in relational database 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
On the construction of efficient match networks
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
Intelligent database caching through the use of page-answers and page-traces
ACM Transactions on Database Systems (TODS)
Enhancing database correctness: a statistical approach
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Semantics for update rule programs and implementation in a relational database management system
ACM Transactions on Database Systems (TODS)
Managing conflicts between rules (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Multi-Path Reasoning in a Database
Journal of Intelligent Information Systems
Discrimination network for rule condition matching in object-oriented database rule systems
SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
On Transaction Boundaries in Active Databases: A Performance Perspective
IEEE Transactions on Knowledge and Data Engineering
A Source-to-Source Transformation for Increasing Rule-Based System Parallelism
IEEE Transactions on Knowledge and Data Engineering
The Starburst Active Database Rule System
IEEE Transactions on Knowledge and Data Engineering
Generalized Production Rules as a Basis for Integrating Active and Deductive Databases
IEEE Transactions on Knowledge and Data Engineering
RPL: An Expert System Language with Query Power
IEEE Expert: Intelligent Systems and Their Applications
Coupling Production Systems and Database Systems: A Homogeneous Approach
IEEE Transactions on Knowledge and Data Engineering
On Maintaining Priorities in a Production Rule System
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Ode as an Active Database: Constraints and Triggers
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Implementing Set-Oriented Production Rules as an Extension to Starburst
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Alert: An Architecture for Transforming a Passive DBMS into an Active DBMS
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
An Adaptive Algorithm for Incremental Evaluation of Production Rules in Databases
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
An Algebraic Approach to Rule Analysis in Expert Database Systems
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Maintaining consistency in a stratified production system program
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Comparison of three algorithms for ensuring serializable executions in parallel production systems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Matching 100,045 learned rules
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Unified event model for object databases
ICOODB'09 Proceedings of the Second international conference on Object databases
Hi-index | 0.00 |
It has been widely recognized that many future database applications, including engineering processes, manufacturing and communications, will require some kind of rule based reasoning. In this paper we study methods for storing and manipulating large rule bases using relational database management systems. First, we provide a matching algorithm which can be used to efficiently identify applicable rules. The second contribution of this paper, is our proposal for concurrent execution strategies which surpass, in terms of performance, the sequential OPS5 execution algorithm. The proposed method is fully parallelizable, which makes its use even more attractive, as it can be used in parallel computing environments.