Optimal Data Cube Computation In Serial Processing

Main Article Content

Ajay Kumar Phogat
Suman Mann

Keywords

Cuboid computation, data cube, multidimensional model, OLAP

Abstract

In the business intelligence area there is a need for multidimensional data analysis which makes it fast and interactive. Data warehousing and online analytical processing policies have come in existence for this purpose, in which the data may see as a Multi-dimensional data cube, which allows interactive and different ways of analysis of data at different levels and displayed in image form so that calculating the data cube efficiently is great and significance greatly reduces the response time of the entire system. There are various basis to do this but widely used map-reduction algorithms, are effective data cube calculation procedures that utilize parallel systems for faster computation but their basic drawback is they are tied to the system's hardware environment and fail to be efficient on a single thread system, so we introduce the lowest first method, which is a sequential algorithm, which works efficiently in a single thread environment and performs data cube calculations in linear time this is possible for each query, without the need for complex systems such as distributed clusters by focusing on intermediate cuboids and better calculating their values as opposed to
Result: MR-cube policies based on dividing search space into batch areas may fail to lead to the proper division of work and sub-optimal results when executed sequentially. It took only 168.23 milliseconds to generate the total cuboid presented in this research work enabled by the non-heuristic nature of the lowest-first approach making it outperform other optimizers.
Conclusion: The preprocessing time complexity of the algorithm is O(nlogn) and query time complexity is O(n) which gives the best path of computing a cuboid starting from base cuboid representing data cube and for the preprocessing it may extended its use cases to bulk path finding queries over the prescribes data warehouse where q >> log(n).

Abstract 178 | pdf Downloads 171

References

1. X. Li, J. Han, and H. Gonzalez, “High dimensional OLAP: A Minimal cubing approach”, 30th International Conference on Very Large Databases (VLDB'04), Toronto Canada, Aug. 2004, pp.528-539.
2. V. Harinarayan, Rajaraman, A, Ullman, “Implementing Data Cubes Efficiently", In ACM SIGMOD International Conference on Management of Data, ACM Press, New York, 1996 pp.205-216.
3. S. Sen and N. Chaki, "Efficient Traversal in Data Warehouse Based on Concept Hierarchy Using Galois Connections," Second International Conference on Emerging Applications of Information Technology, 2011, pp. 335- 339, doi: 10.1109 EAIT.2011.69.
4. S. Sen, N. Chaki and A. Cortesi, "Optimal Space and Time Complexity Analysis on the Lattice of Cuboids Using Galois Connections for Data Warehousing," Fourth International Conference on Computer Sciences and Convergence Information Technology, 2009, pp. 1271-1275, doi: 10.1109/ICCIT.2009.185.
5. Stefanovic, N., Han, J., Koperski, K. “Object-Based Selective Materialization for Efficient Implementation of Spatial data cubes”, IEEE Transaction on Knowledge and Data Engineering, 2000, pp 938-958
6. M.P. Deshpande, S. Agarwal, J.F. Naughton, R. Ramakrishnan, “Computation of Multi-dimensional Aggregates" University of Wisconsin Madison, Technical Report, 1997
7. L.Y. Wen, K.I. Chung, “A genetic algorithm for OLAP data cubes" Knowledge and information systems, January 2004, volume 6, Issue1, pp 83-102. 8. Aouiche K., Jouve PE., Darmont J., “Clustering-Based Materialized View Selection in Data Warehouses”, https://doi.org/10.1007/11827252_9
9. I. Antoaneta, R Boris, “Multidimensional models constructing data cube" Int. conference on computer systems and technologies-CompSysTech2004, V-5 pp1-7
10. Mami and Z. Bellahsene," A survey of view selection method" SIGMOD Record, March 2012 Vol. 41, No. 1, pp20-30.
11. I. Mami, R. Coletta, and Z. Bellahsene, “Modeling view selection as a constraint satisfaction problem", In DEXA, pp396-410, 2011
12. S. Mann, A. Gosain, and S. Sabaharwal. “OO Approach for Developing Conceptual Model for a Data Warehouse." Journal of Technology and Engineering Science", 2009, volume1 pp. 79-82.
13. H. Gupta, I.S. Mumick, “Selection of views to materialize under maintenance cost constraint” In 7th International Conference on Database Theory (ICDT'99) Jerusalem, Israel, pp. 453-470, 1999
14. Anjana Gosain, Suman Mann, “Object Oriented Multidimensional Model for a Data Warehouse with Operators", International Journal of Database Theory and Application, 2010, Vol. 3, No. 4.
15. Gosain, A., Mann, S. “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, p. 83500I.
16. Gosain, Anjana, and Suman Mann., “Space and Time Analysis on the Lattice of Cuboid for Data Warehouse." International Journal of Computer Applications, 2013, volume 77 No.3.
17. C. Zhang and J. Yang, “Genetic algorithm for materialized view selection in data warehouse environments," Proceedings of the International Conference on Data Warehousing and Knowledge Discovery, LNCS, vol.1676,
18. pp. 116-125, 1999 19. Gosain, A., Mann, S. Empirical validation of metrics for object oriented multidimensional model for data warehouse. International Journal of System Assurance Engineering Management 5, 262–275 (2014). https://doi.org/10.1007/s13198-013-0155-8
20. Antoaneta Ivanova, Boris Rachev, “Multidimensional models constructing data cube", International Conference on Computer Systems and Technologies CompSys-Tech '2004.
21. S. Mann, Bharti and P. Singh, "Empirical validation of multidimensional model for data warehouse," Proceedings of 3rd International Conference on Reliability, Infocom Technologies and Optimization, 2014, pp. 1-6
22. A. Shukla, PM Deshpande, JF Naughton, “Materialized view selection for multidimensional datasets", Proceeding of the 24th international conference on very large databases, New York, August 1998, pp 488-499.
23. A. Gosain, S. K. Khatri and S. Mann, "Multidimensional modeling for data warehouse using object oriented approach," Proceedings of 3rd International Conference on Reliability, Infocom Technologies and Optimization, 2014, pp. 1-6.
24. A. Shukla, Deshpande PM, Naughton JF, “Materialized view selection for multi-cube data models" 7th International Conference on extended database technology, Germany, March 2000, Springer, pp 269-284.
25. Suman Mann Ajay Kumar Phogat, “Dynamic construction of lattice of cuboids in data warehouse", Journal of Statistics and Management Systems, 971-982.
26. Dinesh Mankad, Preyash Dholakiya, "The Study on DataWarehouse Design and Usage" International Journal of Scientific and Research Publications, March 2013.
27. Prashant R., Suman M., Eashwaran R., “Efficient Data Cube Materialization" Advances in Communication and Computational Technology, Lecture Notes in Electrical Engineering, vol 668. Springer, Singapore ,2020.
28. Mukund Sundarajan, Quqi Yan, “Simple and Efficient Map Reduce Algorithm for Data Cube Materialization", Google Research 1600 Amphitheatre Pkway, Mountain View, CA, 94043, USA, 2017. 29. Phogat, A. K., & Mann, S. (2023). Hyper Lattice Structure for Data Cube Computation. In Proceedings of Data Analytics and Management: ICDAM 2022 (pp. 697-705). Singapore: Springer Nature Singapore
30. Chen, W., Wang, H., Zhang, X., “ An optimized distributed OLAP system for big data” In 2nd IEEE International Conference on Computational Intelligence and Applications 2017.
31. Abualigah, L., Diabat, A., Mirjalili, S., Abd Elaziz, M., & Gandomi, A. H. (2021). The Arithmetic Optimization Algorithm. Computer Methods in Applied Mechanics and Engineering, 376, [113609]. https://doi.org/10.1016/j.cma.2020.113609
32. Laith Abualigah and Dalia Yousri and Mohamed {Abd Elaziz} and Ahmed A. Ewees and Mohammed A.A. Al- qaness and Amir H. Gandomi, “Aquila Optimizer: A novel meta-heuristic optimization Algorithm” computer and industrial engineering” vol 157, 2021
33. Abualigah, L., Diabat, A. Advances in Sine Cosine Algorithm: A comprehensive survey. Artif Intell Rev 54, 2567–2608 (2021). https://doi.org/10.1007/s10462-020-09909-3
34. Abualigah, L., Elaziz, M. A., Hussien, A. G., Alsalibi, B., Jalali, S. M. J., & Gandomi, A. H. (2021). Lightning search algorithm: a comprehensive survey. Applied Intelligence, 51(4), 2353-2376.
35. Phogat, A. K., & Mann, S. (2022). Optimal Data Cube Materialization in Hyper Lattice Structure in Data Warehouse Environment. Journal Of Algebraic Statistics, 13(1), 149-158.
36. Phogat, A. K., & Mann, S. (2022, April). Analysis of Materialization View Selection Approaches in Data Warehouse. In 2022 2nd International Conference on Advance Computing and Innovative Technologies in Engineering (ICACITE) (pp. 1418-1422). IEEE.