On the Efficiency of Query-Subquery Nets with Right/Tail-Recursion Elimination in Evaluating Queries to Horn Knowledge Bases

Conference paper

DOI: 10.1007/978-3-319-17996-4_22

Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 358)
Cite this paper as:
Cao S.T. (2015) On the Efficiency of Query-Subquery Nets with Right/Tail-Recursion Elimination in Evaluating Queries to Horn Knowledge Bases. In: Le Thi H., Nguyen N., Do T. (eds) Advanced Computational Methods for Knowledge Engineering. Advances in Intelligent Systems and Computing, vol 358. Springer, Cham

Abstract

We propose a method called QSQN-rTRE for evaluating queries to Horn knowledge bases. It is an extension of QSQN-TRE by applying elimination not only to the tail-recursive predicates but also to all the intensional predicates that appear rightmost in the bodies of the program clauses. The aim is to avoid materializing intermediate results for the mentioned cases during the processing. As a consequence, it takes the advantage of reducing the number of kept tuples and subqueries in the computer memory as well as the number of read/write operations on relations. The efficiency of our method is illustrated by empirical results.

Keywords

Horn knowledge bases deductive databases query processing optimization methods QSQ QSQN QSQN-TRE QSQN-rTRE 

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

Personalised recommendations