1. Primary key optimization
In the data structure of this b+ tree, all the data will appear in the leaf nodes, and the sub-leaf nodes only serve as an index data. The index of the sub-leaf nodes and the data of the leaf nodes are finally stored in a structure, among the pages (pages), all the yellow blocks in the figure below are pages (pages), and the size of each page is fixed. The page is the smallest unit of innoDB disk management
.
1.1 Page Splitting
The way the primary key is inserted in order
Page splitting may occur when the primary key is out of order. Linked list pointers between pages are reset