Reverse key indexes are specifically designed for columns populated by sequences. When sequences generate ascending values (1, 2, 3...), normal B-tree indexes cause contention on the rightmost leaf block. Reverse key indexes reverse the bytes of each value, distributing inserts across different leaf blocks and eliminating this hotspot. They're not ideal for range scans (option C) or for high-cardinality columns without sequential insert patterns.