Aggregative closure: an extension of transitive closure
- 7 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 384-391
- https://doi.org/10.1109/icde.1989.47239
Abstract
The aggregative closure operator is defined and its usefulness is demonstrated in a wide variety of applications. The concepts and definitions of closed semirings and the aggregating relational operators provide a mathematical framework for the presentation of algorithms for these applications. A novel algorithm is also presented which is intended for the computation of the aggregate closure. All of these algorithms but the last are generalizations of existing algorithms intended for transitive closure.<>Keywords
This publication has 9 references indexed in Scilit:
- Alpha: an extension of relational algebra to express a class of recursive queriesIEEE Transactions on Software Engineering, 1988
- A graphical query language supporting recursionPublished 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
- Universality of data retrieval languagesPublished by Association for Computing Machinery (ACM) ,1979
- A modification of Warshall's algorithm for the transitive closure of binary relationsCommunications of the ACM, 1975
- A fast expected time algorithm for Boolean matrix multiplication and transitive closureInformation and Control, 1973
- Algorithm 97: Shortest pathCommunications of the ACM, 1962
- A Theorem on Boolean MatricesJournal of the ACM, 1962