B-tree index structure

 

 

 

 

- Root Block (가장 상위 노드): 가장 상위에 있는 노드.
- Branch Block (ROOT와 LEAF의 연결고리): 루트 블록과 리프 블록을 연결하는 노드.
- Leaf Block (KEY + ROWID): 키와 ROWID 쌍을 포함하는 노드.
- Tables (TABLE): 리프 블록이 참조하는 실제 데이터가 저장된 테이블.

B-tree 인덱스는 계층적으로 구조화되어 있으며, 가장 상위에는 루트 블록이 있고, 그 아래로 브랜치 블록이 있으며, 마지막으로 리프 블록이 실제 데이터가 저장된 테이블을 직접 참조한다.

The image shows a B-tree index structure used in databases. Here is an English description based on the elements in the diagram:

- Root Block: The topmost node.
- Branch Block: Nodes connecting the root and leaf blocks.
- Leaf Block: Nodes containing key and ROWID pairs.
- Tables: The actual data stored in tables, which are pointed to by the leaf blocks.

 B-tree index is structured hierarchically with the root block at the top, followed by branch blocks, and finally leaf blocks, which directly reference the data in the tables.