Skip to main content

OLAP Query Evaluation in a Database Cluster: A Performance Study on Intra-Query Parallelism

  • Conference paper
  • First Online:
Advances in Databases and Information Systems (ADBIS 2002)

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

Abstract

While cluster computing is well established, it is not clear how to co-ordinate clusters consisting of many database components in order to process high workloads. In this paper, we focus on Online Analytical Processing (OLAP) queries, i.e., relatively complex queries whose evaluation tends to be time-consuming, and we report on some observations and preliminary results of our PowerDB project in this context. We investigate how many cluster nodes should be used to evaluate an OLAP query in parallel. Moreover, we provide a classification of OLAP queries, which is used to decide, whether and how a query should be parallelized. We run extensive experiments to evaluate these query classes in quantitative terms. Our results are an important step towards a two-phase query optimizer. In the first phase, the coordination infrastructure decomposes a query into subqueries and ships them to appropriate cluster nodes. In the second phase, each cluster node optimizes and evaluates its sub-query locally.

Project partially supported by Microsoft Research.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. özsu, T., Valduriez, P., Distributed and Parallel Database Systems. ACM Computing Surveys, 28(1):125–128, March 1996.

    Article  Google Scholar 

  2. Röhm, U., Böhm, K., Schek, H.-J., OLAP Query Routing and Physical Design in a Data-base Cluster. Advances in Database Technology, In Proceedings 7th EDBT Conference, pp. 254–268, March 2000.

    Google Scholar 

  3. Röhm, U., Böhm, K., Schek, H.-J., Cache-Aware Query Routing in a Cluster of Data-bases. In Proceedings 17th IEEE ICDE Conference, April 2001.

    Google Scholar 

  4. Kossmann, D., The State of the Art in Distributed Query Processing. ACM Computing Surveys, 32(4): 422–469, September 2000.

    Article  Google Scholar 

  5. Baru, C.K. et al., DB2 Parallel Edition. IBM System Journal, 34(2):292–322, 1995.

    Article  Google Scholar 

  6. Oracle 8i Parallel Server. An Oracle Technical White Paper. January 20, 2000.

    Google Scholar 

  7. Delaney, K., Inside Microsoft SQL Server 2000. Microsoft Press, 2001.

    Google Scholar 

  8. Bozas, G., Jaedicke, Mitschang, B., Reiser, A. Zimmermann, S., On Transforming a Sequential SQL-DBMS into a Parallel One: First Results and Experiences of the MIDAS Project. TUM-I 9625, SFB-Bericht Nr. 342/14/96 A, May 1996.

    Google Scholar 

  9. DeWitt, D.J., Gray, J., Parallel Database Systems: The Future of High Performance Data-base Systems. Communications of the ACM, 35(6):85–98, June 1992.

    Article  Google Scholar 

  10. DeWitt, D.J., et al., The Gamma Database Machine Project. IEEE Transactions on Knowledge and Data Engineering, 2(1):44–62, March 1990.

    Article  Google Scholar 

  11. Boral, H., et. al., Prototyping Bubba, A Highly Parallel Database System. IEEE Transac-tions on Knowledge and Data Engineering, 2(1):4–24, March 1990.

    Article  Google Scholar 

  12. Stonebraker, M., et. al., The Design of XPRS. In Proceedings 14th VLDB Conference, pp. 318–330, September 1988.

    Google Scholar 

  13. Graefe, G., Volcano— An Extensible and Parallel Query Evaluation System. IEEE Trans-actions on Knowledge and Data Engineering, 6(1):120–135, February 1994.

    Article  Google Scholar 

  14. Exbrayat, M., Brunie, L., A PC-NOW based parallel extension for a sequential DBSM. In Proceedings IPDPS 2000 Conference, Cancun, Mexico, 2000.

    Google Scholar 

  15. Tamura, T., Oguchi, M., Kitsuregawa, M., Parallel Database Processing on a 100 node PC Cluster: Cases for Decision Support Query Processing and Data Mining. In Proceedings SC’97 Conference: High Performance Networking and Computing, 1997.

    Google Scholar 

  16. Ganski, R.A., Long, H.K.T. Optimization of Nested SQL Queries Revisited. In Proceedings ACM SIGMOD Conference, pp. 23–33, 1987.

    Google Scholar 

  17. Röhm, U., Böhm, K., Schek, H.-J., Schuldt, H., FAS — A Freshness-Sensitive Coordina-tion Middleware for a Cluster of OLAP Components. In Proceedings 28 th VLDB Conference, 2002.

    Google Scholar 

  18. Shatdal, A., Naughton, J.F., Adaptive Parallel Aggregation Algorithms. In Proceedings ACM SIGMOD Conference, pp. 104–114, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Akal, F., Böhm, K., Schek, HJ. (2002). OLAP Query Evaluation in a Database Cluster: A Performance Study on Intra-Query Parallelism. In: Manolopoulos, Y., Návrat, P. (eds) Advances in Databases and Information Systems. ADBIS 2002. Lecture Notes in Computer Science, vol 2435. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45710-0_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-45710-0_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44138-0

  • Online ISBN: 978-3-540-45710-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics