News for hackers. Stuff that matters.

A comment on Hash indexes are faster than btree indexes?. Parent comment

Re:Hash indexes are faster than btree indexes? by neilc on Monday March 20, 2017 @12:17PM (#13915370)
Postgres hash indexes use linear hashing, which effectively means that rehashing/expansion is done incrementally: https://en.wikipedia.org/wiki/Linear_hashing
[ Parent | on HN ]

There are no comments on this comment yet.