Uses for a B-tree index

A B-tree index is good for a query that retrieves a range of data values. If the data to be indexed has a logical sequence to which the concepts of less than, greater than, and equal apply, the generic B-tree index is a useful way to index your data.

Initially, the generic B-tree index supports the relational operators (<,<=,=,>=,>) on all built-in data types and orders the data in lexicographical sequence.

The optimizer considers whether to use the B-tree index to execute a query if you define a generic B-tree index on:
  • Columns used to join two tables
  • Columns that are filters for a query
  • Columns in an ORDER BY or GROUP BY clause
  • Results of functions that are filters for a query

Copyright© 2018 HCL Technologies Limited