Abstract
Data cubes come up with a suitable paradigm for storing, accessing, processing and analysis multidimensional data. Conventional Multidimensional Arrays (CMA) are the basic data structure to process such multidimensional data. But the performance of the MDAs degrades when the number of dimension increases. In this paper, we propose a new approach for computing multidimensional data cube using conversion of dimensions of the multidimensional array. We design efficient algorithms for Multidimensional On Line Analytical Processing (MOLAP) operations using the Converted two dimensional Array (C2A). We represent the MOLAP array as a Converted two dimensional Array where n-dimension is converted into two dimension. Then we apply the operations of data cube namely slice and dice on both CMA and C2A. We calculate the time for slice and dice operations for CMA and C2A. The proposed model requires less time for index computation when number of dimension is high. The cache miss rate is also lower for C2A based implementation. Therefore, our proposed algorithm shows superior performance than the traditional scheme.
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
Merticariu, V., Baumann, P.: Massively distributed data cube processing. In: IEEE International Geoscience and Remote Sensing Symposium (2019). https://doi.org/10.1109/IGARSS.2019.8900432
Wang, Z., Chu, Y., Tan, K.L., Agrawal, D., Abbadi, A.E., Xu, X.: Scalable Data Cube Analysis over Big Data. Published in arXiv (2013)
Xin, D., Han, J., Li, X., Shao, Z., Wah, B.: Computing iceberg cubes by top-down and bottom-up integration: the starcubing approach. IEEE Trans. Knowl. Data Eng. 19(1), 111–126 (2007). https://doi.org/10.1145/1807167.1807271
Hasan, K.M.A., Tsuji, T., Higuchi, K.: An efficient implementation for MOLAP basic data structure and its evaluation. In: Kotagiri, R., Krishna, P.R., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA 2007. LNCS, vol. 4443, pp. 288–299. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-71703-4_26
Zhang, Y., Zhou, X., Zhang, Y., Zhang, Y., Su, M., Wang, S.: Virtual denormalization via array index reference for main memory OLAP. IEEE Trans. Knowl. Data Eng. 28(4), 1061–1074 (2016). https://doi.org/10.1109/KDE.2015.2499199
Zhang, Y., Ordonez, C., GarcÃa-GarcÃa, J., Bellatreche, L., Carrillo, H.: The percentage cube. Inf. Syst. 79, 20–31 (2019)
Zhao, Y., Deshpande, P.M., Naughton, J.F.: An array-based algorithm for simultaneous multidimensional aggregates. In: Proceedings of SIGMOD Conference, pp. 159–170 (1997). https://doi.org/10.1145/253260.253288
Plattner, H.: SanssouciDB: an in-memory database for processing enterprise workloads. In: Datenbanksysteme for Business, Technologie und Web (BTW). Gesellschaft for Informatik, Bonn, pp. 2–21 (2011)
Sarawagi, S., Stonebraker, M.: Efficient organization of large multidimensional arrays. In: Proceedings of 10th International Conference on Data Engineering (ICDE), Houston, Texas, pp. 328–386 (1994). https://doi.org/10.1109/ICDE.1994.283048
Hasan, K.M.A., Shaikh, M.A.H.: Efficient representation of higher-dimensional arrays by dimension transformations. J. Supercomput. 73(6), 2801–2822 (2017). https://doi.org/10.1007/s11227-016-1954-x
Hasan, K.M.A., Shaikh, M.A.H.: Representing higher dimensional arrays into generalized two-dimensional array: G2A. In: Park, J.J.J.H., Yi, G., Jeong, Y.-S., Shen, H. (eds.) Advances in Parallel and Distributed Computing and Ubiquitous Services. LNEE, vol. 368, pp. 39–46. Springer, Singapore (2016). https://doi.org/10.1007/978-981-10-0068-3_5
Deshpande, P., Ramasamy, K., Shukla, A., Naughton, J.F.: Caching multidimensional queries using chunks. In: Proceedings of the ACM SIGMOD Conference on Management of Data, pp. 259–270 (1998). https://doi.org/10.1145/276305.276328
Hasan, K.M.A., Kuroda, M., Azuma, N., Tsuji, T., Higuchi, K.: An extendible array based implementation of relational tables for multi dimensional databases. In: Tjoa, A.M., Trujillo, J. (eds.) DaWaK 2005. LNCS, vol. 3589, pp. 233–242. Springer, Heidelberg (2005). https://doi.org/10.1007/11546849_23
Yan, J., et al.: Trace-oriented feature analysis for large-scale text data dimension reduction. IEEE Trans. Knowl. Data Eng. 23(7), 1103–1117 (2011)
Sun, J., Tao, D., Papadimitriou, S., Yu, P.S., Faloutsos, C.: Incremental tensor analysis: theory and applications. ACM Trans. Knowl. Discov. Data 2(3), 1–37 (2008)
Kim, S., Lee, S., Kim, J., Yoon, Y.-I.: MRTensorCube: tensor factorization with data reduction for context-aware recommendations. J. Supercomput. (6), 1–11 (2017). https://doi.org/10.1007/s11227-017-2002-1
Miranda, F., Lins, L., Klosowski, J.T., Silva, C.: TOPKUBE: a rank-aware data cube for real-time exploration of spatiotemporal data. IEEE Trans. Vis. Comput. Graph. 24, 1394–1407 (2018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Rimi, R.T., Hasan, K.M.A. (2020). Efficient Query Processing for Multidimensional Data Cubes. In: Bhuiyan, T., Rahman, M.M., Ali, M.A. (eds) Cyber Security and Computer Science. ICONCS 2020. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 325. Springer, Cham. https://doi.org/10.1007/978-3-030-52856-0_51
Download citation
DOI: https://doi.org/10.1007/978-3-030-52856-0_51
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-52855-3
Online ISBN: 978-3-030-52856-0
eBook Packages: Computer ScienceComputer Science (R0)