Data fragmentation for parallel transitive closure strategies

Share/Save/Bookmark

Houtsma, Maurice A.W. and Apers, Peter M.G. and Schipper, Gideon L.V. (1993) Data fragmentation for parallel transitive closure strategies. In: Ninth International Conference on Data Engineering, April19-23, 1993, Vienna, Austria (pp. pp. 447-456).

open access
[img]
Preview
PDF
955kB
Abstract:Addresses the problem of fragmenting a relation to make the parallel computation of the transitive closure efficient, based on the disconnection set approach. To better understand this design problem, the authors focus on transportation networks. These are characterized by loosely interconnected clusters of nodes with a high internal connectivity rate. Three requirements that have to be fulfilled by a fragmentation are formulated, and three different fragmentation strategies are presented, each emphasizing one of these requirements. Some test results are presented to show the performance of the various fragmentation strategies
Item Type:Conference or Workshop Item
Copyright:©1993 IEEE
Research Group:
Link to this item:http://purl.utwente.nl/publications/19263
Official URL:http://dx.doi.org/10.1109/ICDE.1993.344036
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 119786