Examples of TPCHQuery3


Examples of eu.stratosphere.test.recordJobs.relational.TPCHQuery3

    dump(new WordCount().getPlan(DEFAULT_PARALLELISM_STRING, IN_FILE, OUT_FILE));
  }
 
  @Test
  public void dumpTPCH3() {
    dump(new TPCHQuery3().getPlan(DEFAULT_PARALLELISM_STRING, IN_FILE, IN_FILE, OUT_FILE));
  }
View Full Code Here

Examples of eu.stratosphere.test.recordJobs.relational.TPCHQuery3

    dump(new WordCount().getPlan(NO_ARGS));
  }
 
  @Test
  public void dumpTPCH3() {
    dump(new TPCHQuery3().getPlan("4", IN_FILE, IN_FILE, OUT_FILE));
    dump(new TPCHQuery3().getPlan(NO_ARGS));
  }
View Full Code Here

Examples of eu.stratosphere.test.recordJobs.relational.TPCHQuery3

   * Verifies that a robust repartitioning plan with a hash join is created in the absence of statistics.
   */
  @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

Examples of eu.stratosphere.test.recordJobs.relational.TPCHQuery3

   * Statistics that push towards a repartition merge join. If the join blows the data volume up significantly,
   * 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

Examples of eu.stratosphere.test.recordJobs.relational.TPCHQuery3

  private void testQueryGeneric(long orderSize, long lineItemSize,
      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

Examples of eu.stratosphere.test.recordJobs.relational.TPCHQuery3

  }

  @Override
  protected Plan getTestJob() {

    TPCHQuery3 tpch3 = new TPCHQuery3();
    return tpch3.getPlan(
        config.getString("dop", "1"),
        ordersPath,
        lineitemsPath,
        resultPath);
  }
View Full Code Here

Examples of org.apache.flink.test.recordJobs.relational.TPCHQuery3

    dump(new WordCount().getPlan(DEFAULT_PARALLELISM_STRING, IN_FILE, OUT_FILE));
  }
 
  @Test
  public void dumpTPCH3() {
    dump(new TPCHQuery3().getPlan(DEFAULT_PARALLELISM_STRING, IN_FILE, IN_FILE, OUT_FILE));
  }
View Full Code Here

Examples of org.apache.flink.test.recordJobs.relational.TPCHQuery3

    dump(new WordCount().getPlan(NO_ARGS));
  }
 
  @Test
  public void dumpTPCH3() {
    dump(new TPCHQuery3().getPlan("4", IN_FILE, IN_FILE, OUT_FILE));
    dump(new TPCHQuery3().getPlan(NO_ARGS));
  }
View Full Code Here

Examples of org.apache.flink.test.recordJobs.relational.TPCHQuery3

   * Verifies that a robust repartitioning plan with a hash join is created in the absence of statistics.
   */
  @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

Examples of org.apache.flink.test.recordJobs.relational.TPCHQuery3

   * Statistics that push towards a repartition merge join. If the join blows the data volume up significantly,
   * 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
TOP
Copyright © 2018 www.massapi.com. 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.