0 votes 0 votes Let the search key field of a B+ tree is 4 Bytes , the disk block size is 199 Bytes , and the index pointer is 3 Bytes, then the order of B+ tree is _______ Databases tbb-dbms-1 numerical-answers + – Bikram asked Nov 26, 2016 Bikram 442 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes n*3 + (n-1)4 <=199 , n<=29 , so order is 29 Bikram answered Nov 26, 2016 • selected Jan 13, 2017 by Bikram Bikram comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Vaishali Trivedi commented Jan 13, 2017 reply Follow Share sorry sir , it was typo i am saying it must be less than 29 every node need to sum additional information am i not correct? 0 votes 0 votes Bikram commented Jan 14, 2017 reply Follow Share it is a B + tree so read B+ tree property once. and see my given answer. 0 votes 0 votes Jason_Roy commented Feb 8, 2017 reply Follow Share index pointer is tree pointer or node pointer. right? 1 votes 1 votes Please log in or register to add a comment.
