Search results for b-tree

0 votes
0 answers
26
0 votes
1 answer
28
31 votes
5 answers
29
In a B+ Tree , if the search-key value is $8$ bytes long , the block size is $512$ bytes and the pointer size is $2\;\text{B}$ , then the maximum order of the B+ Tree is ...
33 votes
4 answers
31
50 votes
6 answers
34
A B-tree of order $4$ is built from scratch by $10$ successive insertions. What is the maximum number of node splitting operations that may take place?$3$$4$$5$$6$
2 votes
1 answer
35
The smallest number of keys that will force a B-Tree of order 3 to have a height of 3 are _______Consider that the root node is at height 0.
1 votes
1 answer
36
What is the smallest and largest number of entries for 2_3 BTree (B2_3 Tree) of height 8 (i.e 8 levels) ? 255 & 6560127 & 21866561 & 255255 & 2186
0 votes
1 answer
38
By default take ROOT at level 1 or 0?and if asked for B tree then take all the levels but for B+ records only at leaf so only leaf level keys right?