Abstract
In the current business scenario, a quick and accurate response is required for business decisions. Data warehouse consists of huge volumes of data repositories. This information is utilized to develop insights for decision-making queries on data, besides it takes a long time to process, resulting in longer response times. This response time must be lowered in order to make effective and efficient decisions. The computation of data cubes is a momentous task in data warehouse design. Pre-computation may significantly reduce the response time and also improve online analytical processing efficiency by computing partially or all or part of a data cube. However, such computing is difficult since it may need a substantial amount of time and storage space. Many authors have suggested algorithms for efficient data cube computation for reducing the time computation and storage cost. In this paper, we have proposed a framework that uses a heuristic approach for data cube computation in the hyper lattice structure.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Inmon WH (1992) Building the data warehouse. QED Information Sciences, Wellesley
Yang J, Karlapalem K, Li Q (1997) A framework for designing materialized views in data warehousing environment. In: Proceedings of the 17th IEEE international conference on distributed computing systems. Maryland, U.S.A.
Shukla A, Deshpande PM, Naughton JF (1998) Materialized view selection for multidimensional datasets. In: Proceedings of the 24th international conference on very large databases. New York, pp 488–499
Gupta H, Mumick IS (2005) Selection of views to materialize in a data warehouse. IEEE Trans Knowl Data Eng 17(1):24–43. https://doi.org/10.1109/TKDE.2005.16
Mann S, Phogat AK (2020) Dynamic construction of lattice of cuboids in data warehouse. J Stat Manage Syst 23(6):971–982
Gosain A, Mann S (2014) Empirical validation of metrics for object oriented multidimensional model for data warehouse. Int J Syst Assur Eng Manage 5:262–327. https://doi.org/10.1007/s13198-013-0155-8
Sen S, Chaki N, Cortesi A (2009) Optimal space and time complexity analysis on the lattice of cuboids using Galois connections for data warehousing. In: 2009 Fourth international conference on computer sciences and convergence information technology. IEEE
Mann S, Gosain A, Sabharwal S (2009) OO approach for developing conceptual model for a data warehouse. J Technol Eng Sci 1(1):79–82
Chaudhari MS, Dhote C (2010) Dynamic materialized view selection algorithm: a clustering approach. In: International conference on data engineering and management. Springer, Berlin, pp 57–66
Kumar TVV, Arun B (2017) Materialized view selection using HBMO. Int J Syst Assur Eng Manage 8(1):379–392
Gosain A, Mann S (2010) Object oriented multidimensional model for a data warehouse with operators. Int J Database Theory Appl 3(4):35–40
Gosain A, Mann S (2013) Space and time analysis on the lattice of cuboid for data warehouse. Int J Comput Appl 77(3)
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
Gosain A (2016) Materialized cube selection using particle swarm optimization algorithm. Procedia Comput Sci 79:2–7
Gosain A, Mann S (2012) An object-oriented multidimensional model for data warehouse. In: Fourth international conference on machine vision (ICMV 2011), computer vision and image analysis; pattern recognition and basic technologies, vol 8350. SPIE
Sen S, Cortesi A, Chaki N (2016) Hyper-lattice algebraic model for data warehousing. Springer International Publishing
Harinarayan V, Rajaraman A, Ullman JD (1996) Implementing data cubes efficiently. In: ACM SIGMOD international conference on management of data. ACM Press, New York, pp 205–216
Amit S, Prasad D, Jeffrey NF (2000) Materialized view selection for multi-cube data models. In: Proceedings of the 7th international conference on extending database technology: advances in database technology. Springer, pp 269–284
Chen Y, Dong G, Han J, Wah BW, Wang J (2002) Multidimensional regression analysis of time series data streams. In: Proceedings of the 2002 international conference on very large databases (VLDB’02). Hong Kong, pp 323–334
Zhang C, Yang J (1999) Genetic algorithm for materialized view selection in data warehouse environments. In: Proceedings of the international conference on data warehousing and knowledge discovery, LNCS, vol 1676, pp 116–125
Prashant R, Mann S, Eashwaran R (2021) Efficient data cube materialization. In: Advances in communication and computational technology. Springer, Singapore, pp 199–210
Phogat AK, Mann S (2022) Optimal data cube materialization in hyper lattice structure in data warehouse environment. J Algebraic Stat 13(1):149–158
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Phogat, A.K., Mann, S. (2023). Hyper Lattice Structure for Data Cube Computation. In: Khanna, A., Polkowski, Z., Castillo, O. (eds) Proceedings of Data Analytics and Management . Lecture Notes in Networks and Systems, vol 572. Springer, Singapore. https://doi.org/10.1007/978-981-19-7615-5_57
Download citation
DOI: https://doi.org/10.1007/978-981-19-7615-5_57
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-7614-8
Online ISBN: 978-981-19-7615-5
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)