Bitmap Indexes are highly efficient for low-cardinality columns (e.g., Gender, State). Why are they avoided in OLTP (Transactional) systems?

1. A They consume significantly more read-bandwidth than B-Trees because the data must be decompressed from several disparate sectors before every query.
2. B The highly compressed nature of bitmaps means that updating a single record requires locking an entire segment, severely bottlenecking write concurrency.
3. C They are fundamentally limited by the underlying hardware architecture to only handle 32-bit integer identifiers, making them unsuitable for modern Big Data.
4. D They provide exceptional performance for 'AND' logic but are mathematically incapable of resolving 'OR' or 'NOT' query predicates in a single pass.