Next: Choosing a set of
Up: Overlap Method
Previous: Overlap Method
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 Al. The heuristic is : Choose cuboid with largest
value of l.
DBMS
1999-04-01