internal page of bplus tree 更多...
#include <bplus_tree.h>
类 InternalIndexNode 继承关系图:
Public 属性 | |
| char | array [0] |
 Public 属性 继承自 IndexNode | |
| bool | is_leaf |
| int | key_num |
| PageNum | parent |
静态 Public 属性 | |
| static constexpr int | HEADER_SIZE = IndexNode::HEADER_SIZE |
| 静态 Public 属性 继承自 IndexNode | |
| static constexpr int | HEADER_SIZE = 12 |
详细描述
internal page of bplus tree
storage format:
| common header |
| key(0),page_id(0) | key(1), page_id(1) | ... | key(n), page_id(n) |
the first key is ignored(key0). so it will waste space, can you fix this?
类成员变量说明
◆ array
| char InternalIndexNode::array[0] |
internal node just store order -1 keys and order rids, the last rid is last rght child.
该结构体的文档由以下文件生成:
- src/observer/storage/index/bplus_tree.h
