Skip to main content

Multi-core CPU Based Parallel Cube Algorithms

  • Conference paper
Advanced Research on Computer Science and Information Engineering (CSIE 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 153))

  • 1782 Accesses

Abstract

In recent years, computer hardware technology has greatly developed especially large memory and multi-core, but algorithm efficiency is not beneficial from the development of hardware. The fundamental reason is that there is insufficient utilizing CPU cache, as well as the limitations of single-thread programming. In the field of data warehousing and OLAP, data cube computing is an important and time-consuming operation, how to improve efficiency of data cube calculation is continuing to pursue goals. Based on the characteristics of modern CPU, we have proposed two parallel algorithms TASK_PMW and DATA_SSMW, TASK_PMW is task-based division of the parallel algorithm, each CPU core is responsible for one Cuboid; DATA_SSMW is data partition, and scanned sharing raw data, ensure load balancing, has good scalability and high efficient. Through experiments on dual-core CPU, TASK_PMW improve 1/3, DATA_SSMW 2/3 than the original algorithm.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Gray, J., Chaudhuri, S., Bosworth, A., Layman, A., Reichart, D., Venkatrao, M., Pellow, F., Pirahesh, H.: Data cube: a relational aggregation operator generalizing group-by, cross-tab, and sub-totals. Data Mining and Knowledge Discovery 1(1), 29–53 (1997)

    Article  Google Scholar 

  2. Zhao, Y., Deshpande, P.M., Naughton, J.F.: An array-based algorithm for simultaneous multidimensional aggregates. In: Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 159–170. ACM Press, New York (1997)

    Google Scholar 

  3. Beyer, K., Ramakrishnan, R.: Bottom-up computation of sparse and iceberg CUBEs. In: Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 359–370. ACM Press, New York (1999)

    Google Scholar 

  4. Xin, D., Han, J.W., Li, X.L., Wah, B.W.: Star-Cubing: computing iceberg cubes by top-down and bottom-up integration. In: Proceedings of the 29th International Conference on Very Large Data Bases, pp. 476–487. Morgan Kaufmann Publishers, San Francisco (2003)

    Google Scholar 

  5. Shao, Z., Han, J.W., Xin, D.: MM-Cubing: computing iceberg cubes by factorizing the lattice space. In: Proceedings of the 16th International Conference on Scientific and Statistical Database Management, pp. 213–222. IEEE Computer Society, Washington (2004)

    Google Scholar 

  6. Hurtado, C.A., Mendelzon, A.O., Vaisman, A.A.: Maintaining Data cubes under dimension updates. In: Proceedings of the 15th International Conference on Data Engineering, pp. 346–355. IEEE Computer Society, Washington (1999)

    Google Scholar 

  7. Lee, K.Y., Kim, M.H.: Efficient incremental maintenance of data cubes. In: Proceedings of the 32nd International Conference on Very Large Data Bases, pp. 823–833. ACM Press, New York (2006)

    Google Scholar 

  8. Dehne, F., Eavis, T., Hambrusch, S., Rau-Chaplin, A.: Parallelizing the data CUBE. Distributed and Parallel Databases 11(2), 181–201 (2002)

    MATH  Google Scholar 

  9. Dehne, F., Eavis, T., Rau-Chaplin, A.: Cluster architecture for parallel data warehousing. In: Proc. IEEE International Conference on Cluster Computing and the Grid (CCGrid 2001), Brisbane, Australia (2001)

    Google Scholar 

  10. Ng, R., Wagner, A., Yin, Y.: Iceberg-cube computation with PC clusters. In: Proceedings of SIGMOD Conference on Management of Data, Santa Barbara, California, pp. 25–36 (2001)

    Google Scholar 

  11. Han, W., Kwak, W., Lee, J., Lohman, G.M., Markl, V.: Parallelizing query optimization. In: Proceeding of 2008 VLDB, Auckland, New Zealand, pp. 188–200 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhou, G., Zhang, H. (2011). Multi-core CPU Based Parallel Cube Algorithms. In: Shen, G., Huang, X. (eds) Advanced Research on Computer Science and Information Engineering. CSIE 2011. Communications in Computer and Information Science, vol 153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21411-0_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21411-0_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21410-3

  • Online ISBN: 978-3-642-21411-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics