Performing the split

• Once split point is found for a node, every attribute list for that node is divided into two parts
• Rowid for each node is inserted into a probe structure(hash table), noting to which child record was moved
• If hash table is large, the attribute list for the splitting attribute is partitioned upto attribute record for which hash table fits in memory