Table Access 

The logical term table denotes possible primary data, including data in columns of type LONG and data of secondary key structures.

All searches and changes in the table are executed in the computer’s main memory via SQL statements (SELECT, INSERT, UPDATE, DELETE,...), which means that they are carried out very quickly. The B* tree structure changes in all cases of INSERT, UPDATE and DELETE statements if there is not enough space in the target page for the new information or the fill level of a page falls below the predefined fill level.

See also:

B* Trees for Tables

Table Access Using a B* Tree