A radix index scan operation is used to retrieve the rows from a table in a keyed sequence. Like a Table Scan, all of the rows in the index will be sequentially processed, but the resulting row numbers will be sequenced based upon the key columns.
The sequenced rows can be used by the optimizer to satisfy a portion of the query request (such as ordering or grouping). They can be also used to provide faster throughput by performing selection against the index keys rather than all the rows in the table. Since the I/Os associated with the index will only contain the index keys, typically more rows can be paged into memory in one I/O against the index than the rows from a table with a large number of columns.
Data access method | Radix index scan |
---|---|
Description | Sequentially scan and process all of the keys associated with the index. Any selection is applied to every key value of the index before a table row |
Advantages |
|
Considerations | Generally requires a Table Probe to be performed to extract any remaining columns required to satisfy the query. Can perform poorly when a large number of rows are selected because of the random I/O associated with the Table Probe. |
Likely to be used |
|
Example SQL statement | CREATE INDEX X1 ON Employee (LastName, WorkDept) SELECT * FROM Employee WHERE WorkDept BETWEEN 'A01' AND 'E01' ORDER BY LastName OPTIMIZE FOR 30 ROWS |
Messages indicating use |
|
SMP parallel enabled | Yes |
Also referred to as | Index Scan Index Scan, Preload Index Scan, Distinct Index Scan Distinct, Preload Index Scan, Key Selection |
Visual Explain icon |