394 views

1 Answer

Best answer
0 votes
0 votes

see its simple, lets consider we have n records in main table.as all records are stored in BLOCKS. 

soln 3)

number of blocks in main table : (n/3

number of block for index table (level 1): (n/10) (every element maps to index table)

#blocks to hold data and index file : n/3 + n/10= 13n/30.

soln 4)

no. of blocks in index table = n/10 (level 1)

at level 2 = n/102.........................

suppose we have k levels so,

we can say that we will have levels till n/10k =1

taking log and computing we get k = log10n answer.

 

selected by

Related questions

0 votes
0 votes
2 answers
1
SHUBHAM DOMBE asked Nov 1, 2018
421 views
What is the significance of the secondary indexes in the file structure?
0 votes
0 votes
0 answers
2
Shashi Shekhar 1 asked Aug 13, 2018
269 views
https://gateoverflow.in/?qa=blob&qa_blobid=2550937292644146307Plz explain, if we are asked to put each b tree node to fit in one block then why don't we consider it a lea...
1 votes
1 votes
0 answers
3
dushyantsingh asked Jul 8, 2017
311 views
a clusture index offer much better performance than unclusture index for range queries ,explain ?
–3 votes
–3 votes
0 answers
4