Question

The benefits of a B+ Tree compared hash-based indexing

Answer 1

The benefits of a B+ Tree indexing compared to hash-based indexing are:

1)As the keys are ordered in the case of B+ tree indexing it is best for range queries or range scans.

2)For both UNIQUE and NON-UNIQUE indexes the range scan is valid in B+ trees.

3)It is efficient for both prefix and full key matching queries.

4)B+trees are able to produce an ordered result even without the use of a sort heap.

5)For comparison operators like < that find a range of values Hash functions is not used while the B+ tree indexing can be used for comparison operators(+,<,<=,>,>=) or BETWEEN operators.

Hope it helps!!!