HI Gurus,
i was trying to understand B-tree index architecture. i Happened to see one video tutorial in which they have taken an example of inserting random values. Please find the link below.
CREATION OF B-TREE.mp4 - YouTube
referring to above tutorial, Could you guys please help me to understand how it will work for sequence numbers. For example lets say if i have to insert 1 to 10
step1--- 1,2,3,4
step2-- inserting 5--> [1,2] and [3,4,5] parent node [2,5]
step3-- inserting 6--[1,2] and [3,4,5,6] and parent node [2,6]
step4-- inserting 7 node split again ,[1,2] [3,4] [5,6,,7] and parent node [1,4,7] and so on..
if we note, in all the nodes we will be using only 2 elements out of 4 (considering node order is 4). can anybody help me to understand this scenario.
Thanks in advance
Renji