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.
[ Parent
| on HN ]