|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
| Packages that use NewCalculateCostUtil.DependentCostAnalysis | |
|---|---|
| org.teiid.query.optimizer.relational.rules | |
| Uses of NewCalculateCostUtil.DependentCostAnalysis in org.teiid.query.optimizer.relational.rules |
|---|
| Methods in org.teiid.query.optimizer.relational.rules that return NewCalculateCostUtil.DependentCostAnalysis | |
|---|---|
static NewCalculateCostUtil.DependentCostAnalysis |
NewCalculateCostUtil.computeCostForDepJoin(PlanNode joinNode,
boolean leftIndependent,
QueryMetadataInterface metadata,
CapabilitiesFinder capFinder,
CommandContext context)
Computes the cost of a Dependent Join The worst possible cost will arise from a high independent ndv (many dependent sets) and a low dependent ndv (possibly many matches per set) This logic uses the same assumption as criteria in that ndv is used as a divisor of cardinality. |
static NewCalculateCostUtil.DependentCostAnalysis |
NewCalculateCostUtil.computeCostForDepJoin(PlanNode independentNode,
PlanNode dependentNode,
java.util.List independentExpressions,
java.util.List dependentExpressions,
QueryMetadataInterface metadata,
CapabilitiesFinder capFinder,
CommandContext context)
|
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||