The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+2 votes
701 views

(a) Suppose you are given an empty B+- tree where each node (leaf and internal) can store up to 5 key values. Suppose values 1, 2,.....10 are inserted, in order, into the tree. Show the tree pictorially

  1.  after 6 insertions, and
  2.  after all 10 insertions

Do NOT show intermediate stages.

(b) Suppose instead of splitting a node when it is full, we try to move a value to the left sibling. If there is no left sibling, or the left sibling is full, we split the node. Show the tree after values 1, 2,......, 9  have been inserted. Assume, as in (a) that each node can hold up to 5 keys.

(c) In general, suppose a B+- tree node can hold a maximum of $m$ keys,and you insert a long  sequence of keys in increasing order. Then what approximately is the average number of keys in each leaf level node.

  1. in the normal case, and
  2. with the insertion as in (b).
asked in Databases by Veteran (59.8k points)
edited by | 701 views

1 Answer

0 votes

I AM DOING INSERTION WITH LEFT BIASING

answered by Boss (33.4k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,126 questions
53,251 answers
184,758 comments
70,502 users