Next: Algorithm : Pipe Sort
Up: No Title
Previous: Basic Aggregation Methods
Search Lattice For CUBE : is a graph where
a vertex represents a group-by of the CUBE. A directed edge connects
group-by i to group-by j, whenever j can be generated from i and j has
exactly one attribute less than i.
A(eij) is the cost of computing j from i when i is
already sorted.
S(eij) is the cost of computing j from i when i is
not sorted.
DBMS
1999-04-01