A parallel processing strategy for computing transitive closure of a database relation
K.-C. Guh, J. Charvarria · 2002
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.>