Apache Derby Database Engine and Embedded JDBC Driver 10.17.1.0 · org.apache.derby.iapi.sql.compile.OptTrace

Method Summary

Modifier and Type	Method and Description
public void	printToWriter(PrintWriter out) Print the trace so far.
public void	traceAddingUnorderedOptimizable(int predicateCount) Say that we're adding an unordered optimizable.
public void	traceChangingAccessPathForTable(int tableNumber) Say that we're considering a different access path for a table.
public void	traceCheapestPlanSoFar(int planType, CostEstimate currentCost) Report the cost of the cheapest plan so far.
public void	traceCompleteJoinOrder() Say that we have a complete join order.
public void	traceCompositeSelectivityFromStatistics(double statCompositeSelectivity) Report the selectivity calculated from SYSSTATISTICS.
public void	traceConsideringConglomerate(ConglomerateDescriptor cd, int tableNumber) Report that we are considering a conglomerate for a table.
public void	traceConsideringJoinStrategy(JoinStrategy js, int tableNumber) Say that we're considering a particular join strategy on a particular table.
public void	traceConstantStartStopPositions() Say that we're setting the lock mode to MODE_RECORD because the start and stop positions are all constant.
public void	traceCostIncludingCompositeSelectivityFromStats(CostEstimate cost, int tableNumber) Report the cost based on selectivities coming out of SYSSTATISTICS.
public void	traceCostIncludingExtra1stColumnSelectivity(CostEstimate cost, int tableNumber) Report the cost of a scan given the selectivity of an extra first column.
public void	traceCostIncludingExtraNonQualifierSelectivity(CostEstimate cost, int tableNumber) Report the cost if we include an extra non-qualifier.
public void	traceCostIncludingExtraQualifierSelectivity(CostEstimate cost, int tableNumber) Report the cost if we include an extra qualifier.
public void	traceCostIncludingExtraStartStop(CostEstimate cost, int tableNumber) Report the cost if we include an extra start/stop.
public void	traceCostIncludingStatsForIndex(CostEstimate cost, int tableNumber) Report the cost based on index statistics.
public void	traceCostOfConglomerateScan(int tableNumber, ConglomerateDescriptor cd, CostEstimate costEstimate, int numExtraFirstColumnPreds, double extraFirstColumnSelectivity, int numExtraStartStopPreds, double extraStartStopSelectivity, int startStopPredCount, double statStartStopSelectivity, int numExtraQualifiers, double extraQualifierSelectivity, int numExtraNonQualifiers, double extraNonQualifierSelectivity) Report the cost of a conglomerate scan.
public void	traceCostOfNoncoveringIndex(CostEstimate cost, int tableNumber) Report the cost of using a non-covering index.
public void	traceCostOfNScans(int tableNumber, double rowCount, CostEstimate cost) Report the cost of scanning a table a certain number of times
public void	traceCostWithoutSortAvoidance(CostEstimate currentCost) Report the cost without a sort.
public void	traceCostWithSortAvoidance(CostEstimate currentSortAvoidanceCost) Report the cost with sort avoidance.
public void	traceCurrentPlanAvoidsSort(CostEstimate bestCost, CostEstimate currentSortAvoidanceCost) Say that the current plan avoids a sort.
public void	traceEndQueryBlock() End tracing the optimization of a query block.
public void	traceEstimatingCostOfConglomerate(ConglomerateDescriptor cd, int tableNumber) Report the cost of using a particular conglomerate to scan a table.
public void	traceHashKeyColumns(int[] hashKeyColumns) Report the columns being traced
public void	traceIllegalUserJoinOrder() Say that the user specified an impossible join order.
public void	traceJoinOrderConsideration(int joinPosition, int[] proposedJoinOrder, JBitSet assignedTableMap) Say that we're considering a join order.
public void	traceLookingForSpecifiedIndex(String indexName, int tableNumber) Say that we're looking for an index specified by optimizer hints.
public void	traceModifyingAccessPaths(int optimizerID) Say that we're modifying access paths.
public void	traceNextAccessPath(String baseTable, int predicateCount) Report that we are advancing to the next access path for the table.
public void	traceNoBestPlan() Say that we couldn't find a best plan.
public void	traceNoMoreConglomerates(int tableNumber) Say that we have exhausted the conglomerate possibilities for a table.
public void	traceNonCoveringIndexCost(double cost, int tableNumber) Say that we're considering a non-covering index.
public void	traceNoStartStopPosition() Say that we're setting the lock mode to MODE_TABLE because there is no start/stop position.
public void	traceOptimizingJoinNode() Say that we're starting to optimize a join node
public void	traceRememberingBestAccessPath(AccessPath accessPath, int tableNumber, int planType) Report that we've found a best access path.
public void	traceRememberingBestAccessPathSubstring(AccessPath ap, int tableNumber) Report the best access path for the table so far.
public void	traceRememberingBestJoinOrder(int joinPosition, int[] bestJoinOrder, int planType, CostEstimate planCost, JBitSet assignedTableMap) Say that we are remembering the current plan as the best join order so far.
public void	traceRememberingBestSortAvoidanceAccessPathSubstring(AccessPath ap, int tableNumber) Report the best sort-avoiding access path for this table so far.
public void	traceRememberingBestUnknownAccessPathSubstring(AccessPath ap, int tableNumber) Report an optimizer failure, e.g., while optimizing an outer join
public void	traceRememberingJoinStrategy(JoinStrategy joinStrategy, int tableNumber) Say that we've found a new best join strategy for the table.
public void	traceScanningHeapWithUniqueKey() Say that we're considering scanning a heap even though we have a unique key match.
public void	traceShortCircuiting(boolean timeExceeded, Optimizable thisOpt, int joinPosition) Say that we short-circuited a join order.
public void	traceSingleMatchedRowCost(double cost, int tableNumber) Report the cost of a scan which will match exactly one row.
public void	traceSkipHashJoinNoHashKeys() Say we won't consider a hash join because there are no hash key columns.
public void	traceSkippingBecauseTooMuchMemory(int maxMemoryPerTable) Say that we are skipping a plan because it consumes too much memory.
public void	traceSkippingJoinOrder(int nextOptimizable, int joinPosition, int[] proposedJoinOrder, JBitSet assignedTableMap) Say that we're skipping the join order starting with the next optimizable.
public void	traceSkipUnmaterializableHashJoin() Say that we won't consider a hash join because the result can't be materialized
public void	traceSortCost(CostEstimate sortCost, CostEstimate currentCost) Report the sort cost.
public void	traceSortNeededForOrdering(int planType, RequiredRowOrdering requiredRowOrdering) Report that this plan needs a sort
public void	traceStartQueryBlock(long timeOptimizationStarted, int optimizerID, OptimizableList optimizableList) Start optimizer tracing for a query block.
public void	traceStartStatement(String statementText) Start the start of tracing a statement.
public void	traceTimeout(long currentTime, CostEstimate bestCost) Say that the optimizer ran out of time.
public void	traceUserJoinOrderOptimized() Say that we have optimized the user-specified join order.
public void	traceVacuous() Say that there's nothing to optimizer.

Method Detail

printToWriter	back to summary
public void printToWriter(PrintWriter out) Print the trace so far.

traceAddingUnorderedOptimizable	back to summary
public void traceAddingUnorderedOptimizable(int predicateCount) Say that we're adding an unordered optimizable.

traceChangingAccessPathForTable	back to summary
public void traceChangingAccessPathForTable(int tableNumber) Say that we're considering a different access path for a table.

traceCheapestPlanSoFar	back to summary
public void traceCheapestPlanSoFar(int planType, CostEstimate currentCost) Report the cost of the cheapest plan so far.

traceCompleteJoinOrder	back to summary
public void traceCompleteJoinOrder() Say that we have a complete join order.

traceCompositeSelectivityFromStatistics	back to summary
public void traceCompositeSelectivityFromStatistics(double statCompositeSelectivity) Report the selectivity calculated from SYSSTATISTICS.

traceConsideringConglomerate	back to summary
public void traceConsideringConglomerate(ConglomerateDescriptor cd, int tableNumber) Report that we are considering a conglomerate for a table.

traceConsideringJoinStrategy	back to summary
public void traceConsideringJoinStrategy(JoinStrategy js, int tableNumber) Say that we're considering a particular join strategy on a particular table.

traceConstantStartStopPositions	back to summary
public void traceConstantStartStopPositions() Say that we're setting the lock mode to MODE_RECORD because the start and stop positions are all constant.

traceCostIncludingCompositeSelectivityFromStats	back to summary
public void traceCostIncludingCompositeSelectivityFromStats(CostEstimate cost, int tableNumber) Report the cost based on selectivities coming out of SYSSTATISTICS.

traceCostIncludingExtra1stColumnSelectivity	back to summary
public void traceCostIncludingExtra1stColumnSelectivity(CostEstimate cost, int tableNumber) Report the cost of a scan given the selectivity of an extra first column.

traceCostIncludingExtraNonQualifierSelectivity	back to summary
public void traceCostIncludingExtraNonQualifierSelectivity(CostEstimate cost, int tableNumber) Report the cost if we include an extra non-qualifier.

traceCostIncludingExtraQualifierSelectivity	back to summary
public void traceCostIncludingExtraQualifierSelectivity(CostEstimate cost, int tableNumber) Report the cost if we include an extra qualifier.

traceCostIncludingExtraStartStop	back to summary
public void traceCostIncludingExtraStartStop(CostEstimate cost, int tableNumber) Report the cost if we include an extra start/stop.

traceCostIncludingStatsForIndex	back to summary
public void traceCostIncludingStatsForIndex(CostEstimate cost, int tableNumber) Report the cost based on index statistics.

traceCostOfConglomerateScan	back to summary
public void traceCostOfConglomerateScan(int tableNumber, ConglomerateDescriptor cd, CostEstimate costEstimate, int numExtraFirstColumnPreds, double extraFirstColumnSelectivity, int numExtraStartStopPreds, double extraStartStopSelectivity, int startStopPredCount, double statStartStopSelectivity, int numExtraQualifiers, double extraQualifierSelectivity, int numExtraNonQualifiers, double extraNonQualifierSelectivity) Report the cost of a conglomerate scan.

traceCostOfConglomerateScan

back to summary

public void traceCostOfConglomerateScan(int tableNumber, ConglomerateDescriptor cd, CostEstimate costEstimate, int numExtraFirstColumnPreds, double extraFirstColumnSelectivity, int numExtraStartStopPreds, double extraStartStopSelectivity, int startStopPredCount, double statStartStopSelectivity, int numExtraQualifiers, double extraQualifierSelectivity, int numExtraNonQualifiers, double extraNonQualifierSelectivity)

Report the cost of a conglomerate scan.

traceCostOfNoncoveringIndex	back to summary
public void traceCostOfNoncoveringIndex(CostEstimate cost, int tableNumber) Report the cost of using a non-covering index.

traceCostOfNScans	back to summary
public void traceCostOfNScans(int tableNumber, double rowCount, CostEstimate cost) Report the cost of scanning a table a certain number of times

traceCostWithoutSortAvoidance	back to summary
public void traceCostWithoutSortAvoidance(CostEstimate currentCost) Report the cost without a sort.

traceCostWithSortAvoidance	back to summary
public void traceCostWithSortAvoidance(CostEstimate currentSortAvoidanceCost) Report the cost with sort avoidance.

traceCurrentPlanAvoidsSort	back to summary
public void traceCurrentPlanAvoidsSort(CostEstimate bestCost, CostEstimate currentSortAvoidanceCost) Say that the current plan avoids a sort.

traceEndQueryBlock	back to summary
public void traceEndQueryBlock() End tracing the optimization of a query block.

traceEstimatingCostOfConglomerate	back to summary
public void traceEstimatingCostOfConglomerate(ConglomerateDescriptor cd, int tableNumber) Report the cost of using a particular conglomerate to scan a table.

traceHashKeyColumns	back to summary
public void traceHashKeyColumns(int[] hashKeyColumns) Report the columns being traced

traceIllegalUserJoinOrder	back to summary
public void traceIllegalUserJoinOrder() Say that the user specified an impossible join order.

traceJoinOrderConsideration	back to summary
public void traceJoinOrderConsideration(int joinPosition, int[] proposedJoinOrder, JBitSet assignedTableMap) Say that we're considering a join order.

traceLookingForSpecifiedIndex	back to summary
public void traceLookingForSpecifiedIndex(String indexName, int tableNumber) Say that we're looking for an index specified by optimizer hints.

traceModifyingAccessPaths	back to summary
public void traceModifyingAccessPaths(int optimizerID) Say that we're modifying access paths.

traceNextAccessPath	back to summary
public void traceNextAccessPath(String baseTable, int predicateCount) Report that we are advancing to the next access path for the table.

traceNoBestPlan	back to summary
public void traceNoBestPlan() Say that we couldn't find a best plan.

traceNoMoreConglomerates	back to summary
public void traceNoMoreConglomerates(int tableNumber) Say that we have exhausted the conglomerate possibilities for a table.

traceNonCoveringIndexCost	back to summary
public void traceNonCoveringIndexCost(double cost, int tableNumber) Say that we're considering a non-covering index.

traceNoStartStopPosition	back to summary
public void traceNoStartStopPosition() Say that we're setting the lock mode to MODE_TABLE because there is no start/stop position.

traceOptimizingJoinNode	back to summary
public void traceOptimizingJoinNode() Say that we're starting to optimize a join node

traceRememberingBestAccessPath	back to summary
public void traceRememberingBestAccessPath(AccessPath accessPath, int tableNumber, int planType) Report that we've found a best access path.

traceRememberingBestAccessPathSubstring	back to summary
public void traceRememberingBestAccessPathSubstring(AccessPath ap, int tableNumber) Report the best access path for the table so far.

traceRememberingBestJoinOrder	back to summary
public void traceRememberingBestJoinOrder(int joinPosition, int[] bestJoinOrder, int planType, CostEstimate planCost, JBitSet assignedTableMap) Say that we are remembering the current plan as the best join order so far.

traceRememberingBestSortAvoidanceAccessPathSubstring	back to summary
public void traceRememberingBestSortAvoidanceAccessPathSubstring(AccessPath ap, int tableNumber) Report the best sort-avoiding access path for this table so far.

traceRememberingBestUnknownAccessPathSubstring	back to summary
public void traceRememberingBestUnknownAccessPathSubstring(AccessPath ap, int tableNumber) Report an optimizer failure, e.g., while optimizing an outer join

traceRememberingJoinStrategy	back to summary
public void traceRememberingJoinStrategy(JoinStrategy joinStrategy, int tableNumber) Say that we've found a new best join strategy for the table.

traceScanningHeapWithUniqueKey	back to summary
public void traceScanningHeapWithUniqueKey() Say that we're considering scanning a heap even though we have a unique key match.

traceShortCircuiting	back to summary
public void traceShortCircuiting(boolean timeExceeded, Optimizable thisOpt, int joinPosition) Say that we short-circuited a join order.

traceSingleMatchedRowCost	back to summary
public void traceSingleMatchedRowCost(double cost, int tableNumber) Report the cost of a scan which will match exactly one row.

traceSkipHashJoinNoHashKeys	back to summary
public void traceSkipHashJoinNoHashKeys() Say we won't consider a hash join because there are no hash key columns.

traceSkippingBecauseTooMuchMemory	back to summary
public void traceSkippingBecauseTooMuchMemory(int maxMemoryPerTable) Say that we are skipping a plan because it consumes too much memory.

traceSkippingJoinOrder	back to summary
public void traceSkippingJoinOrder(int nextOptimizable, int joinPosition, int[] proposedJoinOrder, JBitSet assignedTableMap) Say that we're skipping the join order starting with the next optimizable.

traceSkipUnmaterializableHashJoin	back to summary
public void traceSkipUnmaterializableHashJoin() Say that we won't consider a hash join because the result can't be materialized

traceSortCost	back to summary
public void traceSortCost(CostEstimate sortCost, CostEstimate currentCost) Report the sort cost.

traceSortNeededForOrdering	back to summary
public void traceSortNeededForOrdering(int planType, RequiredRowOrdering requiredRowOrdering) Report that this plan needs a sort

traceStartQueryBlock	back to summary
public void traceStartQueryBlock(long timeOptimizationStarted, int optimizerID, OptimizableList optimizableList) Start optimizer tracing for a query block.

traceStartStatement	back to summary
public void traceStartStatement(String statementText) Start the start of tracing a statement.

traceTimeout	back to summary
public void traceTimeout(long currentTime, CostEstimate bestCost) Say that the optimizer ran out of time.

traceUserJoinOrderOptimized	back to summary
public void traceUserJoinOrderOptimized() Say that we have optimized the user-specified join order.

traceVacuous	back to summary
public void traceVacuous() Say that there's nothing to optimizer.

public Interface OptTrace

Method Summary

Method Detail