Question

Bitmaps can be combined with regular B+-tree indices for relations where a few attribute values are extremely common, and other values also occur, but much less frequently.

(a) Bitmap, B-tree

(b) Bitmap, B+tree

(c) B-tree, Bitmap

(d) B+tree, Bitmap

The question was posed to me during a job interview.

Question is taken from Bitmap Indices in section Indexing and Hashing of Database Management

Answer 1

Correct option is (b) Bitmap, B+tree

To explain: Bitmaps are combined and stored in a B+ tree.