Question description
Suppose that we would like to compute an iceberg cube for the
dimensions, A, B, C, D, where we wish to materialize all cells that
satisfy a minimum support count of at least v, and where cardinality(A) <cardinality(B) <cardinality(C) <cardinality(D).Show
the BUC processing tree (which shows the order in which the BUC
algorithm explores the lattice of a data cube, starting from all) for the construction of the above iceberg cube.