Parallel naive and semi-naive transitive closure evaluation

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.<
>