0 votes 0 votes Suppose size of block 1000 bytes search key of 12 bytes, pointer size 8 bytes. How many maximum records in DB file which can index by dense B+ tree of 2 levels? given ans is 2499 but I am getting 2450 Databases made-easy-test-series databases b-tree + – sunaina rawat asked Dec 4, 2017 • edited Mar 7, 2019 by Aditi Singh sunaina rawat 415 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Anu007 commented Dec 4, 2017 i edited by Anu007 Dec 4, 2017 reply Follow Share order will come = p = 50 now at root maximum keys = 49 second level = 50 *49 = 2450 0 votes 0 votes sunaina rawat commented Dec 4, 2017 reply Follow Share But in B+ tree record would be present at the last level only hence 2450....please correct me 0 votes 0 votes joshi_nitish commented Dec 4, 2017 reply Follow Share 2450 is correct because in B+, every key is irredundantly present in leaf nodes. 1 votes 1 votes Anu007 commented Dec 4, 2017 reply Follow Share yes that would be correct 0 votes 0 votes Please log in or register to add a comment.
