# Question

For each B+-tree as shown below show the form of the tree after each of the following series of operations:

a. Insert 9.

b. Insert 10.

c. Insert 8.

d. Delete 23.

e. Delete 19.

Construct a B+-tree for the following set of key values: (2, 3, 5, 7, 11, 17, 19, 23, 29, 31) Assume that the tree is initially empty and values are added in ascending order. Construct B+-trees for the cases where the number of pointers that will fit in one node is as follows:

a. Four

b. Six

c. Eight

a. Insert 9.

b. Insert 10.

c. Insert 8.

d. Delete 23.

e. Delete 19.

Construct a B+-tree for the following set of key values: (2, 3, 5, 7, 11, 17, 19, 23, 29, 31) Assume that the tree is initially empty and values are added in ascending order. Construct B+-trees for the cases where the number of pointers that will fit in one node is as follows:

a. Four

b. Six

c. Eight

## Answer to relevant Questions

Consider the modified redistribution scheme for B+-trees described in page 463. What is the expected height of the tree as a function of n?Show how the extendable hash structure of Exercise changes as the result of each of the following steps:a. Delete 11.b. Delete 31.c. Insert 1.d. Insert 15.Suppose that we are using extendable hashing on a file that contains ...How does data encryption affect index schemes? In particular, how might it affect schemes that attempt to store data in sorted order?Estimate the number of block accesses required by your solution to Exercise for r1 Θ r2, where r1 and r2 are as defined in Exercise.Suppose that a B+-tree index on branch-city is available on relation branch, and that no other index is available. What would be the best way to handle the following selections that involve negation? a. σ ¬ ...Post your question

0