I have learned that there are three alternative ways for the data entry handling
- storing full data record itself with key k
- <key,rid>
- <key,list>
But my question is why can't we apply method 3 to B+ tree? I thought it was because the multiple mapping from the leaf node could occur but later on, since the B+ tree is compared with the key k (either left or right) having multiple rids mapped with a key shouldn't be a problem. But I am not sure why all of the examples for B+ tree show only method 2 which is one key and one rid mapping