PANEL: Logic Programming, Deductive Databases, Expert Database Systems
03 June 1988
We show that every linearly recursive can be expressed as a transitive closure possibly preceded and followed by operations already available in relational algebra such as joins and unions. This reduction is possible even if there are repeated variables in some of the literals and if some of the arguments are constants. We also study the evaluation of these queries as transitive closures and present some techniques to enhance computational efficiency.