Skip to main content
SpringerLink
Log in

Parallel transitive closure computation in highly scalable multiprocessors

  • Databases And Information Systems
  • Conference paper
  • First Online:
Advances in Computing and Information — ICCI '91 (ICCI 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 497))

Included in the following conference series:

Abstract

Computation of transitive closure is a fundamental problem in the area of computer algorithms and among others a central issue in the process of integrating database and knowledgebase systems. Although a plethora of sequential transitive closure algorithms have been developed, parallel transitive closure algorithms are rather scarce. Moreover, the few existing parallel algorithms have severe limitations in terms of (a) load balancing, (b) sufficient utilization of the allocated processors, and (c) in ability to take advantage of highly scalable parallel architectures. In this paper we present and analyze two parallel algorithms — PAR-TC and GPAR-TC — for the computation of the transitive closure of a binary database relation. Algorithm PAR-TC is a straightforward parallelization of an existing sequential algorithm [10,22,14]. In many cases, PAR-TC attains significant speedup over its sequential counterpart. In the worst case the speedup is marginal as this algorithm is also subject to the three limitations stated above. Nevertheless, algorithm GPAR-TC which is is a refinement of PAR-TC remedies all three limitations. In the worst case, GPAR-TC is at least as good as PAR-TC; and if a perfect hashing function is available for each value set of the two attributes of the input binary relation, then the speedup of GPAR-TC over the sequential algorithm is proportional to the number of processors available in the system. This last property makes algorithm GPAR-TC especially suitable for highly scalable parallel architectures.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arlazarov, V. L., Dinic, E. A., Kronrod, M. A., and Faradzev, I. A. “On Economical Construction of the Transitive Closure of an Oriented Graph”, Soviet Math. Doklady, 11, 1970, 1209–1210.

    Google Scholar 

  2. Agrawal, R., Borgida A., and Jagadish, H., “Efficient management of transitive relationships in large data and knowledge bases”, ACM SIGMOD, 1989, 253–262.

    Google Scholar 

  3. Agrawal, R. and Jagadish, H.V. “Direct Algorithms For Computing the transitive closure Of Database Relations”, 13-th VLDB, Brighton, England, Sept. 1987.

    Google Scholar 

  4. Agrawal, R. and Jagadish, H.V. “Multiprocessor Transitive Closure Algorithms”, Proc. Inter. Symp. on Databases in Parallel and Distributed Systems, Austin, Texas, 1988, pp. 56–66.

    Google Scholar 

  5. Baker, J.J. “A note on Multiplying Boolean Matrices”, CACM, 1962, 102.

    Google Scholar 

  6. Dewitt, D. J. and Gerber, R., “Multiprocessor Hash-Based Join Algorithms”, 11-th VLDB, 1985, pp. 151–164.

    Google Scholar 

  7. Dewitt, D. J. et al., “Implementation Techniques for Large Main Memory Database Systems”, ACM SIGMOD, 1984.

    Google Scholar 

  8. Bancilhon, F. and Ramakrishnan, R. “An Amateur's Introduction to Recursive Query Processing Strategies” ACM SIGMOD, 1986, 16–52.

    Google Scholar 

  9. Ioannidis, Y.E. and ramble, R., “Efficient Transitive Closure of Relational Operators”, 14-th VLDB, Los Angeles, California, 1988, pp. 382–394.

    Google Scholar 

  10. Ioannidis, Y.E., “On the Computation of the Transitive Closure of Relational Operators”, 12-th VLDB, Kyoto, Japan, 1986, pp. 403–411.

    Google Scholar 

  11. Jagadish, H.V., Agrawal, R., and Ness, L. “A Study of Transitive Closure as a Recursion Mechanism” ACM SIGMOD, May 1987, 331–344.

    Google Scholar 

  12. Lakshmi, M. S. and Yu, P. S., “Effect of Skew in Join Performance in Parallel Architectures”, Inter. Symp. on Databases in Parallel and Distributed Systems, Austin Texas, December 1988.

    Google Scholar 

  13. Lu, H., “New Strategies for Computing the Transitive Closure of a Database Relation”, 13-th VLDB, Brighton, England, 1987, pp. 267–247.

    Google Scholar 

  14. Lu, H., Mikkilineni, K., and Richrardson, J.P., “Design and Evaluation of Algorithms to Compute the Transitive Closure of a Database Relation” Proc. IEEE 3-rd Inter. Conf. Data Engineering, Los Angeles, Feb. 1987, pp. 112–119.

    Google Scholar 

  15. Naughton, J.F., Ramakrishnan, R., Sagiv, Y., and Ullman, J.D., “Efficient evaluation of right-, left-, and multi-linear rules”, ACM SIGMOD, 1989, pp. 235–242.

    Google Scholar 

  16. Qadah, G. Z. “The Equi-Join Operator on a Multiprocessor Machine: Algorithms and the Evaluatin of their Performance”, Database Machines, 4-th Inter. Workshop, Spronger-Verlag, 1985, pp. 35–67.

    Google Scholar 

  17. Guh, K.C., and Yu, C.T., “Evaluation of Transitive Closure in Distributed Database Systems”, IEEE Journal on Selected Areas in Communications, 7, 1989, pp. 399–407.

    Article  Google Scholar 

  18. Schmitz, L., “An Improved Transitive Closure Algorithm”, Computing 30, 1983, pp. 359–371.

    Google Scholar 

  19. Schnorr, C.P. “An Algorithm for transitive closure with Linear Expected Time”, SIAM J. Computing 7, 1978, pp. 127–133.

    Article  Google Scholar 

  20. Toptsis, A.A., Yu, C.T., and Nelson, P.C., “Computing the Transitive Closure of Symmetric Matrices”, Proc. Inter. Conf. on Computing and Information (ICCI '90), Niagara Falls, Canada, May 1990, pp. 149–154. (also in Lecture Notes on Computer Science, Springer-Verlag.)

    Google Scholar 

  21. Toptsis, A.A., Yu, C.T., and Nelson, P.C., “Benchmarking two Types of Restricted Transitive Closure Algorithms”, Proc. COMPSAC '90, Chicago, Illinois, Oct. 1990, pp. 375–381.

    Google Scholar 

  22. Valduriez, P. and Boral, H., “Evaluation of Recursive Queries Using Join Indices” Proc. 1-st Inter. Conf. on Expert Database Systems, Charleston, 1986, pp. 197–208.

    Google Scholar 

  23. Valduriez, P. and Khoshafian, S., “Transitive Closure of Transitevely Closed Relations”, Proc. 2-nd Inter. Conf. on Expert Database Systems, 1988, pp. 177–185.

    Google Scholar 

  24. Warren, H., Jr. “A Modification of Warshall's Algorithm for the transitive closure of Binary Relations”. CACM 18, 1975, pp. 218–220.

    Google Scholar 

  25. Warshall, S., “A Theorem on Boolean Matrices”, Journal of the ACM 9, 1962, pp. 11–12.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Mathematics, York University, Atkinson College, M3J 1P3, Toronto, Ontario, Canada

    Anestis A. Toptsis

Authors
  1. Anestis A. Toptsis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frank Dehne Frantisek Fiala Waldemar W. Koczkodaj

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Toptsis, A.A. (1991). Parallel transitive closure computation in highly scalable multiprocessors. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '91. ICCI 1991. Lecture Notes in Computer Science, vol 497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54029-6_169

Download citation

  • DOI: https://doi.org/10.1007/3-540-54029-6_169

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54029-8

  • Online ISBN: 978-3-540-47359-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation