Skip to main content

Cube Implementations

  • Reference work entry
  • First Online:
Encyclopedia of Database Systems

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 4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 6,499.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Agarwal S, Agrawal R, Deshpande P, Gupta A, Naughton JF, Ramakrishnan R, Sarawagi S. On the computation of multidimensional aggregates. In: Proceedings of the 22th International Conference on Very Large Data Bases; 1996. p. 506–21.

    Google Scholar 

  2. Beyer KS, Ramakrishnan R. Bottom-up computation of sparse and iceberg CUBEs. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1999. p. 359–70.

    Article  Google Scholar 

  3. Gray J, Bosworth A, Layman A, Pirahesh H. Data cube: a relational aggregation operator generalizing group-by, cross-tab, and sub-total. In: Proceedings of the 12th International Conference on Data Engineering; 1996. p. 152–9.

    Google Scholar 

  4. Gupta H. Selection of views to materialize in a data warehouse. In: Proceedings of the 6th International Conference on Database Theory; 1997. p. 98–112.

    Google Scholar 

  5. Gupta H, Mumick IS. Selection of views to materialize under a maintenance cost constraint. In: Proceedings of the 7th International Conference on Database Theory; 1999. p. 453–70.

    Google Scholar 

  6. Harinarayan V, Rajaraman A, Ullman JD. Implementing data cubes efficiently. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1996. p. 205– 16.

    Google Scholar 

  7. Kotsis N, McGregor DR. Elimination of redundant views in multidimensional aggregates. In: Proceedings of the 2nd International Conference on Data Warehousing and Knowledge Discovery; 2000. p. 146–61.

    Chapter  Google Scholar 

  8. Lakshmanan LVS, Pei J, Zhao Y. QC-Trees: an efficient summary structure for semantic OLAP. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2003. p. 64–75.

    Google Scholar 

  9. Lee KY, Kim MH. Efficient incremental maintenance of data cubes. In: Proceedings of the 32nd International Conference on Very Large Data Bases; 2006. p. 823–33.

    Google Scholar 

  10. Morfonios K, Ioannidis Y. CURE for cubes: cubing using a ROLAP engine. In: Proceedings of the 32nd International Conference on Very Large Data Bases; 2006. p. 379–90.

    Google Scholar 

  11. Morfonios K, Ioannidis Y. Supporting the data cube lifecycle: the power of ROLAP. VLDB J. 2008;17(4):729–64.

    Article  Google Scholar 

  12. Morfonios K, Konakas S, Ioannidis Y, Kotsis N. ROLAP implementations of the data cube. ACM Comput Surv. 2007;39(4):12.

    Article  Google Scholar 

  13. Mumick IS, Quass D, Mumick BS. Maintenance of data cubes and summary tables in a warehouse. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1997. p. 100–11.

    Google Scholar 

  14. Poosala V, Ganti V. Fast approximate answers to aggregate queries on a data cube. In: Proceedings of the 11th International Conference on Scientific and Statistical Database Management; 1999. p. 24–33.

    Google Scholar 

  15. Ross KA, Srivastava D. Fast computation of sparse datacubes. In: Proceedings of the 23th International Conference on Very Large Data Bases; 1997. p. 116–25.

    Google Scholar 

  16. Shao Z, Han J, 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; 2004. p. 213–22.

    Google Scholar 

  17. Sismanis Y, Deligiannakis A, Roussopoulos N, Kotidis Y. Dwarf: shrinking the PetaCube. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2002. p. 464–75.

    Google Scholar 

  18. Sismanis Y, Roussopoulos N. The complexity of fully materialized coalesced cubes. In: Proceedings of the 30th International Conference on Very Large Data Bases; 2004. p. 540–51.

    Google Scholar 

  19. Vitter JS, Wang M. Approximate computation of multidimensional aggregates of sparse data using wavelets. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1999. p. 193–204.

    Article  Google Scholar 

  20. Wang W, Feng J, Lu H, Yu JX. Condensed cube: an efficient approach to reducing data cube size. In: Proceedings of the 18th International Conference on Data Engineering; 2002. p. 155–65.

    Google Scholar 

  21. Zhao Y, Deshpande P, Naughton JF. An array-based algorithm for simultaneous multidimensional aggregates. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1997. p. 159–70.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Konstantinos Morfonios or Yannis Ioannidis .

Editor information

Editors and Affiliations

Section Editor information

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Morfonios, K., Ioannidis, Y. (2018). Cube Implementations. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_91

Download citation

Publish with us

Policies and ethics