Register

B+ tree

441 views
1 votes
1 votes

Database file consist 50000 records with record size 100 bytes, block size 512 bytes. If sparse B+ tree index build over given database file with search key size 20 bytes both block pointer and record pointer sizes 12 bytes each. How many maximum index blocks required if node order P is defined as between ⎡P/2⎤ to P pointers per node?

User Avatar

Please log in or register to answer this question.

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

Related questions

0 votes
0 votes
1 answer
1
gauravkumawat asked Jun 13, 2023
941 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
2
Sahil_Lather asked Jan 29, 2023
515 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
0 votes
0 votes
1 answer
3
Crackcer asked Jan 10, 2022
253 views
Order of B and B+ tree(ACE academy test series)
1. Suppose there is a B-tree, such that internal node with order 86 and leaf node with order 103. 2. A B+ tree with internal order is 171 and leaf node with order 103. In both scenarios what is the order of the tree?
1. Suppose there is a B-tree, such that internal node with order 86 and leaf node with order 103.2. A B+ tree with internal order is 171 and leaf node with order 103.In b...
User Avatar
2 votes
2 votes
2 answers
4
HeartBleed asked Feb 4, 2019
3,223 views
Gate 2019: B+ Tree
Which of the following is not correct about B + Tree, which is used for creating index of relational database table? (a) Key values in each node kept in sorted order (b) Leaf node pointer points to next node (c) B + tree is height balanced tree (d) Non-leaf node have pointers to data records
Which of the following is not correct about B + Tree, which is used for creating indexof relational database table?(a) Key values in each node kept in sorted order(b) Lea...
User Avatar
Link Copied!