Skip to main content
SpringerLink
Log in

Efficient Data Cube Materialization

  • Conference paper
  • First Online:
Advances in Communication and Computational Technology (ICACCT 2019)

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 668))

Abstract

In the field of business intelligence, we require the analysis of multidimensional data with the need for it being fast and interactive. Data warehousing and OLAP approaches have been developed for this purpose in which the data is viewed in the form of a multidimensional data cube which allows interactive analysis of the data in various levels of abstraction presented in a graphical manner. In data cube, there may arise a need to materialize a particular cuboid given that some other cuboid is presently materialized, in this paper, we propose an algorithm for cuboid materialization starting from a source cuboid to the target cuboid in an optimal way such that the intermediate cuboids consume less space and require lower time to generate by making sure those cuboids have the least number of rows compared to other valid cuboids available for selection, by sorting them based on the product of cardinalities of dimensions present in each cuboid.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.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

Similar content being viewed by others

References

  1. Mankad D, Dholakiya P (2013) The study on data warehouse design and usage. Int J Sci Res Publ

    Google Scholar 

  2. Li X, Han J, Gonzalez H (2004) High dimensional OLAP: a minimal cubing approach. In: Proceedings of the 2004 international conference very large databases (VLDB’04), Toronto Canada, pp 528–539

    Google Scholar 

  3. Harinarayan V, Ullman RA (1996) Implementing data cubes efficiently. In: ACM SIGMOD international conference on management of data, ACM Press, New York, pp 205–216

    Google Scholar 

  4. Stefanovic N, Han J, Koperski K (2000) Object-based selective materialization for efficient implementation of spatial data cubes. In: IEEE transaction on knowledge and data engineering, pp 938–958

    Google Scholar 

  5. Sanjay G, Alok C (1997) Parallel data cube construction for high performance online analytical processing. In: IEEE international conference, pp 10–14

    Google Scholar 

  6. Zhang C, Yang J (199) Genetic algorithm for materialized view selection in data warehouse environments. In: Proceedings of the international conference on data warehousing and knowledge discovery, vol 1676. LNCS, pp 116–125

    Google Scholar 

  7. Ivanova A, Rachev B (2004) Multidimensional models-constructing data cube. In: International conference on computer systems and technologies CompSysTech’2004

    Google Scholar 

  8. Shukla A, Deshpande PM, Naughton JF (1998) Materialized view selection for multidimensional datasets. In: Proceeding of the 24th international conference on very large databases, New York, pp 488–499

    Google Scholar 

  9. Gupta H (1997) selection of views to materialize in a data warehouse. ICDT, Delphi Greece

    Google Scholar 

  10. Shukla A, Deshpande PM, Naughton JF (2000) Materialized view selection for multi-cube data models. In: 7th international conference on extended database technology. Springer, Germany, pp 269–284

    Google Scholar 

  11. Sundarajan M, Yan Q (2017) Simple and efficient MapReduce algorithm for data cube materialization. Googleplex, Mountain View, CA

    Google Scholar 

  12. Gupta H, Mumick IS (1999) Selection of views to materialize under maintenance cost constraint. In: Proceedings of the 7th international conference on database theory (ICDT’99), Jerusalem, Israel, pp 453–470

    Google Scholar 

  13. Wen LY, Chung KI (2004) A genetic algorithm for OLAP data cubes. Knowl Inf Syst 6(1):83–102

    Article  Google Scholar 

  14. Mami I, Coletta R, Bellahsene Z (2011) Modeling view selection as a constraint satisfaction problem. In: DEXA, pp 396–410

    Google Scholar 

  15. Aouiche K, Jouve P, Darmont J (2006) Clustering-based materialized view selection in data warehouses. In ADBIS’06, volume 4152 of LNCS, pp 81–95

    Google Scholar 

  16. Mami I, Bellahsene Z (2012) A survey of view selection method. SIGMOD Rec 41(1):20–30

    Google Scholar 

  17. Deshpande MP, Agarwal S, Naughton JF, Ramakrishnan R (1997) Computation of multidimensional aggregates. University of Wisconsin Madison, Technical Report

    Google Scholar 

  18. Antoaneta I, Boris R (2004) Multidimensional models constructing data cube. In: international conference on computer systems and technologies-CompSysTech’2004, vol 5, pp 1–7

    Google Scholar 

  19. Soumya S, Nabendu C (2011) Efficient traversal in data warehouse based on concept hierarchy using galois connections. In: Proceedings of the second international conference on emerging applications of information technology, pp 335–339

    Google Scholar 

  20. Soumya S, Nabendu C, Agostino C (2009) Optimal space and time complexity analysis on the lattice of cuboids using Galois connections for the data warehousing. In: Proceedings of the 2009, international conference on computer science and convergence information technology, pp 1271–1275

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Maharaja Surajmal Institute of Technology, GGSIPU, New Delhi, 110059, India

    Raghu Prashant, Mann Suman & Raghu Eashwaran

Authors
  1. Raghu Prashant
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mann Suman
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Raghu Eashwaran
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Raghu Prashant .

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, University of Maryland Eastern Shore, Princess Anne, MD, USA

    Gurdeep Singh Hura

  2. Department of Master of Computer Applications, National Institute of Technology Kurukshetra, Kurukshetra, Haryana, India

    Ashutosh Kumar Singh

  3. Department of Information Science and Technology, Multimedia University, Jalan Ayer Keroh Lama, Melaka, Malaysia

    Lau Siong Hoe

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Prashant, R., Suman, M., Eashwaran, R. (2021). Efficient Data Cube Materialization. In: Hura, G.S., Singh, A.K., Siong Hoe, L. (eds) Advances in Communication and Computational Technology. ICACCT 2019. Lecture Notes in Electrical Engineering, vol 668. Springer, Singapore. https://doi.org/10.1007/978-981-15-5341-7_16

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-5341-7_16

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-5340-0

  • Online ISBN: 978-981-15-5341-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation