Choosing a Parent to compute a cuboid

The goal in choosing a tree is to minimize the size of the partitions of a cuboid so that minimum memory for its computation. For example, its better to compute AC from ACD rather than ABC. Consider , where the base cuboid is . S can be computed from any cuboid with one additional attribute A_l. The heuristic is : Choose cuboid with largest value of l.