The B-tree would store the key value, followed by a list of pointers to each of the physical rows.

B-树将存储键值，以及一个指向每个物理行的指针列表。

youdao

The B-tree would store the key value, followed by a list of pointers to each of the physical rows.

B-树将存储键值，以及一个指向每个物理行的指针列表。

youdao