News for hackers. Stuff that matters.
Re:Hash indexes are faster than btree indexes? by ThePhysicist on Monday March 20, 2017 @03:11PM (#13916823)
Great news if they will really make hash indexes durable! That will allow some interesting new developments, such as O(1) efficient lookups regardless of table size. This in turn will make it easier and more appealing to build graph databases using Postgres.
Re:Hash indexes are faster than btree indexes? by jeltz on Monday March 20, 2017 @04:04PM (#13917226)
Yes, they are durable now in the master branch.