4 votes 4 votes pls explain Databases databases bplustrees indexing + – Nils asked Nov 14, 2017 Nils 609 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Akash Mittal commented Nov 14, 2017 reply Follow Share 4 keys? 0 votes 0 votes Nils commented Nov 14, 2017 reply Follow Share pls explain..your ans. 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes For a b-order B+ tree with h levels: The minimum number of keys is n= 2((internal node)^h-1) -1 for internal node, children of root node are 2 means therefore ans would be 7 gunjan79 answered Nov 14, 2017 gunjan79 comment Share Follow See all 3 Comments See all 3 3 Comments reply shalini455 commented Oct 5, 2020 reply Follow Share for those who are lost https://en.wikipedia.org/wiki/B%2B_tree formula is given in the above link for minimum no. keys and maximum no of keys . 0 votes 0 votes sachin486 commented Oct 7, 2020 reply Follow Share height and level are different things first of all. and i think its B tree formula … cant be implemented in B+ tree 0 votes 0 votes shalini455 commented Oct 8, 2020 reply Follow Share open the link first and yes the formula written here has a mistake . also you can take height as level -1 and that formula is for level . In question we are given 3 levels so the formula can be directly implemented . Correct me if i am wrong . By using that i am getting answer 7 . 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes In the B and B+ tree insertion always took place from the leaf node i am inserting keys in such a way so that spliting occur and i get the chance to increase the level of B+ tree so the answer is 5 Gurdeep Saini answered Nov 28, 2018 Gurdeep Saini comment Share Follow See 1 comment See all 1 1 comment reply sachin486 commented Oct 7, 2020 reply Follow Share yeah. i was thinking the same 0 votes 0 votes Please log in or register to add a comment.
