1 votes 1 votes Databases databases indexing ace-test-series + – Na462 asked Jan 19, 2019 • edited Mar 3, 2019 by I_am_winner Na462 988 views answer comment Share Follow See all 9 Comments See all 9 9 Comments reply Show 6 previous comments Ram Swaroop commented Dec 18, 2019 reply Follow Share I am getting 3? 0 votes 0 votes Pat_007 commented Aug 25, 2020 i edited by Pat_007 Aug 25, 2020 reply Follow Share I’m getting it 3, please explain how it’s 4. 0 votes 0 votes Rajat Agrawal007 commented Sep 16, 2021 reply Follow Share Question is clearly asking about the levels in multi level indexing i.e., B-Tree & B+Tree As nothing is mentioned about the type of tree, we take it B-Tree by default. No of records = 20,000 Block Size = 1000B Key = 40B Block Pointer = Record Pointer = 10B n*BP + (n-1)*(Key+RP) <= Block SIze where n is order of tree n*10 + (n-1)*50 <= 1000 n<=17.5 Order = 17 No of level = Log (No of records) Base(Order of Tree) log 20,000 Base17 = 3.49 No of levels = 4 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes Solution pic for current Multilvel index problem.Hi, the no of levels come as 3. The below gives an pictorial illustration of index example while solving the problem which might help in clearing any doubts. https://gateoverflow.in/299996/ace-test-series-dbms-file-indexing prasapi answered Jul 16, 2021 prasapi comment Share Follow See all 0 reply Please log in or register to add a comment.