Multiprocessor transitive closure algorithms

  • Authors:
  • R. Agrawal;H. V. Jagadish

  • Affiliations:
  • AT&T Bell Laboratories, Murray Hill, New Jersey;AT&T Bell Laboratories, Murray Hill, New Jersey

  • Venue:
  • DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.