Dynamic discovery of query path on the lattice of cuboids using hierarchical data granularity and storage hierarchy |
| |
| Institution: | 1. A. K. Choudhury School of Information Technology, University of Calcutta, Kolkata, India;2. Department of MCA, Future Institute of Engineering & Management, Kolkata, India;3. Department of Computer Applications, National Institute of Technology, Durgapur, India;4. Department of Computer Science & Engineering, University of Calcutta, Kolkata, India;5. Department of Computer Science, Winona State University, MN, USA;1. Department of Chemistry, University of Jordan, Amman 11942, Jordan;2. School of Engineering and Information Technology, Murdoch University, Perth, Australia;3. Chemical Engineering Department, Al-Hussein Bin Talal University, Ma’an, Jordan;4. Chemistry Department, Memorial University, St. John''s, NL A1B 3X7, Canada;5. Chemistry Department, Al-Hussein Bin Talal University, Ma’an, Jordan;1. School of Health Sciences, University of Aveiro (ESSUA), Agras do Crasto – Campus Universitário de Santiago – Edifício 30, 3810-193 Aveiro, Portugal;2. Institute of Electronics and Telematics Engineering of Aveiro (IEETA), University of Aveiro, Campus Universitário de Santiago, 3810-193 Aveiro, Portugal;3. Unidade de Investigação e Formação sobre Adultos e Idosos (UNIFAI), Porto, Portugal;1. Graduate School of Informatics and Engineering, The University of Electro-Communications, Japan;2. College of Cornerstone Education, Oberlin University, Japan;3. Department of Information Science, Nihon University, Japan;4. Faculty of Information Science and Arts, Toyo University, Japan |
| |
| Abstract: | Analytical processing on multi-dimensional data is performed over data warehouse. This, in general, is presented in the form of cuboids. The central theme of the data warehouse is represented in the form of fact table. A fact table is built from the related dimension tables. The cuboid that corresponds to the fact table is called base cuboid. All possible combination of the cuboids could be generated from base cuboid using successive roll-up operations and this corresponds to a lattice structure. Some of the dimensions may have a concept hierarchy in terms of multiple granularities of data. This means a dimension is represented in more than one abstract form. Typically, neither all the cuboids nor all the concept hierarchy are required for a specific business processing. These cuboids are resided in different layers of memory hierarchy like cache memory, primary memory, secondary memory, etc. This research work dynamically finds the most cost effective path from the lattice structure of cuboids based on concept hierarchy to minimize the query access time. The knowledge of location of cuboids at different memory elements is used for the purpose. |
| |
| Keywords: | Data cube Lattice of cuboid Concept hierarchy Memory hierarchy Path optimizaton |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
