Explain dynamic multilevel indexes using B-tree or B+ tree.

Welcome back.

and 2 others joined a min ago.

7.9kviews

written 8.9 years ago by

teamques10 ★ 70k

modified 3.8 years ago by

pedsangini276 • 4.8k

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

Marks: 10M

Year: May 2016

advanced database management systems

ADD COMMENT EDIT

1 Answer

181views

written 8.9 years ago by

teamques10 ★ 70k

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.

enter image description here

b.) A B-tree of order p=3. …

and 4 others joined a min ago.

ADD COMMENT EDIT

Community

Content

Company