A New Algorithm for Transitive Closures and Computation of Recursion in relational Databases

I
IV
2003
Seventh International Conference on Information Visualization (IV'03)
Abstract - A New Algorithm for Transitive Closures and Computation of Recursion in relational Databases

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Yangjun Chen

Seventh International Conference on Information Visualization (IV'03)

London, England

July 16-July 18

ISBN: 0-7695-1988-1

	ASCII Text	x
	Yangjun Chen, "A New Algorithm for Transitive Closures and Computation of Recursion in relational Databases," Information Visualisation, International Conference on, pp. 206, Seventh International Conference on Information Visualization (IV'03), 2003.

	BibTex	x
	@article{ 10.1109/IV.2003.1217981, author = {Yangjun Chen}, title = {A New Algorithm for Transitive Closures and Computation of Recursion in relational Databases}, journal ={Information Visualisation, International Conference on}, volume = {0}, year = {2003}, issn = {1093-9547}, pages = {206}, doi = {http://doi.ieeecomputersociety.org/10.1109/IV.2003.1217981}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Information Visualisation, International Conference on TI - A New Algorithm for Transitive Closures and Computation of Recursion in relational Databases SN - 1093-9547 SP EP A1 - Yangjun Chen, PY - 2003 KW - null VL - 0 JA - Information Visualisation, International Conference on ER -

Yangjun Chen, Winnipeg University

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IV.2003.1217981

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_max?d_out) time and in O(n?d_max?d_out) 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_out 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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.