What can you achieve by implementing reverse key index?

A.
Store a bitmap for each key value instead of a list of row IDs in the leaf node

B.
Prevent contention on the highest leaf block when using sequences to generate keys

C.
Reverse the bytes of each column indexed including the row ID

D.
Remove repeated key values from the index to fit more index entries in a given amount
of disk space