Which statement is true about the difference between HASH and BTREE INDEXES?
A.
HASH indexes support rightmost prefixing of keys, which makes them faster than BTREE
indexes in many causes.
B.
HASH indexes can be used by the optimizer to speed up ORDER BY operations and not
BTREE indexes.
C.
HASH indexes are used only for equality comparisons (= or<=>),whereas BTREE indexes
can also be used for range searches (>or<).
D.
HASH indexes are much faster than BTREE indexes but can only be used for a single
column.
Explanation:
Reference:
https://devcenter.heroku.com/articles/postgresql-indexes
C.
https://dev.mysql.com/doc/refman/5.5/en/index-btree-hash.html
C
C
C