DocumentCode :
3197966
Title :
Parallel computation of direct transitive closures
Author :
Huang, Yan-Nong ; Cheiney, Jean-Pierre
Author_Institution :
Ecole Nat. Superieure des Telecommun., Paris, France
fYear :
1991
fDate :
8-12 Apr 1991
Firstpage :
192
Lastpage :
199
Abstract :
To efficiently process recursive queries in a DBMS (database management system), a parallel, direct transitive closure algorithm is proposed. Efficiency is obtained by reorganizing the computation order of Warren´s algorithm. The number of transfers among processors depends only on the number of processors and does not depend on the depth of the longest path. The evaluation shows an improvement due to the parallelism and the superiority of the proposed algorithm over recent propositions. The speed of the production of new tuples is very high and the volume of transfers between the sites is reduced
Keywords :
database management systems; information retrieval; DBMS; Warren´s algorithm; database management system; direct transitive closures; parallel computation; recursive queries; Concurrent computing; Context; Costs; Delay; Parallel algorithms; Parallel processing; Partitioning algorithms; Processor scheduling; Proposals; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Engineering, 1991. Proceedings. Seventh International Conference on
Conference_Location :
Kobe
Print_ISBN :
0-8186-2138-9
Type :
conf
DOI :
10.1109/ICDE.1991.131466
Filename :
131466
Link To Document :
بازگشت