Register

B- tree in DBMS

• edited by
78 views

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
0 answers
2
Sahil_Lather asked Jan 29, 2023
533 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
Rishabh Gupta 2 asked Dec 9, 2017
1,087 views
Doubt in gate 2009 B+-tree question
https://gateoverflow.in/1330/gate2009-44 Can anybody provide me the diagrams of the insertion operations. In both the cases, left biasing and right biasing. Do we split every time a node is full? Even when its siblings have space? Thank You.
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...
User Avatar
6 votes
6 votes
1 answer
4
firki lama asked Jan 14, 2017
5,971 views
order of leaf node in b+ tree??
which formula should we use for calculating LEAF node in B+ tree? I. n*(K+r)+b<=block size where n=no of keys k=key size,r=record pointer,b=block pointer II. (n-1)(K+r)+b<=block size
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...
User Avatar
Link Copied!