451 views

2 Answers

2 votes
2 votes

For indexing used internal node structure.Because leaf node pointing to original data only.

P-1(key size)+ P(Block pointer)<=512

P-1(8) + P(8)<=512

8P -8 + 8P <= 512

16P <= 512+8

p <= 520/16

p <=32.5

P = 33 take ceeling 

1 votes
1 votes
Let n be degree

8n+8(n-1)<=512

16n<=520

n<=32.5

n=32

Related questions

3 votes
3 votes
1 answer
1
Desert_Warrior asked May 24, 2016
1,641 views
The maximum length of an attribute of type text is127255256It is variable
1 votes
1 votes
1 answer
2
Desert_Warrior asked May 24, 2016
432 views
3 votes
3 votes
2 answers
3
2 votes
2 votes
0 answers
4
ManojK asked Nov 20, 2015
200 views
how many b tree are possible with 6 record if there are 3 key.???how to solve?