An Empirical Approach to Query-Subquery Nets with Tail-Recursion Elimination

Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 312)

Abstract

We propose a method called QSQN-TRE for evaluating queries to Horn knowledge bases by integrating Query-Subquery Nets with a form of tail-recursion elimination. The aim is to improve the QSQN method by avoiding materialization of intermediate results during the processing. We illustrate the efficiency of our method by empirical results, especially for tail-recursive cases.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison Wesley (1995)Google Scholar
  2. 2.
    Beeri, C., Ramakrishnan, R.: On the power of magic. J. Log. Program. 10, 255–299 (1991)CrossRefMATHMathSciNetGoogle Scholar
  3. 3.
    Cao, S.T.: On the efficiency of Query-Subquery Nets: an experimental point of view. In: Proceedings of SoICT 2013, pp. 148–157. ACM (2013)Google Scholar
  4. 4.
    Cao, S.T.: An implementation of the QSQN-TRE evaluation methods (2014), http://mimuw.edu.pl/~sonct/QSQNTRE14.zip
  5. 5.
    Cao, S.T., Nguyen, L.A.: An Improved Depth-First Control Strategy for Query-Subquery Nets in evaluating queries to Horn knowledge bases. In: van Do, T., Thi, H.A.L., Nguyen, N.T. (eds.) Advanced Computational Methods for Knowledge Engineering. AISC, vol. 282, pp. 281–296. Springer, Heidelberg (2014)CrossRefGoogle Scholar
  6. 6.
    Cao, S.T., Nguyen, L.A., Szalas, A.: The Web ontology rule language OWL 2 RL+ and Its extensions. T. Computational Collective Intelligence 13, 152–175 (2014)Google Scholar
  7. 7.
    Cao, S.T., Nguyen, L.A., Szalas, A.: WORL: a nonmonotonic rule language for the Semantic Web. Vietnam J. Computer Science 1(1), 57–69 (2014)CrossRefGoogle Scholar
  8. 8.
    Freire, J., Swift, T., Warren, D.S.: Taking I/O seriously: Resolution reconsidered for disk. In: Naish, L. (ed.) Proc. of ICLP 1997, pp. 198–212. MIT Press (1997)Google Scholar
  9. 9.
    Madalińska-Bugaj, E., Nguyen, L.A.: A generalized QSQR evaluation method for Horn knowledge bases. ACM Trans. on Computational Logic 13(4), 32 (2012)Google Scholar
  10. 10.
    Nguyen, L.A., Cao, S.T.: Query-Subquery Nets. In: Nguyen, N.-T., Hoang, K., Jędrzejowicz, P. (eds.) ICCCI 2012, Part I. LNCS, vol. 7653, pp. 239–248. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  11. 11.
    Nguyen, L.A., Cao, S.T.: Query-Subquery Nets (2012), http://arxiv.org/abs/1201.2564
  12. 12.
    Ramakrishnan, R., Srivastava, D., Sudarshan, S.: Efficient bottom-up evaluation of logic programs. In: Vandewalle, J. (ed.) The State of the Art in Computer Systems and Software Engineering. Kluwer Academic Publishers (1992)Google Scholar
  13. 13.
    Ross, K.A.: Tail recursion elimination in deductive databases. ACM Trans. Database Syst. 21(2), 208–237 (1996)CrossRefGoogle Scholar
  14. 14.
    Tamaki, H., Sato, T.: OLD resolution with tabulation. In: Shapiro, E. (ed.) ICLP 1986. LNCS, vol. 225, pp. 84–98. Springer, Heidelberg (1986)CrossRefGoogle Scholar
  15. 15.
    Vieille, L.: Recursive axioms in deductive databases: The query/subquery approach. In: Proceedings of Expert Database Conf., pp. 253–267 (1986)Google Scholar
  16. 16.
    Vieille, L.: Recursive query processing: The power of logic. Theor. Comput. Sci. 69(1), 1–53 (1989)CrossRefMATHMathSciNetGoogle Scholar
  17. 17.
    Zhou, N.-F., Sato, T.: Efficient fixpoint computation in linear tabling. In: Proceedings of PPDP 2003, pp. 275–283. ACM (2003)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Faculty of Information TechnologyVinh UniversityVinhVietnam
  2. 2.Institute of InformaticsUniversity of WarsawWarsawPoland
  3. 3.Faculty of Information TechnologyVNU University of Engineering and TechnologyHanoiVietnam

Personalised recommendations