690 views

1 Answer

0 0 votes
While deleting a key, we have to take care of the keys present in the internal nodes (i.e. indexes) as well because the values are redundant in a B+ tree.
Position:
Show:

Related questions

1 1 vote
1 1 answer
207
207 views
ProGress asked Jul 13, 2025
207 views
0 0 votes
1 1 answer
1.3k
1.3k views
Nam14 asked Apr 5, 2023
1,257 views
Please read below passage from 10th edition Operating System Concepts, pg. 202:5.1.3 Preemptive and Nonpreemptive SchedulingCPU-scheduling decisions may take place under ...
0 0 votes
0 0 answers
2.0k
2.0k views
sid2601678 asked Oct 4, 2018
2,022 views
Consider the sql querySelect p.a1 From p,r1,r2 Where p.a1 = r1.a1 or p.a1 = r2.a1Under what conditions does the preceding query select values of p.a1 that are either in r...
1 1 vote
0 0 answers
204
204 views
Dknights asked Dec 2, 2024
204 views
Can someone please explain what will be the minimum and maximum comparisons for a key in Btree and B+Treeof order 4 for both.