The B+ tree is commonly used for _______ indexing.

  • Hierarchical
  • Hash
  • Relational
  • Multilevel
B+ trees are primarily utilized in relational databases for indexing. They are efficient for range queries and allow for faster retrieval of data due to their balanced structure. This makes option 3, "Relational," the correct choice.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *