Register

b+tree

590 views
3 votes
3 votes

User Avatar

2 Answers

1 votes
1 votes

order p: maximum no. of record per node

so ,(P+1) Bp + P*K<=BLOCK SIZE (here order of leaf node and internal node is same)

     (P+1)*8+P*12<=1000 

        P=49

  MAX NODE MAX BP MAX RECORDS
ROOT(LEVEL 1)          1    50      49
LEVEL 2       50 50*50

    50*49

         all the records will be at leaf level so maximum records =50*49

                                                                                               =2450

  correct me if i done wrong 

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

Related questions

0 votes
0 votes
0 answers
1
SandeepKumar147 asked 5 days ago
42 views
B- tree in DBMS
User Avatar
0 votes
0 votes
0 answers
2
SandeepKumar147 asked 5 days ago
18 views
B tree dbms
User Avatar
0 votes
0 votes
1 answer
3
gauravkumawat asked Jun 13, 2023
956 views
Explain the properties of B-Tree Also Construct B+ tree with order P=4 10,5,30,40,20,17,90,45,93,60,20,50,29
please solve in paper formet Explain the properties of B-Tree Also Construct B+ tree with order P=410,5,30,40,20,17,90,45,93,60,20,50,29
User Avatar
0 votes
0 votes
0 answers
4
Sahil_Lather asked Jan 29, 2023
523 views
TestBook TestSeries question to find max child possible in B+ Tree
In a B+ Tree index having order 6, which is the maximum number of child pointers it can have. Keys are numbered from 1 to 83. What can be the maximum number of nodes which can be used to store all the keys? A. 17 B. 19 C. 59 D. 57
In a B+ Tree index having order 6, which is the maximum number of child pointers it can have. Keys are numbered from 1 to 83. What can be the maximum number of nodes whic...
User Avatar
Link Copied!