• 全部
  • 问答

加州大学的B+树试题,大家看看谁能做出来

bary 2008-04-23 05:23:18
1. A disk block of size 1024 bytes is used to store a B+ tree node.
Block header size=10 bytes. The key length is 9 bytes.
Each pointer is 4 bytes.
What is the maximum order of the B+ tree.

2. Compute the lower and upper bounds of the height of a
B+ tree index of order-n on a file with m records.

3. For the following order-5 B+ tree show the number of block
access and the tree after each operation.
Insert key 13 and then delete key 43.

(Note: assume that each node is 1 block, and do not count data block
accesses. Include empty block access and return.)


___
|35 |
|___|
/ \
/ \
/ \
/ \
____________/ \ ______
| 10, 20 | |42,50 |
|____________| |______|
/ | \ / | \
_______/ ____|________ \_______ _______/ ___|___ \______
|5,6,7 | |10,11,12,14 | |20,22 | |35,36 | |42,43 | |50,52 |
|______| |____________| |______| |______| |______| |______|
...全文
95 点赞 收藏 5
写回复
5 条回复
切换为时间正序
当前发帖距今超过3年,不再开放新的回复
发表回复
浴火_凤凰 2008-04-30
继续学习中。
回复
baobao2010 2008-04-30
mark
回复
好像没那么简单,呵呵.
回复
mmmcd 2008-04-26

___
¦35 ¦
¦___¦
/ \
/ \
/ \
/ \
____________/ \ ______
¦ 10, 20 ¦ ¦42,50 ¦
¦___________¦ ¦______¦
/ ¦ \ / ¦ \
_______/ ____ ¦________ \_______ _______/ ___ ¦___ \______
¦5,6,7 ¦ ¦10,11,12,14 ¦ ¦20,22 ¦ ¦35,36 ¦ ¦42,43 ¦ ¦50,52 ¦
¦______¦ ¦____________ ¦ ¦______¦ ¦______¦ ¦______¦ ¦______¦
回复
bary 2008-04-23
___
¦35 ¦
¦___¦
/ \
/ \
/ \
/ \
____________/ \ ______
¦ 10, 20 ¦ ¦42,50 ¦
¦___________¦ ¦______¦
/ ¦ \ / ¦ \
_______/ ____ ¦________ \_______ _______/ ___ ¦___ \______
¦5,6,7 ¦ ¦10,11,12,14 ¦ ¦20,22 ¦ |35,36 ¦ ¦42,43 ¦ ¦50,52 ¦
¦______¦ ¦____________ ¦ ¦______¦ ¦______¦ ¦______¦ ¦______¦
回复
相关推荐
发帖
数据结构与算法
创建于2007-08-27

3.2w+

社区成员

数据结构与算法相关内容讨论专区
申请成为版主
帖子事件
创建了帖子
2008-04-23 05:23
社区公告
暂无公告