Title :
Parallel naive and semi-naive transitive closure evaluation
Author :
Zhou, Xiaofang ; Orlowska, Maria E.
Author_Institution :
Dept. of Comput. Sci., Queensland Univ., St. Lucia, Qld., Australia
Abstract :
Transitive closure operation is an important extension to relational algebra. The two most well-known methods to compute transitive closure are naive and semi-naive approaches. We give the optimal parallel versions of these two algorithms by using double-hash relation distribution for SIMD meshes
Keywords :
database theory; parallel algorithms; relational algebra; relational databases; SIMD meshes; double-hash relation distribution; optimal parallel version; parallel algorithm; parallel naive transitive closure; recursive queries; relational algebra; semi-naive transitive closure; transitive closure evaluation; Algebra; Computer science; Cyclic redundancy check; Database languages; Deductive databases; Equations; Linear systems; Pattern recognition; Performance evaluation; Relational databases;
Conference_Titel :
Computing and Information, 1993. Proceedings ICCI '93., Fifth International Conference on
Conference_Location :
Sudbury, Ont.
Print_ISBN :
0-8186-4212-2
DOI :
10.1109/ICCI.1993.315322
