User Guide

SAP AG November 2002

B* Trees for Tables with LONG Columns and Secondary Key

KI L

K: Key

I: Index

L: Long

Primary Data

Tree

Secondary Key

Tree

short LONG

Tree

long LONG

Trees

B*-Bäume

Table Access Using B* Tree

For all SELECT and DML (data manipulation language) statements, the database system

uses the same search algorithm to determine the leaf page [Page 103] in which a table entry

can be found or has to be changed.

Here you find some examples for table accessing using B* trees:

• Table Access (SELECT) Using B* Tree [Page

107]

• Table Access (INSERT) Using B* Tree [Page

109]

• Table Access (DELETE) Using B* Tree [Page

110]

• Table Access (UPDATE) Using B* Tree [Page

111]