A Transition Net Formalism for Deductive Databases Efficiently Handling Quering and Integrity Constraints Aspects

  • Kamel Barkaoui
  • Noureddine Boudriga
  • Amel Touzi
Conference paper


This paper presents a formalism derived from high level Petri nets for deductive database representation called Deductive Transition Net (DTN). We study the DTN semantics and we show how this formalism can be used either for query answering or for integrity constraint evaluation. We propose some relaxation techniques that improve the operational efficiency of the model.


Integrity Constraint Deductive Database Answering Query Output Place Colored Token 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    F. Bancilhon, R. Ramakrishnan, “ An amateur’s intoduction to recursive query processing strategies”, ACM SIGMOD Conf., 1986.Google Scholar
  2. [2]
    M. Taylor, “Logical optimisation of distributed knowledge queries” Comp Jou 33:1, 90.Google Scholar
  3. [3]
    C. de Maindreville, E. Simon, “ Modelling queries and updates in deductive databases”, VLDB Conf. 1988.Google Scholar
  4. [4]
    R. Kowalski, F. Sadri, P. Soper, “Integrity checking in deductive databases”,VLDB 87.Google Scholar
  5. [5]
    C. de Maindreville, E. Simon, “ A predicate transition net for evaluating queries against rules in DBMS ”, INRIA report 604, 1987.Google Scholar
  6. [6]
    H. J. Genrich, K. Lautenbach,“System modelling with high level Petri nets”,T. C. S, 1981.Google Scholar
  7. [7]
    K. Jensen, “ Coloured Petri nets”, Advances in Petri nets, LNCS 255, 1986.Google Scholar
  8. [8]
    N. Lefevre, “Optimisation de programmes de règles dans les bases de données déductives”, Ph. D dissertation, Univ. Paris VI, Juin 91.Google Scholar
  9. [9]
    A. Tarski, “Fixpoint theory”, the Pacific Jour. Math., 1955.Google Scholar
  10. [10]
    Z. Manna, ” Mathematical theory of Computation”, Mc Graw Hill, 1974.Google Scholar
  11. [11]
    M. Jark 8760,Centrum voor Wiskund en Informatica, 1987.Google Scholar
  12. [12]
    S. Susuki, T. Ibaraki, M. Kishi “ Using relaxation techniques to evaluate queries in deductive databases” DEXA, Berlin 1991.Google Scholar
  13. [13]
    K. R. Apt, J. M. Pugin “Management of stratified databases” Report C. S R 8760, Centrum voor wiskund en informatica, 1987.Google Scholar

Copyright information

© Springer-Verlag/Wien 1992

Authors and Affiliations

  • Kamel Barkaoui
    • 1
  • Noureddine Boudriga
    • 2
  • Amel Touzi
    • 2
  1. 1.Laboratoire CEDRIC — CNAMRue Saint-Martin ParisFrance
  2. 2.Faculty of Science, Computer Science DepartmentUniversity Tunis 2Tunis BelvédèreTunisia

Personalised recommendations