DocumentCode
2873634
Title
A parallel processing strategy for computing transitive closure of a database relation
Author
Guh, Keh-chang ; Charvarria, J.
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., Wisconsin Univ., Milwaukee, WI, USA
fYear
1990
fDate
7-9 Mar 1990
Firstpage
37
Lastpage
43
Abstract
A strategy for parallel computation of transitive closure of a database relation is given. It uses a hashing technique for horizontal data partitioning to achiev high parallelism with a simple scheme of message passing. A performance analysis shows that the strategy may achieve high parallelism with small communication overhead
Keywords
database theory; file organisation; parallel algorithms; relational databases; database relation; hashing technique; horizontal data partitioning; message passing; parallel processing strategy; performance analysis; transitive closure; Algebra; Concurrent computing; Deductive databases; Distributed computing; Distributed databases; Logic; Message passing; Parallel processing; Query processing; Relational databases;
fLanguage
English
Publisher
ieee
Conference_Titel
Databases, Parallel Architectures and Their Applications,. PARBASE-90, International Conference on
Conference_Location
Miami Beach, FL
Print_ISBN
0-8186-2035-8
Type
conf
DOI
10.1109/PARBSE.1990.77115
Filename
77115
Link To Document