Register

conceptual doubt

361 views
0 votes
0 votes
In B+ trees, are cousins alo treated as siblings?? I mean the adjacent nodes are considered siblings even if they dont have same parents?? While reading deletion algorithm in B+ tree i got confused and in one video it was taught that adjacent ones are siblings in B+ trees so that we can always merge and dstribute from them Can anyone clear it??
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

1 votes
1 votes
1 answer
1
manisha11 asked Jun 7, 2019
461 views
B TRees DBMS Self doubt
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 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 th...
User Avatar
0 votes
0 votes
0 answers
2
Shubham Aggarwal asked Jan 15, 2019
983 views
self doubt
Identify the B-Tree from the following after inserting R,Y,F,X,A,M,C,D,E,T,H,V,L,G (in the order) with Branching factor of 3. If any insertion of element causes split, first split that node without element insertion and after balanced then insert that element.
Identify the B-Tree from the following after inserting R,Y,F,X,A,M,C,D,E,T,H,V,L,G (in the order) with Branching factor of 3.If any insertion of element causes split, fir...
User Avatar
1 votes
1 votes
0 answers
3
newdreamz a1-z0 asked Jan 2, 2019
503 views
self doubt
For range queries every B+ tree index requires less I/O than a full table scan. can anyone explain?
For range queries every B+ tree index requires less I/O than a full table scan.can anyone explain?
User Avatar
0 votes
0 votes
1 answer
4
Subham Nagar asked Dec 15, 2018
522 views
B+ tree doubt
Consider a B+ -tree in which the maximum no. of keys in a root is 11. What will be minimum no. of keys in a non-root node? What will be the same in a B-Tree Please also refer the source from where clear-cut formulae are given
Consider a B+ -tree in which the maximum no. of keys in a root is 11. What will be minimum no. of keys in a non-root node? What will be the same in a B-TreePlease also re...
User Avatar
Link Copied!