List of singleScanRowCount() Examples

Examples of singleScanRowCount()

org.apache.derby.iapi.sql.compile.CostEstimate.singleScanRowCount()
Get the estimated number of rows returned by a single scan of the ResultSet that this CostEstimate models.

Examples of org.apache.derby.iapi.sql.compile.CostEstimate.singleScanRowCount()

                              rowOrdering);
      /* Copy child cost to this node's cost */
      costEstimate.setCost(
              childCost.getEstimatedCost(),
              childCost.rowCount(),
              childCost.singleScanRowCount());




      // Note: we don't call "optimizer.considerCost()" here because
      // a) the child will make that call as part of its own
      // "optimizeIt()" work above, and b) the child might have

View Full Code Here

Examples of org.apache.derby.iapi.sql.compile.CostEstimate.singleScanRowCount()

      childCost = childResult.costEstimate;


      costEstimate.setCost(
              childCost.getEstimatedCost(),
              childCost.rowCount(),
              childCost.singleScanRowCount());


      /* Note: Prior to the fix for DERBY-781 we had calls here
       * to set the cost estimate for BestAccessPath and
       * BestSortAvoidancePath to equal costEstimate.  That used
       * to be okay because prior to DERBY-781 we would only

View Full Code Here

Examples of org.apache.derby.iapi.sql.compile.CostEstimate.singleScanRowCount()

            optimizableList.
              getOptimizable(prevPosition).
                getBestAccessPath().
                  getCostEstimate();
          prevRowCount = localCE.rowCount();
          prevSingleScanRowCount = localCE.singleScanRowCount();
        }


        /*
        ** If there is no feasible join order, the cost estimate
        ** in the best access path may never have been set.

View Full Code Here

Examples of org.apache.derby.iapi.sql.compile.CostEstimate.singleScanRowCount()

                optimizableList.
                  getOptimizable(prevPosition).
                    getBestSortAvoidancePath().
                      getCostEstimate();
              prevRowCount = localCE.rowCount();
              prevSingleScanRowCount = localCE.singleScanRowCount();
              prevEstimatedCost = currentSortAvoidanceCost.getEstimatedCost() -
                          ap.getCostEstimate().getEstimatedCost();
            }


            currentSortAvoidanceCost.setCost(

View Full Code Here

Examples of org.apache.derby.iapi.sql.compile.CostEstimate.singleScanRowCount()

            if (ce == null)
            {
              permuteState = READY_TO_JUMP;  //come again?
              break;
            }
            rc[i] = ce.singleScanRowCount();
          }
          if (permuteState == JUMPING)
          {
            boolean doIt = false;
            int temp;

View Full Code Here

Examples of org.apache.derby.iapi.sql.compile.CostEstimate.singleScanRowCount()

      ** optimizable.
      */
      currentCost.setCost(
        currentCost.getEstimatedCost() + ce.getEstimatedCost(),
        ce.rowCount(),
        ce.singleScanRowCount());


      if (curOpt.considerSortAvoidancePath() &&
        requiredRowOrdering != null)
      {
        /* Add the cost for the sort avoidance path, if there is one */

View Full Code Here

Examples of org.apache.derby.iapi.sql.compile.CostEstimate.singleScanRowCount()


        currentSortAvoidanceCost.setCost(
          currentSortAvoidanceCost.getEstimatedCost() +
            ce.getEstimatedCost(),
          ce.rowCount(),
          ce.singleScanRowCount());
      }


      if (optimizerTrace)
      {
        trace(TOTAL_COST_NON_SA_PLAN, 0, 0, 0.0, null);

View Full Code Here

Examples of org.apache.derby.iapi.sql.compile.CostEstimate.singleScanRowCount()

          .getTrulyTheBestAccessPath().getCostEstimate();


      finalCostEstimate.setCost(
        finalCostEstimate.getEstimatedCost() + ce.getEstimatedCost(),
        ce.rowCount(),
        ce.singleScanRowCount());
    }


    return finalCostEstimate;
  }

View Full Code Here

Examples of org.apache.derby.iapi.sql.compile.CostEstimate.singleScanRowCount()

      }


      costEstimate.setCost(
        newCost,
        costEstimate.rowCount() * outerCost.rowCount(),
        costEstimate.singleScanRowCount());


      /*
      ** Choose the lock mode.  If the start/stop conditions are
      ** constant, choose row locking, because we will always match
      ** the same row.  If they are not constant (i.e. they include

View Full Code Here

Examples of org.apache.derby.iapi.sql.compile.CostEstimate.singleScanRowCount()

         */
        if (oneRowResultSetForSomeConglom && costEstimate.rowCount() <= 1)
        {
          costEstimate.setCost(costEstimate.getEstimatedCost() * 2,
                     costEstimate.rowCount() + 2,
                     costEstimate.singleScanRowCount() + 2);
        }
      }


      optimizer.trace(Optimizer.COST_OF_CONGLOMERATE_SCAN1,
              tableNumber, 0, 0.0, cd);

View Full Code Here

0 1 2 3 4 5

TOP

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.