MULTILEVEL INDEXING AND B TREES

PROBLEMS WITH SIMPLE INDEXES –

1. Seeking the index value is low i.e binary search

2. Insertion and deletion takes O(n) disk accesses ( as indexes are in sorted
order) which is very slow.

In Multilevel indexing index of an index file is built. Multi-record multi-

level indexes really help reduce the number of disk accesses and their
overhead space costs are minimal, inserting a new key or deleting an old
one is very costly.

Examples 1) B Trees

B-Trees: An Overview (explain the B trees done in class and following points)

 B-Trees are built upward from the bottom rather than downward
from the top, thus addressing the problems of Paged Trees: with B-Trees,
we allow the root to emerge rather than set it up and then find ways to
change it.

 B-Trees are multi-level indexes that solve the problem of linear cost of
insertion and deletion.

 B-Trees are now the standard way to represent indexes.

 Each node of a B-Tree is an Index Record. Each of these records has the
same maximum number of key-reference pairs called the order of the B-
Tree. 

Show one B tree diagram as an example of multilevel indexing.

2) B+ Trees – diagram and definition that I have done in class. Diagram

contains the index set to explain the multilevel indexing.