UMBC
Spring 2002
CMSC461
Database Management Systems
Homework5
Due May 14 beginning of class (No late homeworks accepted);
all homework must be done independently.
Chapter 7 and 12
-
7.2
-
7.3
-
7.4
-
7.11
-
7.12
-
7.13
-
7.21
-
Constuct a B+ tree for the following set of key values:
(4, 6, 8, 13, 18, 22, 24, 25, 31, 43). Assume that the tree is initially
empty and the values are added in ascending order. Assume that the number
of pointers in each node is 4.
-
Show the form of the tree after each of the following
operations:
-
Insert 7.
-
Insert 36.
-
Delete 18.
-
Delete 25.