When to Use B-tree
B-tree is the most versatile storage structure, as it supports both exact match and range retrievals and includes a dynamic index, so that frequent remodification is not necessary.
B-tree is a good storage structure to use in any of these cases:
• The table is growing at a rapid rate.
• You use pattern matching.
• You retrieve ranges of key values.
• You retrieve using only the leftmost part of a multi-column key.
B-tree is a poor storage structure to use if:
• The table is relatively static.
• The table is small, static, and access is heavily concurrent.