Optimization of relational algebra expressions containing recursion operators
Ming-Chien Shan, Marie-Anne Neimat · 1991
Efficient computation of recursive queries is one of the key issues in the development of next generation database management systems.In this paper, we extend the relational algebra with a fixpoint operator that supports the definition of recursive relations.Legal transformation rules on relational algebra expressions with the fixpoint operator are then investigated.They are used to convert relational algebra expressions to equivalent expressions that can be more efficiently evaluated.