Hash indexes are faster than btree indexes?

Re:Hash indexes are faster than btree indexes? by btreecat on Monday March 20, 2017 @10:37AM (#13914540)

I'm still dubious of any micro benchmark that says "x is better than y" since these are often not real world work loads.

Tuning/optimization starts with using the right schema.

[ Parent | on HN ]

Re:Hash indexes are faster than btree indexes? by marcosdumay on Monday March 20, 2017 @11:39AM (#13915072)

Hash indexes are "the right way" to speed-up index lookups.

They aren't used in Postgres because their implementation there has many problems. One of them is that they are slower than the theoretically suboptimal B-trees. In the process of fixing those problems, people will compare both indexes many times.

[ Parent | on HN ]