Title :
Optimal Space and Time Complexity Analysis on the Lattice of Cuboids Using Galois Connections for Data Warehousing
Author :
Sen, Soumya ; Chaki, Nabendu ; Cortesi, Agostino
Author_Institution :
A.K. Choudhury Sch. of Inf. Technol., Univ. of Calcutta, Kolkata, India
Abstract :
In this paper, an optimal aggregation and counter-aggregation (drill-down) methodology is proposed on multidimensional data cube. The main idea is to aggregate on smaller cuboids after partitioning those depending on the cardinality of the individual dimensions. Based on the operations to make these partitions, a Galois Connection is identified for formal analysis that allow to guarantee the soundness of optimizations of storage space and time complexity for the abstraction and concretization functions defined on the lattice structure. Our contribution can be seen as an application to OLAP operations on multidimensional data model in the Abstract Interpretation framework.
Keywords :
computational complexity; data mining; data warehouses; Galois Connections; OLAP operations; abstract interpretation framework; counter-aggregation; data warehousing; drill-down methodology; formal analysis; lattice of cuboids; multidimensional data cube; multidimensional data model; optimal aggregation; optimal space; time complexity analysis; Aggregates; Data models; Data warehouses; Information analysis; Information technology; Lattices; Memory; Multidimensional systems; Space technology; Warehousing; Abstract interpretation; Galois connection; OLAP; data warehouse; lattice;
Conference_Titel :
Computer Sciences and Convergence Information Technology, 2009. ICCIT '09. Fourth International Conference on
Conference_Location :
Seoul
Print_ISBN :
978-1-4244-5244-6
Electronic_ISBN :
978-0-7695-3896-9
DOI :
10.1109/ICCIT.2009.185
