Hi mam...there is no programming solution for the explanation kindly if possible give a hint on the programming side also. And your grip on the subject is fantastic.
why you keep the split point in the lower node (leaf) after moving it to the internal nodes?! is that a mistake?! Like 9 and 23 after inserting 8 and 25 at 8:30?
(11, 7, 10, 17, 11, 2, 3, 19, 11, 5, 6). b+tree (A) The maximum number of times leaf nodes would get split up as a result of these insertions (b) The height of the index (c) Assume that the root of the B+ tree index, created above, resides in the memory buffer (main memory), and each node of the B+ tree resides on a separate block in the disk. Total number of pointers in the B+ tree index = (d) If the tuples of the given relation are stored physically in the same order given above with each block containing two tuples the number of block accesses required to access all the tuples having key value 11 = (d) If the tuples of the given relation are stored physically in the same order given above with each block containing two tuples the number of block accesses required to access all the tuples having key value 11 = (f) The number of buckets required to create a hash organization (dynamic) of the relation using the binary representation of the keys = if u possible pls explain me madam
Thank you very much for this video :-) I have a question: What would be the best order to insert values into a B+ tree to get the minimal height? (Let's say we have the values: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10)
It's not bad asking to teach in hindi bcz it may be his mother tongue and may be quite easy to understand, but bro, there are other channels which teach in hindi which are also quite good , u can refer them , like, apna college, code with harry, love babbar,...😊
