edited by
137 views
0 votes
0 votes

edited by

Please log in or register to answer this question.

Related questions

2.0k
views
1 answers
1 votes
focus _GATE asked Dec 26, 2016
2,044 views
Suppose the search key of a B tree is V=8 byte long, the disk block size is B=512 bytes, a record(data) pointer is P=6 bytes and a block pointer is l=5 bytes. Calculate t...
566
views
0 answers
0 votes
Sahil_Lather asked Jan 29, 2023
566 views
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...
1.1k
views
1 answers
0 votes
Rishabh Gupta 2 asked Dec 9, 2017
1,116 views
https://gateoverflow.in/1330/gate2009-44Can anybody provide me the diagrams of the insertion operations. In both the cases, left biasing and right biasing.Do we split eve...
6.0k
views
1 answers
6 votes
firki lama asked Jan 14, 2017
6,007 views
which formula should we use for calculating LEAF node in B+ tree?I. n*(K+r)+b<=block sizewhere n=no of keysk=key size,r=record pointer,b=block pointerII. (n-1)(K+r)+b<=bl...