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.Hashtables seem to be preferable in terms of di
阅读背景：
为什么DB索引使用平衡树，而不是散列表?
来源：互联网
分享到：
