Database Reference
In-Depth Information
Figure A1-27.
llustrating Addition of Items to the B-tree
(
continued
)
The summarized item deletion algorithm is shown in Figure
A1-28
. Note that as in
the case of insertion, deletion may lead to significant adjustment of the tree.
Figure A1-28.
B-tree Item Deletion Algorithm
Example 12:
Referring to the B-tree of Figure
A1-23
, consider deleting the following
items:
a.
65 is in node
p
, remove it: p
b.
7 is in node
j
, remove it: j
c.
16 is in node
d
, remove it. Move up 15 from node
j
and place
a dummy (null) value at node
j
.
