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

Conference paper

DOI: 10.1007/978-3-319-10518-5_9

Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 312)
Cite this paper as:
Cao S.T., Nguyen L.A. (2015) An Empirical Approach to Query-Subquery Nets with Tail-Recursion Elimination. In: Bassiliades N. et al. (eds) New Trends in Database and Information Systems II. Advances in Intelligent Systems and Computing, vol 312. Springer, Cham

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.

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