Key points are not available for this paper at this time.
We present parallel algorithms to compute the transitive closure of a database relation. These algorithms are applicable both on shared-memory and message-passing architectures. Experimental verification shows an almost linear speed-up with these algorithms.
Agrawal et al. (Mon,) studied this question.