Register

GATE CSE 2002 | Question: 2.23, UGCNET-June2012-II: 26

• edited by
14,201 views
42 votes
42 votes

A $B^+$ - tree index is to be built on the Name attribute of the relation STUDENT. Assume that all the student names are of length $8$ bytes, disk blocks are of size $512$ bytes, and index pointers are of size $4$ bytes. Given the scenario, what would be the best choice of the degree (i.e. number of pointers per node) of the $B^+$ - tree?

  1. $16$
  2. $42$
  3. $43$
  4. $44$
• edited by
User Avatar

6 Answers

1 votes
1 votes 
Size of 1 record = 8 + 4 = 12

Let the order be N.

No. of index values per block = N - 1

(N - 1) 12 + 4 = 512

12N - 12 + 4 = 512

16N = 1009

N = 43.3333

 

Based on Geeksofgeeks solution.

User Avatar
0 votes
0 votes

Internal node order

m * P + ((m-1) *V) ≤B

m=?

P=4

V=8

B=512

m*4+(m-1)*8 ≤ 512

12m≤ 520

m≤ 43.33

=43

User Avatar
Page:
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

45 votes
45 votes
4 answers
1
Kathleen asked Sep 14, 2014
15,566 views
GATE CSE 2000 | Question: 1.22, UGCNET-June2012-II: 11
B$^{+}$-trees are preferred to binary trees in databases because Disk capacities are greater than memory capacities Disk access is much slower than memory access Disk data transfer rates are much less than memory data transfer rates Disks are more reliable than memory
B$^{+}$-trees are preferred to binary trees in databases becauseDisk capacities are greater than memory capacitiesDisk access is much slower than memory accessDisk data t...
User Avatar
33 votes
33 votes
2 answers
2
Kathleen asked Sep 15, 2014
5,702 views
GATE CSE 2002 | Question: 17
The following table refers to search items for a key in $B$-trees and $B^+$ ... $(2,11)$ and $(11,6)$ are now inserted into $R.$ What are the additional tuples that are inserted in $V$?
The following table refers to search items for a key in $B$-trees and $B^+$ trees.$$\begin{array}{|ll|ll|} \hline & \textbf {B-tree} & & \textbf {B}^+\text{-tree} \\\hl...
User Avatar
Link Copied!