Advantages of B*-tree Structure:

The B*-tree structure has the subsequent benefits:

All leaf blocks of the tree are at the similar depth, so retrieval of any record from anywhere in the index takes approximately the similar amount of time.

• B*-tree indexes would automatically stay balanced.
• Every blocks of the B*-tree are three-quarters full on the average.
• B*-trees gives excellent retrieval performance for a huge range of queries, involving range searches and exact match.
• Inserts, updates, and deletes are capable, maintaining key order for fast retrieval.
• B*-tree performance is good for both big and small tables and does not degrade as the size of a table grows.