Skip to main content
SpringerLink
Log in

The Alexander Method — A technique for the processing of recursive axioms in deductive databases

  • Regular Papers
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

We propose a technique for handling recursive axioms in deductive databases. More precisely, we solve the following problem:

Given a relational query including virtual relations defined from axioms (Horn clauses, with variables in the conclusion predefined in the hypotheses), which can be recursive, how to translate this query into arelational program, i. e. a set of relational operations concerning only real relations (not virtual). Our solution has the following properties:

  • • the program to evaluate the query always terminates,

  • • the relational program is produced by a pure compilation of a source query and of the axioms, and is independent of the data values (there is no run-time),

  • • the relational operations are optimized: theyfocus towards the computation of the query, without needless computations.

As far as we know, the Alexander Method is the first solution exhibiting all these properties. This work is partly funded by Esprit Project 112 (KIMS).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bancilhon, Maier, Sagiv, Ullman, “Magic Sets and other strange ways to implement Logic Programming,” MCC Technical Report number DB 121–85, Oct., 1985.

  2. Chakravarthy, U. S., Minker J. and Tran D., “Interfacing predicate logic languages and relational,” Proc. 1st Int. Conf. on Logic Programming, Marseille, 1982.

  3. Chang, “Deduce 2. Further investigations of deduction in Relational Databases,” in Ref. 4), pp. 201–236.

  4. Gallaire, H. and Minker, J. (eds.),Logic and Databases, Plenum Press New York, 1978.

    Google Scholar 

  5. Henschien, L. J. and Naqui, S. A., “On compiling queries in Recursive first order Databases,”CACM, Jan., 1984.

  6. Kerisit, “Preuve de la Methode d’Alexander par une approche algébrique,” BULL rapport interne, May 1986.

  7. Lozinskii, “Evaluating queries in Deductive Databases by generating” IJCAI, 1985.

  8. Marque-Pucheux, G., “Interfacing Prolog and Relational Data Base Management System,”ICOD-2, Sept. 1983.

  9. Nicolas, J. M. and Yazdanian, K., “An outline of B.D.G.E.N.: a deductive DBMS,”Information Processing, IFIP, 1983.

  10. Pugin, J. M. and Jamier, R., “Le Moteur d’Inférence BOUM,”Rapport de DEA, Ecole Centrale de Paris, Juin, 1983.

  11. Reiter, R., “Deductive Question-Answering on relational Databases,” inLogic and Databases, Plenum Press, pp 149–177, 1978.

  12. Shapiro, J. D.,Principles of Database Systems — 2nd Edition, Computer Science Press, 1982.

  13. Vieille, L., “Recursive Axioms in Deductive Databases. The Query-Subquery approach,” Expert Database System Conference, Charleston, Apr. 1986.

Download references

Author information

Authors and Affiliations

  1. Centre de Recherche Bull, 68, Route de Versailles, 78430, Louveciennes, France

    J. Rohmer, R. Lescoeur & J. M. Kerisit

Authors
  1. J. Rohmer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Lescoeur
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. M. Kerisit
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work is partly funded by Esprit Project 112 (KIMS).

About this article

Cite this article

Rohmer, J., Lescoeur, R. & Kerisit, J.M. The Alexander Method — A technique for the processing of recursive axioms in deductive databases. New Gener Comput 4, 273–285 (1986). https://doi.org/10.1007/BF03037407

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037407

Keywords

Search

Navigation