Hash indexes are faster than Btree indexes?

PostgreSQL have supported Hash Index for a long time, but they are not much used in production mainly because they are not durable. Now, with the next version of PostgreSQL, they will be durable. The immediate question is how do they perform as compared to Btree indexes. There is a lot of work done in the coming version to make them faster. There are multiple ways in which we can compare the per

[tgk]

PostgreSQL10ではhash indexが性能向上している。unique indexとして使えばb-treeを超える読み取りのパフォーマンスが得られる