International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 77 - Number 3 |
Year of Publication: 2013 |
Authors: Anjana Gosain, Suman Mann |
10.5120/13378-0993 |
Anjana Gosain, Suman Mann . Space and Time Analysis on the Lattice of Cuboid for Data Warehouse. International Journal of Computer Applications. 77, 3 ( September 2013), 47-52. DOI=10.5120/13378-0993
Multidimensional analysis requires the computation of many aggregate functions over a large volume of collected data. To provide the various viewpoints for the analysts, these data are organized as a multi-dimensional data model called data cubes. Each cell in a data cube represents a unique set of values for the different dimensions and contains the metrics of interest. The different abstraction and concretization associated with a dimension may be represented as lattice. The focus is to move up and drill down within the lattice using an algorithm with optimal space and computation. In the lattice of cuboids, there exist multiple paths for summarization from a lower to an upper level of cuboid. The alternate paths involve different amounts of storage space and different volume of computations. Thus objective of this paper is to design an algorithm for formal analysis leading towards detection of an optimal path for any two given valid pair of cuboids at different levels. Algorithm is proposed based on branch and bound method for selection of optimal path. Experimental results in the last show that the solution obtained by the algorithm gives the optimal solution in terms of space and time computation.