All leaf blocks are at the same depth from the root branch block. Leaf
blocks store the following:
■ The complete key value for every row
■ ROWIDs of the table rows
All key and ROWID pairs are linked to their left and right siblings. They are sorted by
(key, ROWID).
叶子节点
1. 所有的叶子节点相对于其根分支块具有相同的深度
2. 叶子节点存储以下信息 :每行完成的键值 和 数据行的ROWID
所有的 键值-ROWID 对都与其左右的兄弟节点链接,并按照(key,ROWID)的顺序排序
来自 “ ITPUB博客 ” ,链接:http://blog.itpub.net/10599713/viewspace-982571/,如需转载,请注明出处,否则将追究法律责任。
转载于:http://blog.itpub.net/10599713/viewspace-982571/