May I know for simple "=" operation query, for "Hash index" vs. "B-tree" index, which can provide better performance please?
I don't think we've found a case in which the hash index code outperforms B+-tree indexes, even for "=". The hash index code also has a number of additional issues: for example, it isn't WAL safe, it has relatively poor concurrency, and creating a hash index is significantly slower than creating a b+-tree index.
-Neil
---------------------------(end of broadcast)--------------------------- TIP 8: explain analyze is your friend
