Practice
Learn
← Quit
0 / 0 correct
Data Structures
Hard
1 of 435
What advantage does a B-tree have over a hash index for an in-memory database index?
A
It's always faster for point lookups
B
It supports ordered iteration and range queries; hash indexes support only equality
C
It never needs rebalancing
D
It uses no memory