December2015 Cs Q31

0. A data cube C, has n dimensions, and each dimension has exactly p distinct values in the base cuboid. Assume that there are no concept hierarchies associated with the dimensions. What is the maximum number of cells possible in the data cube, C?

  • Option : D
  • Explanation :
    (a) What is the maximum number of cells possible in the base cuboid? pn.
    This is the maximum number of distinct tuples that you can form with p distinct values per dimensions.
    (b) What is the minimum number of cells possible in the base cuboid? p.
    You need at least p tuples to contain p distinct values per dimension. In this case no tuple shares any value on any dimension.
    (c) What is the minimum number of cells possible in the data cube, C? (2n-1)×p+1.
    The minimum number of cells is when each cuboid contains only p cells, except for the apex, which contains a single cell.
    (d) What is the maximum number of cells possible (including both base cells and aggregate cells) in the data cube, C? (p+1)n.
    The argument is similar to that of part (a), but now we have p+1 because in addition to the p distinct values of each dimension we can also choose ∗.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *