User Guide

SAP AG November 2002
Table Access (SELECT) using B* Tree (2)
3. The search continues at the leaf level. In the position list of the leaf page a binary search
algorithm is used. The corresponding address information for the table entry with the key
value Athens is evaluated.
Ardwick|........
Data Entries
(unsorted)
Anizy |.......
Apach |.
Apensen|.....
Arnhem |...
Athens |Greece
SAP DB Data Page
Anizy |.......
Ardwick|.......
Apach |.
ensen|.....
1
45
362
Arnhem |...
Ap-
Anizy Athens..
Position List
(sorted)
Athens |Greece
Sort Order:
4. The database system scans the data section in the leaf page until it has found the
corresponding table entries. The search is then complete.
Table Access (INSERT) Using B* Tree
Table Access Using B* Tree [Page 107] is illustrated using the example of a INSERT
statement.
User Manual: SAP DB 109