# DBMS Korth Edition 4 Exercise 12 Question 5 (Page No. 490)

1 vote
209 views
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

## Related questions

1 vote
1
331 views
Is it possible in general to have two primary indices on the same relation for different search keys ? Explain your answer.