Bitmaps can be used as a compressed storage mechanism at the leaf nodes of ________ for those values that occur very frequently.
(a) B-trees
(b) B+-trees
(c) Bit trees
(d) Both B-trees and B+-trees
I have been asked this question in a job interview.
My question is taken from Bitmap Indices in division Indexing and Hashing of Database Management