1. How does a B-tree index optimize range queries (e.g. price BETWEEN 10 AND 50)?
- By sorting and link-chaining the leaf nodes, allowing sequential reads once the start key is located.
- By converting numbers to hash keys.
- By splitting the table into physical partitions.
- B-trees do not support range queries.
Hint: B-tree leaf nodes are linked sequentially. Once the start boundary is found, the engine reads along the leaf chain until it exceeds the end boundary.