B*Tree
From Oracle FAQ
⧼orafaq-jumptonavigation⧽⧼orafaq-jumptosearch⧽
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 which contains the data: indexed column values and rowids.
| Glossary of Terms | ||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | # |
