Abstract
We examine some problems which arise when extending a relational DBMS to support production rules. First, a rule language compatible with classical relational database languages is presented. This language may be seen as an extension of Datalog with non-clausal conditions, tuple variables, functions and updates. The essential contribution of this chapter is then the introduction of a new rule execution model to generate query answers. This highly parallel model is based on extended Petri Nets known as duplicate free Predicate Transition Nets (PrTN). It is shown that such a model is a useful tool to determine rule program consistency and convergence, and to optimize query processing. An algorithm to move up selections in the presence of recursive rules with function symbols is proposed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aho, A.V., and J.D. Ullman, “Universality of Data Retrieval Languages”, Proc. ACM 6th Symposium on Principles of Programming Languages, San Antonio, Texas, January 1979, pp. 110-117.
Bancilhon, F., D. Maier, Y. Sagiv, and J.D. Ullman, “Magic Sets and Other Strange Ways to Implement Logic Programs”, MCC Internal Report, 1985.
Chang, C., “On Evaluation of Queries Containing Derived Relation in a Relational Database”, Workshop on Logic and Databases, Toulouse 1979, in [GMN81].
De Maindreville, C., and E. Simon, “...”, Internal Report, INRIA, 1985.
Gardarin, G., P. Bernadat, N. Temmerman, P. Valduriez, and Y. Viemont, “Design of a Multiprocessor Relational Database System”, IFIP 1983 World Computer Congress, Paris, September 1983.
Genrich, H.J., and K. Lautenbach, “System Modelling with High-Level Petri Nets”, Theoretical Computer Science, No. 13.
Gallaire, H., J. Minker, and J.-M. Nicolas, Advances in Database Theory, Vol. 1, Plenum Press, New York, 1981
Gallaire, H., J. Minker, and J.-M. Nicolas, “Logic and Databases: A Deductive Approach”, ACM Computing Surveys, Vol. 16, No. 2, June 1984, pp. 153–185.
Giordana, A., and L. Saitta, “Modelling Production Rules by Meads of Predicate Transition Networks”, Information Sciences Journal, North-Holland, Vol. 35, No. 1, 1985.
Hayes-Roth, F., “Rule-Based Systems”, Communications of the ACM, Vol. 28, September 1985.
Henschen, L.J., and S.A. Naqui, “On Compiling Queries in Recursive First-Order Databases”, ACM Journal, Vol. 31, No. 1, January 1984, pp. 47–85.
Lozinskii, E.L., “Evaluation Queries in Deductive Databases by Generating Subqueries”, Proc. International Joint Conference on Artificial Intelligence, Los Angeles, August 1985, pp. 173-177.
Marque-Pucheu, G., “Algebraic Structure of Answers in a Recursive Logic Database”, Rapport Ecole Normale Superieure, 1983.
Merrett, T.H., Relational Information Systems, Chapter 5, Prentice-Hall, Englewood Cliffs, NJ, 1984.
Minker, J., “Performing Interfaces over Relational Data Bases”, Proc. ACM International Workshop on the Management of Data, Description, Access and Control, New York, May 1975, pp. 79-87.
Minker, J., “Search Strategy and Selection Function for an Inferential Relational System”, ACM Transactions on Database Systems, Vol. 3, No. 1, March 1978, pp. 1–31.
Minker, J., and J.-M. Nicolas, “On Recursive Axioms in Deductive Databases”, Information Systems, Vol. 8, No. 1,1983, pp. 1–13.
Peterson, J.L., Petri Net Theory and Modelling of Systems, Prentice-Hall, Englewood Cliffs, NJ, 1981.
Reiter, R., “Towards a Logical Reconstruction of Relational Database Theory”, in [BMS84], pp. 191-234.
Ullman, J.D., “Implementation of Logical Query Languages for Databases”, ACM Transactions on Database Systems SIGMOD, Austin, Texas, May 1985.
Vieille, L., “On Handling Recursively Defined Virtual Relations in Deductive Databases”, Internal Report, ECRC, Munich, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gardarin, G., de Maindreville, C., Simon, E. (1989). Extending a Relational DBMS Towards a Rule-Based System: An Approach Using Predicate Transition Nets. In: Schmidt, J.W., Thanos, C. (eds) Foundations of Knowledge Base Management. Topics in Information Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83397-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-83397-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-83399-1
Online ISBN: 978-3-642-83397-7
eBook Packages: Springer Book Archive