Mumbai University > Information Technology > Sem 5 > Advanced Database Management System

Marks: 10M

Year: May 2016

B-Tree structure:-

• Indexing can be made more efficient by including more index levels.
• With an efficient dynamic insertion and deletion of items being allowed in B-trees; you can scale the levels as & when needed.

a.) A node in B-tree with q-1 search values.

b.) A B-tree of order p=3. The values were inserted in order. 8, 5, 1, 7, 3, 12, 9, 6

The diagram (a.) contains q number of nodes that allow q-1 search values. Diagram (b.) shows insertion of data items in nodes respectively in order 8, 5, 1, 7, 3, 12, 9 & 6.