page split term
B-tree node fills up, splits into two
Costly: rewrites two pages, updates parent. Random inserts cause many splits; sequential inserts (auto-incrementing PK) avoid them. Behind 'why uuid PKs are slower than serial.'
B-tree node fills up, splits into two
Costly: rewrites two pages, updates parent. Random inserts cause many splits; sequential inserts (auto-incrementing PK) avoid them. Behind 'why uuid PKs are slower than serial.'