Skip to main content
SpringerLink
Log in

Parallel query processing with zigzag trees

  • Published:
The VLDB Journal Aims and scope Submit manuscript

Abstract

In this article, we describe our approach to the compile-time optimization and parallelization of queries for execution in DBS3 or EDS. DBS3 is a shared-memory parallel database system, while the EDS system has a distributed-memory architecture. Because DBS3 implements a parallel dataflow execution model, this approach applies to both architectures. Using randomized search strategies enables the exploration of a search space large enough to include zigzag trees, which are intermediate between left-deep and right-deep trees. Zigzag trees are shown to provide better response time than right-deep trees in case of limited memory. Performance measurements obtained using the DBS3 prototype show the advantages of zigzag trees under various conditions.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Bergsten, B., Couprie, M., and Valduriez, P. Prototyping DBS3, a shared-memory parallel database system.Proceedings of the International Conference on Parallel and Distributed Information Systems, Miami Beach, Florida, 1991.

  • Bitton, D., DeWitt, D.J., and Turbyfill, C. Benchmarking database systems—A systematic approach.Proceedings of the International Conference on Very Large Databases, Florence, Italy, 1983.

  • Boral, H., Alexander, W., Clay, L., Copeland, G., Danforth, S., Franklin, M., Hart, B., Smith, M., and Valduriez, P. Prototyping BUBBA, a highly parallel database system.IEEE Transactions on Knowledge and Data Engineering, 2(1):4–24, 1990.

    Google Scholar 

  • Borla-Salamet, P., Chachaty, C., and Dageville, B. Compiling control into queries for parallel execution management.Proceedings of the International Conference on Parallel and Distributed Information Systems, Miami Beach, Florida, 1991.

  • Chen, M.-S., Lo, M., Yu, P.S., and Young, H.C. Using segmented right-deep trees for the execution of pipelined hash joins.Proceedings of the International Conference on Very Large Databases, Vancouver, British Columbia, 1992a.

  • Chen, M.-S., Yu, P.S., and Wu, K.-L. Scheduling and processor allocation for parallel execution of multi-join queries.Proceedings of the International Conference on Data Engineering, Tempe, Arizona, 1992b.

  • DeWitt, D.J. and Gerber, R. Multiprocessor hash-based join algorithms.Proceedings of the International Conference on Very Large Databases, Stockholm, Sweden, 1985.

  • DeWitt, D.J. and Gray, J. Parallel database systems. The future of database processing or a passing fad?ACM SIGMOD Record, 19(4):104–112, 1990.

    Google Scholar 

  • Ganguly, S., Hasan, W., and Krishnamurty, R. Query optimization for parallel execution.Proceedings of the ACM SIGMOD, San Diego, California, 1992.

  • Gardarin, G. and Valduriez, P. ESQL2: An extended SQL2 with f-logic semantics.Proceedings of the International Conference on Data Engineering, Tempe, Arizona, 1992.

  • Gardarin, G. and Valduriez, P. Join and semijoin algorithms for a multiprocessor database machine.ACM Transactions on Database Systems, 9(1):133–161, 1984.

    Google Scholar 

  • Graefe, G. Volcano: An extensible and parallel dataflow query processing system. Computer Science Technical Report, Oregon Graduate Center, Beaverton, Oregon, June, 1989.

    Google Scholar 

  • Graefe, G. Encapsulation of parallelism in the Volcano query processing system.Proceedings of the ACM SIGMOD, Atlantic City, New Jersey, 1990.

  • Graefe, G. and Ward, K. Dynamic query evaluation plans.Proceedings of the ACM SIGMOD, Portland, Oregon, 1989.

  • Hong, W. Exploiting inter-operation parallelism in XPRS.Proceedings of the ACM SIGMOD, San Diego, California, 1992.

  • Hong, W. and Stonebraker, M. Optimization of parallelism query execution plans in XPRS.Proceedings of the International Conference on Parallel and Distributed Information Systems, Miami Beach, Florida, 1991.

  • Ioannidis, Y. and Cha Kang, Y. Left-deep vs. bushy trees: An analysis of strategy spaces and its implications for query optimization.Proceedings of the ACM SIGMOD, Denver, Colorado, 1991.

  • Lanzelotte, R.S.G. and Valduriez, P. Extending the search strategy in a query optimizer.Proceedings of the International Conference on Very Large Databases, Barcelona, Spain, 1991.

  • Lanzelotte, R.S.G., Valduriez, P., and Zaït, M. Optimization of object-oriented recursive queries using cost-controlled strategies.Proceedings of the ACM SIGMOD, San Diego, California, 1992.

  • Lohman, G., Mohan, C., Haas, L., Daniels, D., Lindsay, B., Selinger, P., Wilms, P. Query processing in R*. In: Kim, W., Reiner, D.S., and Batory, D.S., eds.Query Processing in Database Systems. Berlin: Springer-Verlag, 1985, pp. 31–47.

    Google Scholar 

  • Stonebraker, M., Katz, R., Patterson, D., and Ousterhout, J. The design of xprs.Proceedings of the International Conference on Very Large Databases, Los Angeles, California, 1988.

  • Schneider, D.A. Technical report #965. Ph.D. thesis, University of Wisconsin, 1990.

  • Schneider, D.A. and DeWitt, D.J. A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment.Proceedings of the ACM SIGMOD, Portland, Oregon, 1989.

  • Schneider, D.A. and DeWitt, D.J. Tradeoffs in processing complex join queries via hashing in multiprocessor database machines.Proceedings of the International Conference on VLDB, Brisbane, Australia, 1990.

  • Selinger, P.G., Astrahan, M.M., Chamberlin, D.D., Lorie, R.A., and Price, T.G. Access path selection in a relational database management system.Proceedings of the ACM SIGMOD, Boston, Massachusetts, 1979.

  • Swami, A. Optimization of large join queries: Combining heuristics and combinational techniques.Proceedings of the ACM SIGMOD, Portland, Oregon, 1989.

  • Wilschut, A.N. and Apers, P.M.G. Dataflow query execution in a parallel main-memory environment.Proceedings of the International Conference on Parallel and Distributed Information Systems, Miami Beach, Florida, 1991.

  • Zaït, M. Access method selection in a parallel database system (in French). Master's thesis, Université Paris 6, 1990.

  • Ziane, M., Zaït, M., and Borla-Salamet, P. Parallel query processing in DBS3.Proceedings of the International Conference on Parallel and Distributed Information Systems, San Diego, California, 1993.

Download references

Author information

Authors and Affiliations

  1. Université Paris 5, Paris, France

    Mikal Ziane Ph.D. (Assistant Professor)

  2. Institut National de Recherche en Informatique et en Automatique (INRIA), Rocquencourt, F-78153, Le Chesnay Cedex, France

    Mikal Ziane Ph.D. (Assistant Professor) & Mohamed Zaït Ph.D. student, Projet Rodin

  3. Bull Research Center, Les Clayes sous Bois, France

    Pascale Borla-Salamet Ph.D. (Researcher)

Authors
  1. Mikal Ziane Ph.D.
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohamed Zaït Ph.D. student, Projet Rodin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pascale Borla-Salamet Ph.D.
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ziane, M., Zaït, M. & Borla-Salamet, P. Parallel query processing with zigzag trees. VLDB Journal 2, 277–301 (1993). https://doi.org/10.1007/BF01228672

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01228672

Key Words

Search

Navigation