Package org.teiid.query.optimizer.relational.plantree

Examples of org.teiid.query.optimizer.relational.plantree.PlanNode

146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
    private void findInputNodes(final HashSet inputs,
                               PlanNode critNode,
                               final List conjuncts, final Set params) {
       
        while (critNode.getType() == NodeConstants.Types.SELECT) {
            final PlanNode currentNode = critNode;
           
            final Criteria crit = (Criteria)currentNode.getProperty(NodeConstants.Info.SELECT_CRITERIA);
           
            critNode = currentNode.getParent();
           
            if (!currentNode.getGroups().isEmpty()) {
                continue;
            }
           
            LanguageVisitor visitor = new LanguageVisitor() {     
                public void visit(CompareCriteria compCrit){
                    if (compCrit.getOperator() == CompareCriteria.EQ && checkForInput(compCrit.getLeftExpression()) && !checkForAnyInput(compCrit.getRightExpression())) {
                        addInputNode((Reference)compCrit.getLeftExpression());
                    }
                }
               
                private void addInputNode(Reference param) {
                    params.add(param.getExpression());
                    conjuncts.add(crit);
                    NodeEditor.removeChildNode(currentNode.getParent(), currentNode);
                }
               
                public void visit(IsNullCriteria isNull){
                    if (!isNull.isNegated() && checkForInput(isNull.getExpression())) {
                        addInputNode((Reference)isNull.getExpression());
View Full Code Here
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
                break;
            case NodeConstants.Types.ACCESS:
            case NodeConstants.Types.SORT:
            {
                //Simply record the cost of the only child
                PlanNode child = node.getFirstChild();
                Float childCost = (Float)child.getProperty(NodeConstants.Info.EST_CARDINALITY);
                setCardinalityEstimate(node, childCost, true, metadata);
                break;
            }
            case NodeConstants.Types.NULL:
                setCardinalityEstimate(node, 0f, true, metadata);
                break;

            case NodeConstants.Types.PROJECT:
            {
                Float childCost = null;
                //Simply record the cost of the only child
                if (node.getChildCount() != 0) {
                    PlanNode child = node.getFirstChild();
                    childCost = (Float)child.getProperty(NodeConstants.Info.EST_CARDINALITY);
                } else {
                    childCost = 1f;
                }
                setCardinalityEstimate(node, childCost, true, metadata);
                break;
            }
            case NodeConstants.Types.SET_OP:
            {
                estimateSetOpCost(node, metadata);
                break;
            }
            case NodeConstants.Types.TUPLE_LIMIT:
            {
                PlanNode child = node.getFirstChild();
                float childCost = child.getCardinality();
               
                Expression offset = (Expression)node.getProperty(NodeConstants.Info.OFFSET_TUPLE_COUNT);
                Float cost = childCost;
               
                if (childCost != UNKNOWN_VALUE && offset instanceof Constant) {
View Full Code Here
307
308
309
310
311
312
313
314
315
316
317
  }

  private static float getDistinctEstimate(PlanNode node,
      QueryMetadataInterface metadata, float cost)
      throws QueryMetadataException, TeiidComponentException {
    PlanNode projectNode = NodeEditor.findNodePreOrder(node, NodeConstants.Types.PROJECT);
    if (projectNode != null) {
      cost = getNDVEstimate(node.getParent(), metadata, cost, (List)projectNode.getProperty(NodeConstants.Info.PROJECT_COLS), false);
    }
    return cost;
  }
View Full Code Here
336
337
338
339
340
341
342
343
344
345
346
347
348
349
     */
    private static void estimateJoinNodeCost(PlanNode node, QueryMetadataInterface metadata)
        throws QueryMetadataException, TeiidComponentException {

        Iterator<PlanNode> children = node.getChildren().iterator();
        PlanNode child1 = children.next();
        float childCost1 = child1.getCardinality();
        PlanNode child2 = children.next();
        float childCost2 = child2.getCardinality();
       
        if (childCost1 == UNKNOWN_VALUE || childCost2 == UNKNOWN_VALUE) {
          setCardinalityEstimate(node, null, true, metadata);
          return;
        }
View Full Code Here
380
381
382
383
384
385
386
387
388
389
390
391
     * @param metadata
     */
    private static void estimateSelectNodeCost(PlanNode node, QueryMetadataInterface metadata)
        throws QueryMetadataException, TeiidComponentException {

        PlanNode child = node.getFirstChild();
        float childCost = child.getCardinality();
       
        //Get list of conjuncts
        Criteria selectCriteria = (Criteria)node.getProperty(NodeConstants.Info.SELECT_CRITERIA);
        float newCost = recursiveEstimateCostOfCriteria(childCost, node, selectCriteria, metadata);
        setCardinalityEstimate(node, newCost, true, metadata);
View Full Code Here
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
        float cost = UNKNOWN_VALUE;
        if(node.getChildCount() > 0) {
          SymbolMap references = (SymbolMap)node.getProperty(NodeConstants.Info.CORRELATED_REFERENCES);
          //only cost non-correlated TODO: a better estimate for correlated
          if (references == null) {
              PlanNode child = node.getFirstChild();
              cost = child.getCardinality();
              SymbolMap symbolMap = (SymbolMap)node.getProperty(NodeConstants.Info.SYMBOL_MAP);
              if (symbolMap != null) {
                ColStats colStats = (ColStats) child.getProperty(Info.EST_COL_STATS);
                if (colStats != null) {
                  List<? extends Expression> outputCols = getOutputCols(node, metadata);
                  ColStats newColStats = new ColStats();
                  for (Expression expr : outputCols) {
                    if (!(expr instanceof ElementSymbol)) {
View Full Code Here
565
566
567
568
569
570
571
572
573
574
575
      TeiidComponentException {
    List<Expression> outputCols =(List<Expression>)node.getProperty(Info.OUTPUT_COLS);
    if (outputCols != null) {
      return outputCols;
    }
    PlanNode projectNode = NodeEditor.findNodePreOrder(node,
        NodeConstants.Types.PROJECT | NodeConstants.Types.GROUP
        | NodeConstants.Types.SOURCE | NodeConstants.Types.JOIN
        | NodeConstants.Types.NULL);
    if (projectNode != null) {
      node = projectNode;
View Full Code Here
598
599
600
601
602
603
604
605
606
607
608
609
     * @throws TeiidComponentException
     */
    private static void estimateNodeCost(PlanNode node, List expressions, QueryMetadataInterface metadata)
        throws QueryMetadataException, TeiidComponentException {
       
        PlanNode child = node.getFirstChild();
        float childCost = child.getCardinality();
       
        if(childCost == UNKNOWN_VALUE) {
            setCardinalityEstimate(node, null, true, metadata);
            return;
        }
View Full Code Here
621
622
623
624
625
626
627
628
629
630
631
632
          ColStats colStats = null;
        if (node.getChildCount() == 0) {
          colStats = createColStats(node, metadata, cardinality);
        } else {
          for (int i = branch; i < node.getChildCount(); i++) {
            PlanNode child = node.getChildren().get(i);
            colStats = (ColStats) child.getProperty(Info.EST_COL_STATS);
              if (colStats == null) {
                continue;
              }
          float[] stats = colStats.get(expression);
          if (stats != null) {
View Full Code Here
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
     *
     */
    public static DependentCostAnalysis computeCostForDepJoin(PlanNode joinNode, boolean leftIndependent, QueryMetadataInterface metadata, CapabilitiesFinder capFinder, CommandContext context)
        throws TeiidComponentException, QueryMetadataException, QueryPlannerException {
       
        PlanNode independentNode = leftIndependent?joinNode.getFirstChild():joinNode.getLastChild();
        PlanNode dependentNode = leftIndependent?joinNode.getLastChild():joinNode.getFirstChild();
       
        List independentExpressions = (List)(leftIndependent?joinNode.getProperty(NodeConstants.Info.LEFT_EXPRESSIONS):joinNode.getProperty(NodeConstants.Info.RIGHT_EXPRESSIONS));
        List dependentExpressions = (List)(leftIndependent?joinNode.getProperty(NodeConstants.Info.RIGHT_EXPRESSIONS):joinNode.getProperty(NodeConstants.Info.LEFT_EXPRESSIONS));
       
        return computeCostForDepJoin(independentNode, dependentNode,
View Full Code Here
TOP

Related Classes of org.teiid.query.optimizer.relational.plantree.PlanNode

  • org.teiid.query.optimizer.relational.PlanToProcessConverter
  • org.teiid.query.optimizer.relational.plantree.TestNodeEditor
  • org.teiid.query.optimizer.relational.RelationalPlanner
  • org.teiid.query.optimizer.relational.rules.FrameUtil
  • org.teiid.query.optimizer.relational.rules.JoinRegion
  • org.teiid.query.optimizer.relational.rules.JoinUtil
  • org.teiid.query.optimizer.relational.rules.NewCalculateCostUtil
  • org.teiid.query.optimizer.relational.rules.RuleAssignOutputElements
  • org.teiid.query.optimizer.relational.rules.RuleChooseDependent
  • org.teiid.query.optimizer.relational.rules.RuleChooseJoinStrategy
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.