Abstract
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.
Research is supported in part by the Esprit Project ISIDE (under contract P1133).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Abiteboul, V. Vianu: "Transaction languages for database update and specification", INRIA Research Report, No 715, 64 pages, Sept. 1987.
K.R. Apt, H. Blair, A. Walker: "Towards a Declarative Knowledge" IBM Research Report RC 11681, April 1986.
E.F. Codd: "A Data Base Sublanguage founded on the relational calculus." Proc. of ACM-SIGFIDET, 1971.
K.A Chandra, D. Harel: "Computable Queries for Relational Databases", Journal of Computer and Systems Science, 1980.
C. de Maindreville, E. Simon: "A Predicate Transition Net for Evaluating Queries against Rules in a DBMS." INRIA Research Report No 604, Feb 1987. Also Extended abstract in Adavances in Data Bases, Port Camargue, France May 1987.
C. de Maindreville, E. Simon: "A Production Rule based approach to Deductive Databases." Proc of 4th Int. Conf. on Data Engineering, Los Angeles 1988.
C. de Maindreville, E. Simon: "Modelling Non Deterministic Queries and Updates in Deductive Databases", Proc. Int. Conf. on VLDB, Los Angeles, 1988.
J.M. Nicolas, R. Demolombe: "On the stability of relational queries", Proc of Int Workshop: Logical bases for Databases, CERT, Toulouse, 1982.
E. Simon, P. Valduriez: "Design and Analysis of a Relational Integrity Subsystem." MCC Technical Report DB-O15, 51 pages, Austin, Texas, Jan. 87.
E. Simon: "Simplifying integrity constraints by generating differential pre-tests", INRIA Research Report No 742, 54 pages, Nov. 1987.
E. Simon, C. de Maindreville: "Deciding whether a production rule is relational computable", Research Report INRIA.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Simon, E., de Maindreville, C. (1988). Deciding whether a production rule is relational computable. In: Gyssens, M., Paredaens, J., Van Gucht, D. (eds) ICDT '88. ICDT 1988. Lecture Notes in Computer Science, vol 326. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50171-1_13
Download citation
DOI: https://doi.org/10.1007/3-540-50171-1_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50171-8
Online ISBN: 978-3-540-45943-9
eBook Packages: Springer Book Archive