Deciding whether a production rule is relational computable

  • Eric Simon
  • Christophe de Maindreville
Complexity And Optimization
Part of the Lecture Notes in Computer Science book series (LNCS, volume 326)


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.


Production Rule Integrity Constraint Relational Schema Relational Computation Database Schema 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [Abiteboul87]
    S. Abiteboul, V. Vianu: "Transaction languages for database update and specification", INRIA Research Report, No 715, 64 pages, Sept. 1987.Google Scholar
  2. [Apt86]
    K.R. Apt, H. Blair, A. Walker: "Towards a Declarative Knowledge" IBM Research Report RC 11681, April 1986.Google Scholar
  3. [Codd71]
    E.F. Codd: "A Data Base Sublanguage founded on the relational calculus." Proc. of ACM-SIGFIDET, 1971.Google Scholar
  4. [Chandra80]
    K.A Chandra, D. Harel: "Computable Queries for Relational Databases", Journal of Computer and Systems Science, 1980.Google Scholar
  5. [Maindreville87]
    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.Google Scholar
  6. [Maindreville88a]
    C. de Maindreville, E. Simon: "A Production Rule based approach to Deductive Databases." Proc of 4th Int. Conf. on Data Engineering, Los Angeles 1988.Google Scholar
  7. [Maindreville88b]
    C. de Maindreville, E. Simon: "Modelling Non Deterministic Queries and Updates in Deductive Databases", Proc. Int. Conf. on VLDB, Los Angeles, 1988.Google Scholar
  8. [Nicolas82]
    J.M. Nicolas, R. Demolombe: "On the stability of relational queries", Proc of Int Workshop: Logical bases for Databases, CERT, Toulouse, 1982.Google Scholar
  9. [Simon87a]
    E. Simon, P. Valduriez: "Design and Analysis of a Relational Integrity Subsystem." MCC Technical Report DB-O15, 51 pages, Austin, Texas, Jan. 87.Google Scholar
  10. [Simon87b]
    E. Simon: "Simplifying integrity constraints by generating differential pre-tests", INRIA Research Report No 742, 54 pages, Nov. 1987.Google Scholar
  11. [Simon88]
    E. Simon, C. de Maindreville: "Deciding whether a production rule is relational computable", Research Report INRIA.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Eric Simon
    • 1
  • Christophe de Maindreville
    • 1
  1. 1.INRIA — RocquencourtLe Chesnay cedexFrance

Personalised recommendations