Skip to main content
SpringerLink
Log in

Encapsulation of intra-operator parallelism in a parallel match operator

  • Conference paper
  • First Online:
Parallel Computation (ACPC 1996)

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

Abstract

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.

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. C.K.Barn, S.Padmanabhan, Join and data redistribution algorithmus for hypercubes, IEEE Transactions on Knowledge and Data Engineering, No 5(1), 1993

    Google Scholar 

  2. N.Biscondi, Parallel databases: a parallel operator of matching, Technical Report, INSA de Lyon, France, 1995

    Google Scholar 

  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,1983

    Google Scholar 

  4. K.Bratbergsengen, Relational Algebra Operations, Lecture Notes in Computer Science, No 503, 1990

    Google Scholar 

  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, 1995

    Google Scholar 

  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, 1995

    Google Scholar 

  7. D.DeWitt, R.Gerber, Multiprocessor hash-based join algorithms, Proc. of the 12th VLDB, Stockholm, Sweden, 1985

    Google Scholar 

  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 1986

    Google Scholar 

  9. D.DeWitt, J.Naughton, J.Burger, Nested Loops revisited, Proceedings on Parallel and Distr.Inf.Sys, San Diego, California, January 1993

    Google Scholar 

  10. G.Graefe, Query Evaluation Techniques for Large Databases, ACM Computing Surveys, No 25(2), 1993

    Google Scholar 

  11. G.Graefe, Volcano, An extensible and parallel query evaluation system, IEEE trans. on Knowledge and Data Eng., No 6(1), 1994

    Google Scholar 

  12. G.Graefe, A.Linville, L.Shapiro, Sort versus Hash Revisited, IEEE Transactions on Knowledge and Data Engineering, vol.6, No 6, 1994

    Google Scholar 

  13. W.Hong, Parallel Query Processing Using Shared Memory Multiprocessors and Disk Arrays, PhD Thesis, University of California, Berkeley, 1992

    Google Scholar 

  14. D.Knuth, The Art of Computer Programming, Vol.3: Sorting and seaching, Addition-Wesley Publishing Company, 1973

    Google Scholar 

  15. P.Mishra, M.Eich, Join Processing in Relational Databases, ACM Computing Surveys, vol 24, No 1, 1992

    Google Scholar 

  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 1989

    Google Scholar 

  17. P.Valduriez, G.Gardarin, Join and semi-join algorithms for a multiprocessor database machine, ACM Transactions on database systems, No 9(1), 1984

    Google Scholar 

  18. P.Valduriez, Parallel Database Systems: Open Problems and New Issues, Distributed and Parallel Databases, No 1, 1993

    Google Scholar 

  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, 1991

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LISI, INSA de Lyon, 69621, Villeurbanne, France

    N. Biscondi & A. Flory

  2. LIP, ENS de Lyon, 69364, Lyon Cedex 07, France

    L. Brunie & H. Kosch

Authors
  1. N. Biscondi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. Brunie
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. Flory
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. H. Kosch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

László Böszörményi

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Biscondi, N., Brunie, L., Flory, A., Kosch, H. (1996). Encapsulation of intra-operator parallelism in a parallel match operator. In: Böszörményi, L. (eds) Parallel Computation. ACPC 1996. Lecture Notes in Computer Science, vol 1127. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61695-0_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-61695-0_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61695-5

  • Online ISBN: 978-3-540-70645-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation