Skip to main content
Springer Nature Link
Log in

A parallel transitive closure algorithm using hash-based clustering

  • Deduction
  • Conference paper
  • First Online:
Database Machines (IWDM 1989)

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

Included in the following conference series:

  • 146 Accesses

Abstract

The importance of the performance problem brought about by the evaluation of recursive queries brings one to consider parallel execution strategies for the transitive closure operation. Such strategies constitute one of the keys to efficiency in a very large data base environment. In this paper we present a transitive closure algorithm. The innovative aspects of this algorithm concern: 1) the possibility of working with a reasonable amount of memory space without creating extra Inputs/Outputs; 2) the use of on-disk clustering accomplished by double hashing; and 3) the parallelization of the transitive closure operation. The processing time is reduced by a factor of p, where p is the number of processors allocated for the operation. Communication times remain limited; a cyclic organization eliminates the need for serialization of transfers. The evaluation shows the importance of the benefits of a parallel transitive closure execution.

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.

Similar content being viewed by others

7. references

  1. R. Agrawal, H.V. Jagadish: "Direct Algoritms for Computing The Transitive Closure of Database Relations", 13th VLDB, Brighton,1987.

    Google Scholar 

  2. F.Bancilhon, R. Ramakrishnan: "An Amateur's Introduction To Recursive Query Processing Strategies", ACM SIGMOD, Washington, May 1986.

    Google Scholar 

  3. J.P. Cheiney, R. Michel, P. Faudemay, J.M. Thevenin: "A Reliable Multiple Backend Using A Select-join Operator", 12th VLDB, Kyoto, Aug 1986.

    Google Scholar 

  4. J.P. Cheiney, C. De Maindreville: "Relational Storage and Efficient Retrieval of Rules in a Deductive DBMS", 5th Int. Conf. on Data Engineering, Los Angeles, 1989.

    Google Scholar 

  5. D.J. Dewitt et al: "Implementation Techniques for Main Memory Database Systems", ACM SIGMOD, Boston 1984.

    Google Scholar 

  6. D.J. Dewitt et al: "GAMMA— A Hight Performance Dataflow Database Machine", 12th VLDB, Kyoto, Aug 1986.

    Google Scholar 

  7. G. Gardarin, P. Valduriez, Y.Viemont: "Predicate Trees: A Way for Optimizing Relational Queries", Computer Engineering Conf., Los Angeles, 1984.

    Google Scholar 

  8. G. Gardarin: "Efficient Processing of Very Large Databases: A Comparative Analysis of Architectures", IFIP, 1986.

    Google Scholar 

  9. G. Gardarin, P. Pucheral: "A Graph Operator to Process Efficiently Linear Recursive Rules in Main Memory Oriented DBMS", 3rd Database Bresilian Symposium, Recife-Pernambuco, March 1988.

    Google Scholar 

  10. J. Han, G.Qadah, C. Chaou: "The Processing and Evaluation of Transitive Closure Queries", Proc. of EDBT, Venice, 1988.

    Google Scholar 

  11. D.K. Hsiao, S. Demurjian: "Benchmarking Database Systems in Multiple Backend Configuration", A Quatterly Bulletin of the IEEE Computer Society, Technical Comittee on Database Systems, V8, No1, 1985.

    Google Scholar 

  12. Y. Ioannidis, R. Ramakrishnan: "Efficient Transitive Closure Algorithms", 14th VLDB, Los Angeles, 1988.

    Google Scholar 

  13. M. Kitsuregawa et al: "Application of Hash to Database Machines", New Generation Computing, No1, 1983.

    Google Scholar 

  14. F.D. Kubler: "Cluster Oriented Architecture for the Mapping of Parallel Processor Networks to High Performance Applications", Int. Conf. on Super Computing, St Malo, France, 1988.

    Google Scholar 

  15. P. Valduriez, H. Boral: "Evaluation of Recursive Queries Using Join Indices", Int. Conf. on Expert Database Systems, Charleston, South Carolina, April 1986.

    Google Scholar 

  16. P. Valduriez, S. Khoshafian: "Transitive Closure of Transitively Closed Relations", 2nd Int. Conf. on Expert Database Systems, Tysons Lorner, Virginia, April 1988.

    Google Scholar 

  17. P. Valduriez, S Koshafian: "Parallel Evaluation of the Transitive Closure of a Database Relation", Int. Journal of Parallel Programming, Vol 17, No1, Feb. 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ecole Nationale Supérieure des Télécommunications, 46, rue Barrault, 75013, Paris, France

    Jean-Pierre Cheiney

  2. Institut National de la Recherche en Informatique et Automatique Rocquencourt, BP 105, 78153, Le Chesnay Cedex, France

    Christophe de Maindreville

Authors
  1. Jean-Pierre Cheiney
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christophe de Maindreville
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Haran Boral Pascal Faudemay

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cheiney, JP., de Maindreville, C. (1989). A parallel transitive closure algorithm using hash-based clustering. In: Boral, H., Faudemay, P. (eds) Database Machines. IWDM 1989. Lecture Notes in Computer Science, vol 368. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51324-8_43

Download citation

  • DOI: https://doi.org/10.1007/3-540-51324-8_43

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51324-7

  • Online ISBN: 978-3-540-46197-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics