Why is there a need for Tree-based indexing mechanisms ?

Question

In DBMS, why is there a need for the use of tree based indexing algorithms, when we have multilevel indexes available for use ?

Answer 1

Multilevel indexing are static . while b and b+ tree dynamic . the advantage is , databases are very much dynamic in nature the data in the databases change a lot . so if we do multilevel indexing according to and instance and then the data incresed the multilevel index will fail . so we need a dynamic thing like trees . they automatically grow and shrink as the data varies.

Answer 2

Multilevel indexing is static,B and B+ tree mechanism is dynamic.you can add/delete dynamically.

Comments

what is the advantage in dynamic adding and deletion ?