PostgreSQL's Hash Indexes Are Now Cool
Wasn't sure what a hash index was vs. btree<p>Short version - hash indexes are faster in PG11, but they only apply to "where = foobar" queries, giving a 0(1) time. Btree indexes have O(logn)<p>But hash indexes can't be applied to range clauses, like "where < 50". You can still use a btree index however.<p>SO post:<p><a href="https://stackoverflow.com/a/398921" rel="nofollow">https://stackoverflow.com/a/398921</a>