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.
No takes yet. Share an insight, caveat, or question.
Agrawal et al. (1988) studied this question.