Skip to main content
SpringerLink
Log in

OLDTNF-based evaluation method for handling recursive queries in deductive databases

  • Published:
Science in China Series E: Technological Sciences Aims and scope Submit manuscript

Abstract

OLDTNF resolution is an important mechanism used in a Prolog interpreter. This mechanism is extended and improved for evaluating recursive queries in deductive databases. The key idea of the refinement is to distinguish between two classes of lookup nodes in an OLDTNF derivation and to handle them differently. First, reduce the search space by cutting of any subtree rooted at a lookup node of the first class. Further, speed up the evaluation by processing the second class in a second phase and generate many solutions directly from the solutions already produced (and the corresponding keys of solution lists) instead of evaluating them by expanding the corresponding subtrees in terms of the new solutions stored in solution lists.

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. Lloyd, J. W.,Foundations of Logic Programming, Berlin: Springer-Verlag, 1987.

    MATH  Google Scholar 

  2. Tamaki, H., Sato, T., OLD resolution with tabulation, inProc. 3rd Inter. Conf. Logic Programming, Cambridge, London: MIT Press, 1986, 84–98.

    Google Scholar 

  3. Vieille, L., From QSQ to QoSaQ: Global optimization of recursive queries, inProc. 2nd Int. Conf. Expert Database System (ed. Kerschberg, L.), Charleston, 1988, 743–748.

  4. Seki, H., Itoh, H., A query evaluation method for stratified programs under the extended CWA, inProc. Inter. Conf Logic Programming, Cambridge, London: MIT Press, 1989, 195–211.

    Google Scholar 

  5. Balbin, G. S., Ramamobanarao, P. K., Menakshi, K., Efficient bottom-up computation of queries on stratified databases,J. Logic Programming, Amsterdam: Elsevier Science Inc., North-Holland, 1991, November, 295–344.

    Google Scholar 

  6. Chen, Y., Magic sets and stratified databases,Int. J. Intelligent Systems, New York: John Wiley & Sons Inc., 1997, 12 (3): 203.

    Google Scholar 

  7. Ullman, J., Van Gelder, A., Parallel complexity of logic programs,Algorithmica, Berlin: Springer-Verlag, 1988, 5–12.

    Google Scholar 

  8. Vardi, M. Y., The complexity of relational query language,in Proc. 14th Annual ACM Symp. Theory of Computing, San Francisco, Calif., May 5–7, 1982, New York: ACM, 1982, 137–146.

    Google Scholar 

  9. Aho, A. V., Sagiv, Y., Ullman J. D., Efficient optimization of a class of relational expression,ACM Trans. Datab. Syst. 4: 4 (Dec. 1979), New York, 1979, 435–454.

    Article  Google Scholar 

  10. Gaifman, H., Mairson, H., Sagiv, Y. et al. Undecidable optimization problems for database logic programs,J. ACM, 1993, 40(3): 683.

    Article  MATH  MathSciNet  Google Scholar 

  11. Clark, K. L., Negation as failure, inLogic and Databases (eds. Gallaire, H., Minker, J.), New York: Plenum, 1978, 293–322.

    Google Scholar 

  12. Van Gelder, A., A message passing framework for logic query evaluation, inProc. 1986 CMSIGMOD Conf. on Management of Data, New York, ACM, 1986, 155–165.

    Chapter  Google Scholar 

  13. Cousot, P., Cousot, R., Abstract interpretation frameworks,J. Logic Programming, Amsterdam: Elsevier Science Inc., 1992, 2: 511.

    Google Scholar 

  14. Kanamori, T., Kawamura, T., Abstract interpretation based on OLDT resolution,J. Logic Programming, Amsterdam: Elsevier Science Inc., 1993, 15: 1.

    Google Scholar 

  15. Tarjan, R., Depth-first search and linear graph algorithms,SIAM J. Compt., 1972, 1(2): 146.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technical Institute of Changsha, 410004, Changsha, China

    Yangjun Chen

  2. Department of Computer Science, TU Chemnitz, 09107, Chemnitz, Germany

    Yangjun Chen

Authors
  1. Yangjun Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, Y. OLDTNF-based evaluation method for handling recursive queries in deductive databases. Sci. China Ser. E-Technol. Sci. 41, 561–578 (1998). https://doi.org/10.1007/BF02917039

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation