1 votes 1 votes Identify the true statement from the given statements: Number of child pointers in a B/B+ tree node is always equal to number of keys in it plus one B/B+ tree is defined by a term minimum degree. And minimum degree depends on hard disk block size, key and address size (1) (1) and (2) (2) None of these Databases nielit-2018 databases btrees + – Arjun asked Dec 7, 2018 • recategorized Oct 24, 2020 by Krithiga2101 Arjun 2.0k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes An internal node x containing 'n' keys has 'n+1' children. Minimum degree depends on BLOCK SIZE, SEARCH KEY FIELD SIZE, BLOCK/RECORD POINTER. REFER:- http://staff.ustc.edu.cn/~csli/graduate/algorithms/book6/chap19.htm Asim Siddiqui 4 answered Feb 16, 2019 Asim Siddiqui 4 comment Share Follow See all 2 Comments See all 2 2 Comments reply s_dr_13 commented Mar 30, 2022 reply Follow Share How minimum degree ?? Shouldn’t it be maximum degree ?? There r lot of GATE questions which has asked maximum degree possible for given block size 0 votes 0 votes Arjun commented Mar 30, 2022 reply Follow Share Minimum or maximum, how is block size related to the degree? 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes The above two statements are true. Answer- B. (1) and (2) topper98 answered Mar 18, 2020 topper98 comment Share Follow See all 0 reply Please log in or register to add a comment.