Abstract
In data warehouse, lattice of cuboids is very important as it represents all the combination of dimensions for that particular business application. The size of the structure is high as for N dimensions, the total number of cuboids is 2N. If the dimensions maintain concept hierarchies, that results in more numbers of cuboids. Hence, the search time is quite high if the data warehouse maintains cuboids in the form of lattice. Here, a secondary index scheme is proposed over lattice of cuboids by analyzing the existing query set. A novel methodology is proposed to rank the dimensions based on the usage of the cuboids and corresponding dimensions. Secondary index is created based on these ranking and that improves the search time significantly. Both the case study and experimental results show the efficacy of the proposed method.
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
References
Zhang, Y., et al. 2019. Main-memory foreign key joins on advanced processors: Design and re-evaluations for OLAP workloads. Distrib Parallel Databases 37: 469–506.
R. Ghosh, S. Halder, and S. Sen. 2015. An integrated approach to deploy data warehouse in business intelligence environment. In Proceedings of the IEEE 3rd International Conference on Computer, Communication, Control and Information Technology (C3IT). ISBN: 978-1-4799-4446-0.
Ali, S.M.F., and R. Wrembel. 2017. From conceptual design to performance optimization of ETL workflows: Current state of research and open problems. The VLDB Journal 26 (6): 777–801.
Swamy, M.K., and P.K. Reddy. 2020. A model of concept hierarchy-based diverse patterns with applications to recommender system. International Journal of Data Science and Analytics 10 (2): 177–191.
Sen, S., N. Chaki, and A. Cortesi. 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, 1271–1275. IEEE.
Sen, S., and N. Chaki. 2011. Efficient traversal in data warehouse based on concept hierarchy using Galois connections. In 2011 Second International Conference on Emerging Applications of Information Technology, 335–339. IEEE.
Wang, Z., Q. Fan, H. Wang, K.L. Tan, D. Agrawal, and A. El Abbadi. 2014. Pagrol: Parallel graph olap over large-scale attributed graphs. In 2014 IEEE 30th International Conference on Data Engineering, 496–507. IEEE.
Phan-Luong, V. 2017. Searching data cube for submerging and emerging cuboids. In 2017 IEEE 31st International Conference on Advanced Information Networking and Applications (AINA), 586–593. IEEE.
S. Roy, S. Sen, and N.C. Debnath. 2018. Optimal query path selection in lattice of cuboids using novel heuristic search algorithm. In 33rd International Conference on Computers and Their Applications (CATA), 134–139. ISBN: 978-1-5108-5867-1.
Xie, X., K. Zou, X. Hao, T.B. Pedersen, P. Jin, and W. Yang. 2019. Olap over probabilistic data cubes ii: Parallel materialization and extended aggregates. IEEE Transactions on Knowledge and Data Engineering 32 (10): 1966–1981.
Phan-Luong, V. 2016. A data cube representation for efficient querying and updating. In 2016 International Conference on Computational Science and Computational Intelligence (CSCI), 415–420. IEEE.
Roy, S., S. Sen, A. Sarkar, N. Chaki, and N.C. Debnath. 2013. Dynamic query path selection from lattice of cuboids using memory hierarchy. In 2013 IEEE Symposium on Computers and Communications (ISCC), 000049–000054. IEEE.
Sen, S., S. Roy, A. Sarkar, N. Chaki, and N.C. Debnath. 2014. Dynamic discovery of query path on the lattice of cuboids using hierarchical data granularity and storage hierarchy. Journal of Computational Science 5 (4): 675–683.
An, H.G., and Koh, J.J. 2012. A study on the selection of bitmap join index using data mining techniques. In 2012 7th International Forum on Strategic Technology (IFOST), 1–5. IEEE.
Weahama, W., S. Vanichayobon, and J. Manfuekphan. 2009. Using data clustering to optimize scatter bitmap index for membership queries. In 2009 International Conference on Computer and Automation Engineering, 174–178. IEEE.
Choenni, S., H. Blanken, and T. Chang. 1993. Index selection in relational databases. In Proceedings of ICCI'93: 5th International Conference on Computing and Information, 491–496. IEEE.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Adhikari, S., Saha, S., Dutta, A., Mitra, A., Sen, S. (2022). A Novel Indexing Scheme Over Lattice of Cuboids and Concept Hierarchy in Data Warehouse. In: Peng, SL., Lin, CK., Pal, S. (eds) Proceedings of 2nd International Conference on Mathematical Modeling and Computational Science. Advances in Intelligent Systems and Computing, vol 1422. Springer, Singapore. https://doi.org/10.1007/978-981-19-0182-9_14
Download citation
DOI: https://doi.org/10.1007/978-981-19-0182-9_14
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-0181-2
Online ISBN: 978-981-19-0182-9
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)