Header menu link for other important links
Dynamic query path selection from lattice of cuboids using memory hierarchy
Published in Institute of Electrical and Electronics Engineers Inc.
Pages: 49 - 54
Data warehouse represents multi-dimensional data suitable for analytical processing and logically data are organized in the form of data cube or cuboid. Data warehouse actually represents a business theme which is called fact table. The cuboid that identifies the complete fact table is called base cuboid. The all possible combination of the cuboids that could be generated from base cuboid corresponds to lattice structure. A lattice consists of numbers of cuboids. In real life, all these cuboids may not be important for business analysis. Thus all of them are not always called during business processing. The cuboids that are referred in different applications are fetched from diverse memory hierarchy such as cache memory, primary memory and secondary memory. The different execution speed of the respective memory element is taken into account which forms a memory hierarchy. The focus of this research work is to dynamically identify the most cost effective path within the lattice structure of cuboids to minimize the query access time having the knowledge of existing cuboid location at different memory elements. © 2013 IEEE.
About the journal
JournalData powered by TypesetProceedings - International Symposium on Computers and Communications
PublisherData powered by TypesetInstitute of Electrical and Electronics Engineers Inc.
Open AccessNo