Why DB indexes use balanced trees, not hashtables?

Viewed 4399

Hashtables seem to be preferable in terms of disk access. What is the real reason that indexes usually implemented with a tree? Sorry if it's infantile, but i did not find the straight answer on SO.

7 Answers
Related