In a B+-tree index ______ for each value, we would normally maintain a list of all records with that value for the indexed attribute.
(a) Leaf
(b) Node
(c) Root
(d) Link
I got this question during an online exam.
The doubt is from Bitmap Indices in portion Indexing and Hashing of Database Management