Class SearchParameters
java.lang.Object
org.apache.derby.impl.store.access.btree.SearchParameters
Parameters that are passed down during a recursive b-tree search.
This class is intended to be used as a struct, primarily to make
it easier to pass a number of search parameters around, and also
to make it easy to re-use objects and not re-allocate.
-
Field Summary
FieldsModifier and TypeFieldDescriptionThe b-tree this search is for.float
If this is an optimizer search, the fraction of rows that are "in" the the current search.float
If this is an optimizer search, the fraction of rows that are left of the current search.(package private) int
Value to return in comparisons where partial key matches exactly the partial key of a row.static final int
Position on key just left of a sequence of partial key matches.static final int
Position on last key in a sequence of partial key matches.boolean
Whether the row found exactly matched the searchKey.int
The resulting slot from the search.boolean
Whether the search is for the optimizer, to determine range of scan.The key being searched for.An index row with the correct types for the index, into which rows are read during the search. -
Constructor Summary
ConstructorsConstructorDescriptionSearchParameters
(DataValueDescriptor[] searchKey, int partial_key_match_op, DataValueDescriptor[] template, OpenBTree btree, boolean searchForOptimizer) Construct search parameters. -
Method Summary
-
Field Details
-
POSITION_LEFT_OF_PARTIAL_KEY_MATCH
public static final int POSITION_LEFT_OF_PARTIAL_KEY_MATCHPosition on key just left of a sequence of partial key matches. Used by scan which will then start scan on next key.- See Also:
-
POSITION_RIGHT_OF_PARTIAL_KEY_MATCH
public static final int POSITION_RIGHT_OF_PARTIAL_KEY_MATCHPosition on last key in a sequence of partial key matches. Used by scan which will then start scan on next key.- See Also:
-
searchKey
The key being searched for. Never intended to be modified for the lifetime of the object. -
partial_key_match_op
int partial_key_match_opValue to return in comparisons where partial key matches exactly the partial key of a row. Use this parameter to control where in a duplicate partial key list to position the search. Here are some examples: Assume: dataset of {1,0}, {5,1}, {5,2}, {6,4}; and partial key of {5}. If the scan is GE , then the scan intially wants to position on {1,0} (one before first qualifying row) - In this case when a partial match is found we want to return 1 when we hit {5,1}; but if the searchOperator is GT, then we want to return -1 on {5,1}, {5,2}, and then return 1 on {6,4}. partial_key_match_op = POSITION_LEFT_OF_PARTIAL_KEY_MATCH: Scan is looking for GE the partial key, so position the scan to the left of any partial key that exactly matches the partial key. If the scan is GE , then the scan intially wants to position on {1,0} (one before first qualifying row) - In this case when a partial match is found we want to return 1 when we hit {5,1}. partial_key_match_op = POSITION_RIGHT_OF_PARTIAL_KEY_MATCH: Scan is looking for GT the partial key, so position the scan to the right of any partial key that exactly matches the partial key. If the scan is GT, then the scan intially wants to position on {5,2} (one before first qualifying row) - In this case when a partial match is found we want to return -1 when we hit on {5,1}, {5,2}, and then return 1 on {6,4}. partial_key_match_op = 0: Scan does not care where in a set of duplicate partial keys to position to (not used currently). -
template
An index row with the correct types for the index, into which rows are read during the search. Rows are read into the template during a page search, but they will be overwritten; there is only one template per search. -
btree
The b-tree this search is for. Effectively read-only for the lifetime of this object. -
resultSlot
public int resultSlotThe resulting slot from the search. Updated when the search completes. -
resultExact
public boolean resultExactWhether the row found exactly matched the searchKey. Updated when the search completes. -
searchForOptimizer
public boolean searchForOptimizerWhether the search is for the optimizer, to determine range of scan. -
left_fraction
public float left_fractionIf this is an optimizer search, the fraction of rows that are left of the current search. When the search completes this number multiplied by the number of leaf rows in the table is the number of rows left of the result slot in the search. -
current_fraction
public float current_fractionIf this is an optimizer search, the fraction of rows that are "in" the the current search. This number is used as we descend down the tree to track the percentage of rows that we think are in the current subtree defined by all leaf's that can be reached from the current branch.
-
-
Constructor Details
-
SearchParameters
public SearchParameters(DataValueDescriptor[] searchKey, int partial_key_match_op, DataValueDescriptor[] template, OpenBTree btree, boolean searchForOptimizer) throws StandardException Construct search parameters.- Throws:
StandardException
- Standard exception policy.
-
-
Method Details