multiprocessor transitive closure algorithms
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.
multiprocessor algorithm parallel algorithm computation database relation message-passing architecture experimentation verification shared memory