Consider the following B+-tree, where a node can contain two search key values and three pointers. Suppose that this tree indexes a le where each page can contain 10 records.
(a) Assuming that the index is unclustered, what is the maximal size (measured in data records) of a file that can be indexed by the depicted B+-tree?
(b) Same question, but assume that the index is now clustered.
(c) Show the B+-tree after inserting a new record with search key value 70.
(d) Show the tree after deletion (from the original tree) of the record with search key 7.
(You must redraw the tree when giving the answer? leave the original tree intact.)
(a) Unclustered index: Each leaf entry can index only a single data record, so the max file size is 8 data records.
(b) Clustered index: the tree can index 8 pages, which can contain up to 80 data records.
(c) Insertion of 70:
(c) Deletion of 7:
You might also like to view...
The MEDIAN function finds ________
A) the one number that corresponds to an argument in the function B) the middle value in a range of cells C) all numbers that correspond to an argument in the function D) the average value in a range of cells
One drawback to the use of dead drops is that communications are not anonymous
Indicate whether the statement is true or false.