For all SELECT and DML (data manipulation language) statements, the database system uses the same search algorithm to determine the leaf page, in which a table entry can be found or has to be changed.
Here are some examples of how to use B* trees to access tables:
· Table access (SELECT) using a B* tree
· Table access (INSERT) using a B* tree
· Table access (DELETE) using a B* tree
· Table access (UPDATE) using a B* tree