This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Seventh International Conference on Information Visualization (IV'03)
A New Algorithm for Transitive Closures and Computation of Recursion in relational Databases
London, England
July 16-July 18
ISBN: 0-7695-1988-1
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?dmax?dout) time and in O(n?dmax?dout) 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 dout 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.
Citation:
Yangjun Chen, "A New Algorithm for Transitive Closures and Computation of Recursion in relational Databases," iv, pp.206, Seventh International Conference on Information Visualization (IV'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.