On the implementation of a simple class of logic queries for databases
Domenico Saccà, Carlo Zaniolo · 1985
this paper, we study the problem of efficient implementations of queries on recursire rules without function symbols. We focus on an important subclass, called canonical strongly linear queries (CSL queries), and study the binding-passing property, which entails the propagation of the initial bindings (established by constants in the query goal) during the top-down (as in backward chaining) execu- tion phase