Encapsulation of intra-operator parallelism in a parallel match operator

  • N. Biscondi
  • L. Brunie
  • A. Flory
  • H. Kosch
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1127)


This paper presents a new concept for relational parallel query optimization. We propose to encapsulate the intra-operation parallelism in a parallel match operator realizing most binary relational operations. Our approach integrates the optimization of this operator: a comparative study of the three main match algorithms — Nested Loops, Sort-Merge and Hash — is presented for shared-nothing architecture. It shows that database systems could profit by the implementation of all these algorithms. Futhermore, our match optimizer can be used by the query parallelizer in order to determine an optimal parallel execution strategy for each binary relational operation.


Parallel query optimization match operator algorithm complexity shared-nothing architecture 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    C.K.Barn, S.Padmanabhan, Join and data redistribution algorithmus for hypercubes, IEEE Transactions on Knowledge and Data Engineering, No 5(1), 1993Google Scholar
  2. 2.
    N.Biscondi, Parallel databases: a parallel operator of matching, Technical Report, INSA de Lyon, France, 1995Google Scholar
  3. 3.
    D.Bitton, H.Boral, D.DeWitt, K.Wilkinson, Parallel Algorithms for The Execution of Relational Database Operations, ACM Transactions on Database Systems, No 3,1983Google Scholar
  4. 4.
    K.Bratbergsengen, Relational Algebra Operations, Lecture Notes in Computer Science, No 503, 1990Google Scholar
  5. 5.
    L.Brunie, A.Flory, H.Kosch, New static scheduling and elastic load balancing methods for parallel query processing, Proc. of the BIWIT Conference, IEEE Computer Society Press, San Sebastian, Spain, 1995Google Scholar
  6. 6.
    L.Brunie, H.Kosch, A communications-oriented methodology for load balancing in parallel relational query processing, Advances in Parallel Computing, ParCo Conferences, Gent, Belgium, 1995Google Scholar
  7. 7.
    D.DeWitt, R.Gerber, Multiprocessor hash-based join algorithms, Proc. of the 12th VLDB, Stockholm, Sweden, 1985Google Scholar
  8. 8.
    D.DeWitt, R.Gerber, G.Graefe, M.Heytens, K.Kumar and M.Muralikrishna, GAMMA a high performance dataflow database machine, Proceedings of the International Conference on Very Large Databases, Kyoto, Japan, August 1986Google Scholar
  9. 9.
    D.DeWitt, J.Naughton, J.Burger, Nested Loops revisited, Proceedings on Parallel and Distr.Inf.Sys, San Diego, California, January 1993Google Scholar
  10. 10.
    G.Graefe, Query Evaluation Techniques for Large Databases, ACM Computing Surveys, No 25(2), 1993Google Scholar
  11. 11.
    G.Graefe, Volcano, An extensible and parallel query evaluation system, IEEE trans. on Knowledge and Data Eng., No 6(1), 1994Google Scholar
  12. 12.
    G.Graefe, A.Linville, L.Shapiro, Sort versus Hash Revisited, IEEE Transactions on Knowledge and Data Engineering, vol.6, No 6, 1994Google Scholar
  13. 13.
    W.Hong, Parallel Query Processing Using Shared Memory Multiprocessors and Disk Arrays, PhD Thesis, University of California, Berkeley, 1992Google Scholar
  14. 14.
    D.Knuth, The Art of Computer Programming, Vol.3: Sorting and seaching, Addition-Wesley Publishing Company, 1973Google Scholar
  15. 15.
    P.Mishra, M.Eich, Join Processing in Relational Databases, ACM Computing Surveys, vol 24, No 1, 1992Google Scholar
  16. 16.
    D.Schneider, D.DeWitt, A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment, ACM SIGMOD, Portland, Oregon, USA, June 1989Google Scholar
  17. 17.
    P.Valduriez, G.Gardarin, Join and semi-join algorithms for a multiprocessor database machine, ACM Transactions on database systems, No 9(1), 1984Google Scholar
  18. 18.
    P.Valduriez, Parallel Database Systems: Open Problems and New Issues, Distributed and Parallel Databases, No 1, 1993Google Scholar
  19. 19.
    P.S.Yu, J.Wolf, D.Dias, J.Turek, An effecive algorithm for parallelizing hash joins in the presence of data skew, 7th International Conference on Data Engineering, Kobe, Japan, 1991Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • N. Biscondi
    • 1
  • L. Brunie
    • 2
  • A. Flory
    • 1
  • H. Kosch
    • 2
  1. 1.LISI, INSA de LyonVilleurbanneFrance
  2. 2.LIP, ENS de LyonLyon Cedex 07France

Personalised recommendations