A B*Tree is a data structure used by Oracle for storing indexes. A B*Tree index consists of levels of branch blocks, each level containing pointers to the next lower level, with a set of leaf blocks at the lowest level.
