I would choose a B-tree index for queries involving range searches or sorting, as it maintains order and allows for efficient retrieval of ordered data. A hash index is better for exact match queries since it provides constant-time complexity for lookups but does not support range queries.