leaf page of bplus tree 更多...
#include <bplus_tree.h>
类 LeafIndexNode 继承关系图:
Public 属性 | |
| PageNum | next_brother |
| char | array [0] |
 Public 属性 继承自 IndexNode | |
| bool | is_leaf |
| int | key_num |
| 当前是叶子节点还是内部节点 | |
| PageNum | parent |
| 当前页面上一共有多少个键值对 | |
静态 Public 属性 | |
| static constexpr int | HEADER_SIZE = IndexNode::HEADER_SIZE + 4 |
| 静态 Public 属性 继承自 IndexNode | |
| static constexpr int | HEADER_SIZE = 12 |
详细描述
leaf page of bplus tree
storage format:
| common header | prev page id | next page id |
| key0, rid0 | key1, rid1 | ... | keyn, ridn |
the key is in format: the key value of record and rid. so the key in leaf page must be unique. the value is rid. can you implenment a cluster index ?
类成员变量说明
◆ array
| char LeafIndexNode::array[0] |
leaf can store order keys and rids at most
该结构体的文档由以下文件生成:
- src/observer/storage/index/bplus_tree.h
