Package org.pentaho.aggdes.algorithm.impl

Provides a default implementation of the Aggregate Design algorithm, which is specified in the org.pentaho.aggdes.algorithm package.

See: Description

Interface Summary

Interface	Description
Lattice	Data structure which contains the set of all possible aggregates, arranged so that you can navigate from any aggregate to its parents (aggregates having precisely one more attribute) and to its children (aggregates having precisely one fewer attribute).

Class Summary

Class	Description
AdaptiveMonteCarloAlgorithm	Implementation of Algorithm that runs the Monte Carlo method repeatedly, tuning the cost limit each time to yield an effective cost limit.
AggregateImpl	Implementation of Aggregate.
AlgorithmImpl	Implementation of the Algorithm that uses an exhaustive algorithm.
Cost	Represents the cost of materializing an Aggregate.
ExhaustiveLatticeAlgorithm	Implementation of Algorithm that tries all possible sets of Aggregate objects.
LatticeImpl	Abstract implementation of the Lattice data structure.
MonteCarloAlgorithm	Implementation of Algorithm that measures the effectiveness of a set of Aggregate objects by generating a set of representative sample queries.
MonteCarloLatticeImpl	Implementation of the Lattice data structure for use by the MonteCarloAlgorithm.
ResultImpl	Implementation of Result.

Package org.pentaho.aggdes.algorithm.impl Description

Provides a default implementation of the Aggregate Design algorithm, which is specified in the org.pentaho.aggdes.algorithm package.