Examples of eu.stratosphere.compiler.plan.PlanNode

eu.stratosphere.compiler.plan.PlanNode
The representation of a data exchange between to operators. The data exchange can realize a shipping strategy, which established global properties, and a local strategy, which establishes local properties.
Because we currently deal only with plans where the operator order is fixed, many properties are equal among candidates and are determined prior to the enumeration (such as for example constant/dynamic path membership). Hence, many methods will delegate to the {@code OptimizerNode} that represents the node this candidate wascreated for.

        }
        
        // check whether this node is a child of a node with the same contract (aka combiner)
        boolean shouldAdd = true;
        for (Iterator<PlanNode> iter = list.iterator(); iter.hasNext();) {
          PlanNode in = iter.next();
          if (in.getOriginalOptimizerNode().getPactContract() == c) {
            // is this the child or is our node the child
            if (in instanceof SingleInputPlanNode && n instanceof SingleInputPlanNode) {
              SingleInputPlanNode thisNode = (SingleInputPlanNode) n;
              SingleInputPlanNode otherNode = (SingleInputPlanNode) in;

View Full Code Here

    public <T extends PlanNode> T getNode(String name, Class<? extends Function> stubClass) {
      List<PlanNode> nodes = this.map.get(name);
      if (nodes == null || nodes.isEmpty()) {
        throw new RuntimeException("No node found with the given name and stub class.");
      } else {
        PlanNode found = null;
        for (PlanNode node : nodes) {
          if (node.getClass() == stubClass) {
            if (found == null) {
              found = node;
            } else {

View Full Code Here

        }
        
        // check whether this node is a child of a node with the same contract (aka combiner)
        boolean shouldAdd = true;
        for (Iterator<PlanNode> iter = list.iterator(); iter.hasNext();) {
          PlanNode in = iter.next();
          if (in.getOriginalOptimizerNode().getPactContract() == c) {
            // is this the child or is our node the child
            if (in instanceof SingleInputPlanNode && n instanceof SingleInputPlanNode) {
              SingleInputPlanNode thisNode = (SingleInputPlanNode) n;
              SingleInputPlanNode otherNode = (SingleInputPlanNode) in;

View Full Code Here

    public <T extends PlanNode> T getNode(String name, Class<? extends Function> stubClass) {
      List<PlanNode> nodes = this.map.get(name);
      if (nodes == null || nodes.isEmpty()) {
        throw new RuntimeException("No node found with the given name and stub class.");
      } else {
        PlanNode found = null;
        for (PlanNode node : nodes) {
          if (node.getClass() == stubClass) {
            if (found == null) {
              found = node;
            } else {

View Full Code Here

         */
        if (visitable instanceof NAryUnionPlanNode) {
          int numberInputs = 0;
          for (Iterator<Channel> inputs = visitable.getInputs(); inputs.hasNext(); numberInputs++) {
            final Channel inConn = inputs.next();
            PlanNode inNode = inConn.getSource();
            Assert.assertTrue("Input of Union should be FlatMapOperators",
                inNode.getPactContract() instanceof FlatMapOperatorBase);
            Assert.assertTrue("Shipment strategy under union should partition the data",
                inConn.getShipStrategy() == ShipStrategyType.PARTITION_HASH); 
          }
          
          Assert.assertTrue("NAryUnion should have " + NUM_INPUTS + " inputs", numberInputs == NUM_INPUTS);

View Full Code Here

      // check the iteration
      WorksetIterationPlanNode iteration = (WorksetIterationPlanNode) sink.getInput().getSource();
      assertEquals(DEFAULT_PARALLELISM, iteration.getDegreeOfParallelism());
      
      // check the solution set join and the delta
      PlanNode ssDelta = iteration.getSolutionSetDeltaPlanNode();
      assertTrue(ssDelta instanceof DualInputPlanNode); // this is only true if the update functions preserves the partitioning
      
      DualInputPlanNode ssJoin = (DualInputPlanNode) ssDelta;
      assertEquals(DEFAULT_PARALLELISM, ssJoin.getDegreeOfParallelism());
      assertEquals(ShipStrategyType.PARTITION_HASH, ssJoin.getInput1().getShipStrategy());

View Full Code Here

      // check the iteration
      WorksetIterationPlanNode iteration = (WorksetIterationPlanNode) sink.getInput().getSource();
      assertEquals(DEFAULT_PARALLELISM, iteration.getDegreeOfParallelism());
      
      // check the solution set join and the delta
      PlanNode ssDelta = iteration.getSolutionSetDeltaPlanNode();
      assertTrue(ssDelta instanceof DualInputPlanNode); // this is only true if the update functions preserves the partitioning
      
      DualInputPlanNode ssJoin = (DualInputPlanNode) ssDelta;
      assertEquals(DEFAULT_PARALLELISM, ssJoin.getDegreeOfParallelism());
      assertEquals(ShipStrategyType.PARTITION_HASH, ssJoin.getInput1().getShipStrategy());

View Full Code Here

0 1 2

TOP

Related Classes of eu.stratosphere.compiler.plan.PlanNode

eu.stratosphere.compiler.costs.Costs

eu.stratosphere.compiler.dag.BulkIterationNode

eu.stratosphere.compiler.dag.OptimizerNode

eu.stratosphere.compiler.dag.SingleInputNode

eu.stratosphere.compiler.dag.TwoInputNode

eu.stratosphere.compiler.dag.WorksetIterationNode

eu.stratosphere.compiler.PactCompiler

eu.stratosphere.compiler.PactCompiler$BinaryUnionReplacer

eu.stratosphere.compiler.plandump.PlanJSONDumpGenerator

eu.stratosphere.compiler.plantranslate.NepheleJobGraphGenerator

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.