Timeline for How should I index a UUID in Postgres?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 2, 2018 at 3:40 | history | edited | Craig Ringer | CC BY-SA 4.0 |
added 147 characters in body
|
| Jun 30, 2018 at 6:00 | comment | added | Glenn Morton | There are some good write ups on hash index perf improvements in v10 and v11: rhaas.blogspot.com/2017/09/… - amitkapila16.blogspot.com/2017/03/… | |
| Jan 30, 2018 at 0:25 | comment | added | sudo |
A couple of years later, in my experience, hash hasn't been much faster than b-tree, even in Postgres 10. But since hash indexes take so much less disk space than b-tree, it might be faster in a setup where big indexes become a problem, which I feel hasn't been the case for me. Well I'll keep an eye out now that I can actually use them safely in v10.
|
|
| Oct 31, 2017 at 14:54 | comment | added | rintaun |
As of PostgreSQL 10, hash indexes are now crash-safe. That said, hash indexes can only be used with =, so if you need any other operators, b-tree is still preferable.
|
|
| Apr 24, 2017 at 20:30 | comment | added | Volte |
While the statement regarding hash indexes versus b-tree is a commonly held belief, I think it would be helpful to cite sources for such a claim.
|
|
| S Aug 18, 2015 at 22:52 | history | suggested | Basil Bourque | CC BY-SA 3.0 |
Linked to doc.
|
| Aug 18, 2015 at 22:51 | review | Suggested edits | |||
| S Aug 18, 2015 at 22:52 | |||||
| May 26, 2015 at 19:31 | vote | accept | sudo | ||
| May 26, 2015 at 0:55 | history | answered | Craig Ringer | CC BY-SA 3.0 |