July 16, 2003 to July 18, 2003
Yangjun Chen , Winnipeg University
Abstract In this paper, we propose a new algorithm for computing recursive closures. The main idea behind this algorithm is tree labeling and graph decomposition, based on which the transitive closure of a directed graph can be computed in O(e?d<sub>max</sub>?d<sub>out</sub>) time and in O(n?d<sub>max</sub>?d<sub>out</sub>) space, where n is the number of the nodes of the graph, e is the numbers of the edges, d max is the maximal indegree of the nodes, and d<sub>out</sub> is the average outdegree of the nodes. Especially, this method can be used to efficiently compute recursive relationships of a directed graph in a relational environment.
Yangjun Chen, "A New Algorithm for Transitive Closures and Computation of Recursion in relational Databases", IV, 2003, 2013 17th International Conference on Information Visualisation, 2013 17th International Conference on Information Visualisation 2003, pp. 206, doi:10.1109/IV.2003.1217981