1 votes 1 votes with respect to the B+ TREE index method .select the true statements? 1 records are physically stored in primary key order 2 B+ tree use a hashing algo. 3 the index tree may become unbalanced as a result of updates 4 none of the above focus _GATE asked Jun 29, 2015 focus _GATE 1.2k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
3 votes 3 votes A is false..Clustering index on non key . B is false (obviously B+ tree need not follow hashing function).. C. true. Take a B+ tree with 3 keys {1,2,3} and 2 is root.. now update root value to 10.. tree will be unbalanced.. Digvijay Pandey answered Jun 29, 2015 Digvijay Pandey comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments focus _GATE commented Jul 7, 2015 reply Follow Share tell??. wtever you know about (a) option.. 0 votes 0 votes focus _GATE commented Jul 9, 2015 reply Follow Share sir, FOR multilevel indexing we use B or B+tree becoz these tree are height balanced tree ...sir than after some updates tree will get unbalanced but after that it will try to make it balanced na.??than how c option true...???????? 0 votes 0 votes vinay chauhan commented Feb 2, 2019 reply Follow Share But it will not remain unbalanced, it will rebalance itself. So answer should be $d$. 0 votes 0 votes Please log in or register to add a comment.