Set-oriented production rules in relational database systems
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Termination and confluence of rule execution
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Applying an update method to a set of receivers (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Heraclitus: elevating deltas to be first-class citizens in a database programming language
ACM Transactions on Database Systems (TODS)
Semantics for update rule programs and implementation in a relational database management system
ACM Transactions on Database Systems (TODS)
Non-deterministic languages to express deterministic transformations
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Applying an update method to a set of receivers
ACM Transactions on Database Systems (TODS)
RPL: An Expert System Language with Query Power
IEEE Expert: Intelligent Systems and Their Applications
Modelling Non Deterministic Queries and Updates in Deductive Databases
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
A Model for Active Object Oriented Databases
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Language Constructs for Programming Active Databases
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
On Implementing a Language for Specifying Active Database Execution Models
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
In this paper, we consider the problem of integrating a production rule language, named RDL1, with a relational DBMS. A production rule in RDL1, consists of a condition part which is a relational calculus expression and of an action part which is a sequence of database updates. The main problem addressed in this paper is to determine whether a rule program can be computed as a relational algebra program, i.e., whether the initial semantics of the program is not modified by a set-oriented or relational computation. First, we define the syntax and the semantics of the RDL1 language which is given as the sequence of database states reachable by the computation of the program. We conjecture that deciding if a rule is relational computable is an undecidable problem and then, propose sufficient conditions to decide if a rule is relational computable. We present a general method to check the validity of these conditions. Finally, we propose two algorithms which are derived from the previous method. The first one gave sufficient syntactic conditions for a rule to be relational computable. The second one gave sufficient semantic conditions and leads to check integrity constraints over the database to decide whether a rule is relational computable.