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

[bary]

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 |
|______| |____________| |______| |______| |______| |______|

[bary]

___
¦35 ¦
¦___¦
/ \
/ \
/ \
/ \
____________/ \ ______
¦ 10, 20 ¦ ¦42,50 ¦
¦___________¦ ¦______¦
/ ¦ \ / ¦ \
_______/ ____ ¦________ \_______ _______/ ___ ¦___ \______
¦5,6,7 ¦ ¦10,11,12,14 ¦ ¦20,22 ¦ |35,36 ¦ ¦42,43 ¦ ¦50,52 ¦
¦______¦ ¦____________ ¦ ¦______¦ ¦______¦ ¦______¦ ¦______¦

[mmmcd]

                                ___  
                               ¦35 ¦  
                               ¦___¦  
                             /       \   
                           /           \  
                         /                \  
                       /                    \   
          ____________/                      \ ______  
          ¦ 10,   20  ¦                       ¦42,50 ¦  
          ¦___________¦                       ¦______¦  
        /      ¦         \                   /     ¦     \  
_______/  ____ ¦________  \_______   _______/  ___ ¦___   \______  
¦5,6,7 ¦  ¦10,11,12,14  ¦  ¦20,22 ¦  ¦35,36 ¦  ¦42,43 ¦   ¦50,52 ¦  
¦______¦  ¦____________ ¦  ¦______¦  ¦______¦  ¦______¦   ¦______¦ 

[knowledge_Is_Life]

好像没那么简单,呵呵.

[baobao2010]

mark

[浴火_凤凰]

继续学习中。