Page 233 -

HAN
12-ch05-187-242-9780123814791

196 Chapter 5 Data Cube Technology 2011/6/1 3:19 Page 196 #10

A-B Plane

*
* * * *
61 62 63
* * * *
64
45 46 47 * * * *
60
48
B-C Plane 44 56
29 30 31
32 52
40
c 3
28
36
24 c 2
* *
* b 13 14 15 16 12 20
3
* C
* *
* b 2 9 10 11 8 c 1
* B
* *
* b 1 5 6 7 4
*
*
b 0 1 2 3 c 0 A-C Plane

a 0 a 1 a 2 a 3
A

*
* * * *
* * * *
* * * *

Figure 5.3 A 3-D array for the dimensions A, B, and C, organized into 64 chunks. Each chunk is small
enough to fit into the memory available for cube computation. The ∗’s indicate the chunks
from 1 to 13 that have been aggregated so far in the process.

the dimensions A, B, and C is 40, 400, and 4000, respectively. Thus, the size of the array
for each dimension, A, B, and C, is also 40, 400, and 4000, respectively. The size of each
partition in A, B, and C is therefore 10, 100, and 1000, respectively. Full materialization
of the corresponding data cube involves the computation of all the cuboids defining this
cube. The resulting full cube consists of the following cuboids: