Re:Understanding Postgres Performance
by jeltz on Friday October 05, 2012 @07:09AM
(#4616387)
A hash index will also require one disk seek which makes b-tree indexes and hash indexes have more similar performance than the theoretical O(log n) vs O(1) would indicate.
[ Parent
| on HN ]
There are no comments on this comment yet.