Chapter

Methodologies for Intelligent Systems

Volume 869 of the series Lecture Notes in Computer Science pp 193-202

Date:

Efficient execution of recursive queries through controlled binding propagation

  • Sergio GrecoAffiliated withDEIS Dept., Univ. of Calabria
  • , Carlo ZanioloAffiliated withComputer Science Dept., Univ. of California

* Final gross prices may vary according to local VAT.

Get Access

Abstract

This paper presents a new method for the computation of bound linear Datalog queries and compares its performance to that of other bottom-up execution strategies. The technique, called pushdown method, uses virtual stacks to store information on the current state of the evaluation thus ensuring both termination and efficient execution. The asymptotic worst-case behavior and experimental results for the new method compare favorably against those of previous methods.