H. V. Jagadish Linda Ness Rakesh Agrawal ACM SIGMOD Conference 1987 16 3 331 344 We show that everv linearly recursive query can be expressed as a transitive closure possibly preceded and followed by operations already available in relational algebra. This reduction is possible even if there are repeated variables in the recursive lit