Examples of org.eigenbase.rel.RelNode

org.eigenbase.rel.RelNode
A RelNode is a relational expression.
A relational expression is not a scalar expression; see {@link org.eigenbase.sql.SqlNode} and {@link RexNode}.

If this type of relational expression has some particular planner rules, it should implement the public static method {@link AbstractRelNode#register}.

When a relational expression comes to be implemented, the system allocates a {@link org.eigenbase.relopt.RelImplementor} to manage the process. Everyimplementable relational expression has a {@link RelTraitSet} describing itsphysical attributes. The RelTraitSet always contains a {@link Convention}describing how the expression passes data to its consuming relational expression, but may contain other traits, including some applied externally. Because traits can be applied externally, implementations of RelNode should never assume the size or contents of their trait set (beyond those traits configured by the RelNode itself).

For each calling-convention, there is a corresponding sub-interface of RelNode. For example, {@code net.hydromatic.optiq.rules.java.EnumerableRel}has operations to manage the conversion to a graph of {@code net.hydromatic.optiq.rules.java.EnumerableConvention}calling-convention, and it interacts with a {@code EnumerableRelImplementor}.

A relational expression is only required to implement its calling-convention's interface when it is actually implemented, that is, converted into a plan/program. This means that relational expressions which cannot be implemented, such as converters, are not required to implement their convention's interface.

Every relational expression must derive from {@link AbstractRelNode}. (Why have the RelNode interface, then? We need a root interface, because an interface can only derive from an interface.)

    this.derivedTableCount = dtCounterInitVal;
  }


  public static ASTNode convert(final RelNode relNode, List<FieldSchema> resultSchema)
      throws OptiqSemanticException {
    RelNode root = PlanModifierForASTConv.convertOpTree(relNode, resultSchema);
    ASTConverter c = new ASTConverter(root, 0);
    return c.convert();
  }

View Full Code Here

      boolean semiJoin = join instanceof SemiJoinRel;
      ast = ASTBuilder.join(left.ast, right.ast, join.getJoinType(), cond, semiJoin);
      if (semiJoin)
        s = left.schema;
    } else if (r instanceof UnionRelBase) {
      RelNode leftInput = ((UnionRelBase) r).getInput(0);
      RelNode rightInput = ((UnionRelBase) r).getInput(1);


      ASTConverter leftConv = new ASTConverter(leftInput, this.derivedTableCount);
      ASTConverter rightConv = new ASTConverter(rightInput, this.derivedTableCount);
      ASTNode leftAST = leftConv.convert();
      ASTNode rightAST = rightConv.convert();

View Full Code Here

  }


  class QBVisitor extends RelVisitor {


    public void handle(FilterRelBase filter) {
      RelNode child = filter.getChild();
      if (child instanceof AggregateRelBase && !((AggregateRelBase) child).getGroupSet().isEmpty()) {
        ASTConverter.this.having = filter;
      } else {
        ASTConverter.this.where = filter;
      }

View Full Code Here

    @Override
    public RelNode createProject(RelNode child,
        List<? extends RexNode> childExprs, List<String> fieldNames) {
      RelOptCluster cluster = child.getCluster();
      RelDataType rowType = RexUtil.createStructType(cluster.getTypeFactory(), childExprs, fieldNames);
      RelNode project = HiveProjectRel.create(cluster, child,
          childExprs, rowType,
          child.getTraitSet(), Collections.<RelCollation> emptyList());


      return project;
    }

View Full Code Here

public class PlanModifierForASTConv {
  private static final Log LOG = LogFactory.getLog(PlanModifierForASTConv.class);


  public static RelNode convertOpTree(RelNode rel, List<FieldSchema> resultSchema)
      throws OptiqSemanticException {
    RelNode newTopNode = rel;
    if (LOG.isDebugEnabled()) {
      LOG.debug("Original plan for PlanModifier\n " + RelOptUtil.toString(newTopNode));
    }


    if (!(newTopNode instanceof ProjectRelBase) && !(newTopNode instanceof SortRel)) {

View Full Code Here

        }
        if (!validSortChild((HiveSortRel) rel)) {
          introduceDerivedTable(((HiveSortRel) rel).getChild(), rel);
        }
      } else if (rel instanceof HiveAggregateRel) {
        RelNode newParent = parent;
        if (!validGBParent(rel, parent)) {
          newParent = introduceDerivedTable(rel, parent);
        }
        // check if groupby is empty and there is no other cols in aggr
        // this should only happen when newParent is constant.

View Full Code Here

  }


  private static RelNode renameTopLevelSelectInResultSchema(final RelNode rootRel,
      Pair<RelNode, RelNode> topSelparentPair, List<FieldSchema> resultSchema)
      throws OptiqSemanticException {
    RelNode parentOforiginalProjRel = topSelparentPair.getKey();
    HiveProjectRel originalProjRel = (HiveProjectRel) topSelparentPair.getValue();


    // Assumption: top portion of tree could only be
    // (limit)?(OB)?(ProjectRelBase)....
    List<RexNode> rootChildExps = originalProjRel.getChildExps();
    if (resultSchema.size() != rootChildExps.size()) {
      // Safeguard against potential issues in CBO RowResolver construction. Disable CBO for now.
      LOG.error(generateInvalidSchemaMessage(originalProjRel, resultSchema, 0));
      throw new OptiqSemanticException("Result Schema didn't match Optimized Op Tree Schema");
    }


    List<String> newSelAliases = new ArrayList<String>();
    String colAlias;
    for (int i = 0; i < rootChildExps.size(); i++) {
      colAlias = resultSchema.get(i).getName();
      if (colAlias.startsWith("_")) {
        colAlias = colAlias.substring(1);
      }
      newSelAliases.add(colAlias);
    }


    HiveProjectRel replacementProjectRel = HiveProjectRel.create(originalProjRel.getChild(),
        originalProjRel.getChildExps(), newSelAliases);


    if (rootRel == originalProjRel) {
      return replacementProjectRel;
    } else {
      parentOforiginalProjRel.replaceInput(0, replacementProjectRel);
      return rootRel;
    }
  }

View Full Code Here


    if (pos == -1) {
      throw new RuntimeException("Couldn't find child node in parent's inputs");
    }


    RelNode select = introduceDerivedTable(rel);


    parent.replaceInput(pos, select);
    
    return select;
  }

View Full Code Here

    return validParent;
  }


  private static boolean validSortChild(HiveSortRel sortNode) {
    boolean validChild = true;
    RelNode child = sortNode.getChild();


    if (!(HiveOptiqUtil.limitRelNode(sortNode) && HiveOptiqUtil.orderRelNode(child))
        && !(child instanceof ProjectRelBase)) {
      validChild = false;
    }

View Full Code Here

    // proper index of a dummy.
    List<Integer> argList = ImmutableList.of(0);
    AggregateCall dummyCall = new AggregateCall(countFn, false, argList, longType, null);
    AggregateRelBase newAggRel = oldAggRel.copy(oldAggRel.getTraitSet(), oldAggRel.getChild(),
        oldAggRel.getGroupSet(), ImmutableList.of(dummyCall));
    RelNode select = introduceDerivedTable(newAggRel);
    parent.replaceInput(0, select);
  }

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of org.eigenbase.rel.RelNode

cascading.lingual.optiq.CascadingAggregateConverterRule

cascading.lingual.optiq.CascadingAggregateRel

cascading.lingual.optiq.CascadingCalcConverterRule

cascading.lingual.optiq.CascadingJoinRule

cascading.lingual.optiq.CascadingProjectConverterRule

cascading.lingual.optiq.CascadingSortRel

cascading.lingual.optiq.CascadingTableModificationConverterRule

cascading.lingual.tap.TapTable

net.hydromatic.optiq.impl.spark.SparkHandlerImpl

net.hydromatic.optiq.impl.ViewTable

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.