A generalized transitive closure for relational queries
- 1 March 1988
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 325-332
- https://doi.org/10.1145/308386.308467
Abstract
We augment relational algebra with a generalized transitive closure operator that allows for the efficient evaluation of a subclass of recursive queries. The operator is based on a composition operator which is as general as possible when the operator is required to be associative and when only relational algebra operators are used in its definition. The closure of such a composition can be computed using the well-known efficient algorithms designed for the computation of the usual transitive closure. Besides the case in which complete materialization of recursive relations are required, our strategy also yields an efficient solution in the case in which a selection is applied to the closure.This publication has 8 references indexed in Scilit:
- One-sided recursionsPublished by Association for Computing Machinery (ACM) ,1987
- On the power of magicPublished by Association for Computing Machinery (ACM) ,1987
- A study of transitive closure as a recursion mechanismPublished by Association for Computing Machinery (ACM) ,1987
- Traversal recursion: a practical approach to supporting recursive applicationsPublished by Association for Computing Machinery (ACM) ,1986
- An amateur's introduction to recursive query processing strategiesPublished by Association for Computing Machinery (ACM) ,1986
- Implementation of logical query languages for databasesACM Transactions on Database Systems, 1985
- Universality of data retrieval languagesPublished by Association for Computing Machinery (ACM) ,1979
- A Theorem on Boolean MatricesJournal of the ACM, 1962