CS4482/6492
Advanced Database Systems
Assignment 1
1.
a)
The final tree:
b)
The final tree:
c)
The final tree:
Possible observations:
o
New search-key values are always inserted in the same leftmost leaf node.
When this
leaf node gets filled, it is split into two.
The right node is untouched and the
insertions always take place on the left node.
o
Except the leftmost leaf node, the occupancy of all the other leaf nodes is half.
o
The height of the B
+
-tree is greater than the one constructed in part a).
o
The occupancy of nodes is smaller than the one constructed in part a).
9
9
10
8
6
7
2
4
6
8
12
12
13
13
9
10
2
4
12
8
12
10
10
9
8
7
8
12
12
13
13
6
2
4
6
7
9
This
preview
has intentionally blurred sections.
Sign up to view the full version.
