Naive Evaluation of Recursively Defined Relations.
François Bancilhon · 1985
We address the problem of evaluating a recursively defined relation. We are given an equation of the form: $$ R = f\left( R \right) $$ where f is a monotonie relational algebra expression and we want to evaluate the least fixpoint of that equation. We first recall that there is a simple naive evaluation of this solution and we argue that its performance is poor because it generates duplicate computations.