menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

B TRees DBMS Self doubt

1 vote
163 views
In case of B Trees we split a node on insertion in case of overflow,

is there any possible case in which this may lead to underflow also? as a key is promoted to parent the children formed may have subtrees, which may be broken such that we get underflow somewhere?

just a thought
in Databases 163 views

1 Answer

0 votes

i think it is not possible ……

under possible when we perform deletion and over flow perform when we perform insertion …………

@Shaik Masthan  Sir please give your opinion

← Prev. Next →
← Prev. Qn. in Sub. Next Qn. in Sub. →

Related questions

1 vote
1 answer
1
271 views
Ace Test Series: DBMS - B+ Trees And Indexing
Please Solve this question. I didn't understood the question properly so please Make Me as well :) What is meant by Leaf Page ?
Please Solve this question. I didn't understood the question properly so please Make Me as well :) What is meant by Leaf Page ?
asked Jun 29, 2018 in Databases Na462 271 views
1 vote
0 answers
2
150 views
B and B + trees qn. doubt
Que1 Que 2 B and B+ trees always confused me in mock tests... here i m posting 2 of the ques from that topic... can someone just demonstrat the resultant tree after execution in both of the above que... please help..
Que1 Que 2 B and B+ trees always confused me in mock tests... here i m posting 2 of the ques from that topic... can someone just demonstrat the resultant tree after execution in both of the above que... please help..
asked Feb 7, 2017 in Databases S Ram 150 views
3 votes
0 answers
3
90 views
B+ Trees
Can anybody explain what is meant by "Minimum Space Utilization"?
Can anybody explain what is meant by "Minimum Space Utilization"?
asked Jan 16, 2018 in Databases vishal chugh 90 views
0 votes
1 answer
4
637 views
B+ Trees
Going with the definition, that order of a B+ tree is the maximum number of children a node can have. What is exactly meant by the order of a leaf node? As per my understanding order of a leaf node is the number of <key,pr> pairs it can hold. But in ... the upper limit on keys should be 5 and not 4. Could someone explain why its taken to be n-1 in every B+ tree insertion tutorial.
Going with the definition, that order of a B+ tree is the maximum number of children a node can have. What is exactly meant by the order of a leaf node? As per my understanding order of a leaf node is the number of <key,pr> pairs it can hold. But in general when ... the upper limit on keys should be 5 and not 4. Could someone explain why its taken to be n-1 in every B+ tree insertion tutorial.
asked Dec 19, 2017 in Databases Shiwam1994 637 views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...