Which of the following statements accurately describes the difference between HASH and BTREE
indexes used for MEMORY tables?
A.
HASH indexes support rightmost prefixing of keys which makes them faster than BTREE in
many cases.
B.
HASH indexes can be used by the optimizer to speed up ORDER BY operations by minimizing
use of the sort_buffer; BTREE indexes can not be used this way.
C.
HASH indexes are only used for equality comparisons (= or <=>), whereas BTREE indexes can
be used for range searches (> or <) as well.
D.
HASH indexes are much faster than BTREE but can only be used for a single column.