You should always insert at the end of a set of duplicates in a B-tree.
Confusion in construction of B+ tree?
Frage
while inserting a new key value in b+ tree ,if we find that given key is exactly same to key to which it is compared ,then which way we move to insert it ,right or left? In different words ,while traversing a b+ tree ,if BP is block pointer
BP-->x //Block pointer points to x
K1|BP|K2 //what will be properties of x's value ,k1<x<=k2 or k1<=x<k2
Lösung
Lizenziert unter: CC-BY-SA mit Zuschreibung
Nicht verbunden mit StackOverflow