Package eu.stratosphere.api.common

Examples of eu.stratosphere.api.common.Plan

77
78
79
80
81
82
83
84
85
86
87
  @Test
  public void testCompileKMeansSingleStepWithOutStats() {
   
    KMeansBroadcast kmi = new KMeansBroadcast();
    Plan p = kmi.getPlan(String.valueOf(DEFAULT_PARALLELISM), IN_FILE, IN_FILE, OUT_FILE, String.valueOf(20));
   
    OptimizedPlan plan = compileNoStats(p);
    checkPlan(plan);
   
    new NepheleJobGraphGenerator().compileJobGraph(plan);
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
   */
  @Test
  public void testQueryNoStatistics() {
    try {
      TPCHQuery3 query = new TPCHQuery3();
      Plan p = query.getPlan(DEFAULT_PARALLELISM_STRING, IN_FILE, IN_FILE, OUT_FILE);
     
      // compile
      final OptimizedPlan plan = compileNoStats(p);
      final OptimizerPlanNodeResolver or = getOptimizerPlanNodeResolver(plan);
     
View Full Code Here
118
119
120
121
122
123
124
125
126
127
128
   * re-exploiting the sorted order is cheaper.
   */
  @Test
  public void testQueryWithStatsForRepartitionMerge() {
    TPCHQuery3 query = new TPCHQuery3();
    Plan p = query.getPlan(DEFAULT_PARALLELISM_STRING, IN_FILE, IN_FILE, OUT_FILE);
   
    // set compiler hints
    OperatorResolver cr = getContractResolver(p);
    JoinOperator match = cr.getNode("JoinLiO");
    match.getCompilerHints().setFilterFactor(100f);
View Full Code Here
144
145
146
147
148
149
150
151
      float ordersFilterFactor, float joinFilterFactor,
      boolean broadcastOkay, boolean partitionedOkay,
      boolean hashJoinFirstOkay, boolean hashJoinSecondOkay, boolean mergeJoinOkay)
  {
    TPCHQuery3 query = new TPCHQuery3();
    Plan p = query.getPlan(DEFAULT_PARALLELISM_STRING, IN_FILE, IN_FILE, OUT_FILE);
    testQueryGeneric(p, orderSize, lineItemSize, ordersFilterFactor, joinFilterFactor, broadcastOkay, partitionedOkay, hashJoinFirstOkay, hashJoinSecondOkay, mergeJoinOkay);
  }
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
     
      // add two sinks, to test the case of branching after an iteration
      result.print();
      result.print();
   
      Plan p = env.createProgramPlan();
     
      OptimizedPlan optPlan = compileNoStats(p);
     
      OptimizerPlanNodeResolver or = getOptimizerPlanNodeResolver(optPlan);
     
View Full Code Here
48
49
50
51
52
53
54
55
56
57
58
 
  @Test
  public void testCompileKMeansSingleStepWithStats() {
   
    KMeansSingleStep kmi = new KMeansSingleStep();
    Plan p = kmi.getPlan(String.valueOf(DEFAULT_PARALLELISM), IN_FILE, IN_FILE, OUT_FILE, String.valueOf(20));
   
    // set the statistics
    OperatorResolver cr = getContractResolver(p);
    FileDataSource pointsSource = cr.getNode(DATAPOINTS);
    FileDataSource centersSource = cr.getNode(CENTERS);
View Full Code Here
65
66
67
68
69
70
71
72
73
74
  @Test
  public void testCompileKMeansSingleStepWithOutStats() {
   
    KMeansSingleStep kmi = new KMeansSingleStep();
    Plan p = kmi.getPlan(String.valueOf(DEFAULT_PARALLELISM), IN_FILE, IN_FILE, OUT_FILE, String.valueOf(20));
   
    OptimizedPlan plan = compileNoStats(p);
    checkPlan(plan);
  }
View Full Code Here
73
74
75
76
77
78
79
80
81
82
83
 
  @Test
  public void testWorksetConnectedComponents() {
    WorksetConnectedComponents cc = new WorksetConnectedComponents();

    Plan plan = cc.getPlan(String.valueOf(DEFAULT_PARALLELISM),
        IN_FILE, IN_FILE, OUT_FILE, String.valueOf(100));

    OptimizedPlan optPlan = compileNoStats(plan);
    OptimizerPlanNodeResolver or = getOptimizerPlanNodeResolver(optPlan);
   
View Full Code Here
153
154
155
156
157
158
159
160
161
162
163
  }
 
  @Test
  public void testWorksetConnectedComponentsWithSolutionSetAsFirstInput() {

    Plan plan = getPlanForWorksetConnectedComponentsWithSolutionSetAsFirstInput(DEFAULT_PARALLELISM,
        IN_FILE, IN_FILE, OUT_FILE, 100);

    OptimizedPlan optPlan = compileNoStats(plan);
    OptimizerPlanNodeResolver or = getOptimizerPlanNodeResolver(optPlan);
   
View Full Code Here
297
298
299
300
301
302
303
304
305
      .fieldDelimiter(' ')
      .field(LongValue.class, 0)
      .field(LongValue.class, 1);

    // return the plan
    Plan plan = new Plan(result, "Workset Connected Components");
    plan.setDefaultParallelism(numSubTasks);
    return plan;
  }
View Full Code Here
TOP

Related Classes of eu.stratosphere.api.common.Plan

  • eu.stratosphere.addons.hbase.example.HBaseReadExample
  • eu.stratosphere.api.avro.AvroWithEmptyArrayITCase
  • eu.stratosphere.api.java.functions.SemanticPropertiesTranslationTest
  • eu.stratosphere.api.java.LocalEnvironment
  • eu.stratosphere.api.java.operators.translation.AggregateTranslationTest
  • eu.stratosphere.api.java.operators.translation.DeltaIterationTranslationTest
  • eu.stratosphere.api.java.operators.translation.ReduceTranslationTests
  • eu.stratosphere.api.java.record.io.avro.example.ReflectiveAvroTypeExample
  • eu.stratosphere.api.java.record.io.jdbc.example.JDBCExample
  • eu.stratosphere.api.java.RemoteEnvironment
    • 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.