By Topic

A new algorithm for transitive closures and computation of recursion in relational databases

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Yangjun Chen ; Dept. Bus. Comput., Winnipeg Univ., Man., Canada

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, dmax 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.

Published in:

Information Visualization, 2003. IV 2003. Proceedings. Seventh International Conference on

Date of Conference:

16-18 July 2003