public class MonteCarloLatticeImpl extends LatticeImpl
Lattice data structure for use by
the MonteCarloAlgorithm.materializedAggregates, schema| Constructor and Description |
|---|
MonteCarloLatticeImpl(Schema schema) |
| Modifier and Type | Method and Description |
|---|---|
AggregateImpl |
chooseAggregate(double maxCost,
double minCostBenefitRatio,
Cost cost)
Chooses the next un-materialized aggregate with the highest
incremental benefit.
|
Lattice |
copy()
Returns a copy of this lattice.
|
Algorithm.CostBenefit |
costBenefitOf(AggregateImpl aggregate)
Returns an object representing the cost of the given aggregate, and
benefit of adding it to the current lattice.
|
void |
materialize(AggregateImpl aggregate)
Materializes an aggregate.
|
computeAggregateCosts, computeAggregateCosts, estimateCost, findMaterializedDirectAscendants, findMaterializedDirectDescendants, findNearestMaterializedDescendant, getAggregate, getBenefit, getChildren, getMaterializedAggregates, getParents, nonMaterializedDescendants, toBitspublic MonteCarloLatticeImpl(Schema schema)
public Lattice copy()
Latticepublic AggregateImpl chooseAggregate(double maxCost, double minCostBenefitRatio, Cost cost)
Latticecost - Output parameter, is populated with the benefit and the
number of queries which will benefit by materializing the chosen
aggregatepublic void materialize(AggregateImpl aggregate)
Latticematerialize in interface Latticematerialize in class LatticeImplaggregate - Aggregatepublic Algorithm.CostBenefit costBenefitOf(AggregateImpl aggregate)
Latticeaggregate - AggregateCopyright © 2006–2016 Julian Hyde. All rights reserved.