Docjar: A Java Source and Docuemnt Enginecom.*    java.*    javax.*    org.*    all    new    plug-in

Quick Search    Search Deep

Uses of Interface
org.apache.derby.iapi.sql.compile.Optimizer

Uses of Optimizer in org.apache.derby.iapi.sql.compile
 

Methods in org.apache.derby.iapi.sql.compile that return Optimizer
 Optimizer OptimizerFactory.getOptimizer(OptimizableList optimizableList, OptimizablePredicateList predicateList, org.apache.derby.iapi.sql.dictionary.DataDictionary dDictionary, RequiredRowOrdering requiredRowOrdering, int numTablesInQuery, org.apache.derby.iapi.sql.conn.LanguageConnectionContext lcc)
          Only one optimizer level should exist in the database, however, the connection may have multiple instances of that optimizer at a given time.
 Optimizer AccessPath.getOptimizer()
          Get the optimizer associated with this access path.
 

Methods in org.apache.derby.iapi.sql.compile with parameters of type Optimizer
 void OptimizableList.initAccessPaths(Optimizer optimizer)
          Init the access paths for these optimizables.
 boolean Optimizable.nextAccessPath(Optimizer optimizer, OptimizablePredicateList predList, RowOrdering rowOrdering)
          Choose the next access path to evaluate for this Optimizable.
 CostEstimate Optimizable.optimizeIt(Optimizer optimizer, OptimizablePredicateList predList, CostEstimate outerCost, RowOrdering rowOrdering)
          Choose the best access path for this Optimizable.
 void Optimizable.startOptimizing(Optimizer optimizer, RowOrdering rowOrdering)
          Begin the optimization process for this Optimizable.
 CostEstimate Optimizable.estimateCost(OptimizablePredicateList predList, org.apache.derby.iapi.sql.dictionary.ConglomerateDescriptor cd, CostEstimate outerCost, Optimizer optimizer, RowOrdering rowOrdering)
          Estimate the cost of scanning this Optimizable using the given predicate list with the given conglomerate.
 boolean Optimizable.feasibleJoinStrategy(OptimizablePredicateList predList, Optimizer optimizer)
          Is the current proposed join strategy for this optimizable feasible given the predicate list?
 void Optimizable.initAccessPaths(Optimizer optimizer)
          Init the access paths for this optimizable.
 boolean JoinStrategy.feasible(Optimizable innerTable, OptimizablePredicateList predList, Optimizer optimizer)
          Is this join strategy feasible under the circumstances?
 void JoinStrategy.estimateCost(Optimizable innerTable, OptimizablePredicateList predList, org.apache.derby.iapi.sql.dictionary.ConglomerateDescriptor cd, CostEstimate outerCost, Optimizer optimizer, CostEstimate costEstimate)
          Get the estimated cost for the join.