Postgres hash indexes use linear hashing, which effectively means that rehashing...

		neilc on March 20, 2017 \| parent \| context \| favorite \| on: Hash indexes are faster than btree indexes? Postgres hash indexes use linear hashing, which effectively means that rehashing/expansion is done incrementally: https://en.wikipedia.org/wiki/Linear_hashing