1,471 views
1 1 vote
Let R(A, B, C, D, E) be a relation which has 500000 records. Size of each record is 200 B. Size of attribute A is 16 B. Size of pointer is 4 B and size of the block is 2400 B (assume elements are stored in sorted order of key).
On the execution of the query,
                                            Select ∗ from R where A = ‘GATE’
The difference of the cost in term of number of block transfer from the disk when multilevel index used and when binary search applied without indexing is _______.

Please log in or register to answer this question.

Position:
Show:

Related questions

1 1 vote
0 0 answers
1.0k
1.0k views
Subbu. asked Jul 15, 2022
1,039 views
Hey How is Gateoverflow test series .. better than other institutes, that means little harder than gate and quality of questions??. #Genuine answers please…
0 0 votes
0 0 answers
230
230 views
Ritabrata Dey asked May 24, 2019
230 views
How to take tests on GO ? When i am going to gate test series on GO...it is asking registration number..but i have got none ..how to get registered for exam??
0 0 votes
0 0 answers
775
775 views
Manan Shah asked Dec 20, 2018
775 views
If the marks obtained by the students in a competitive exam follows normal distribution with mean value 50 and variance 10. If the passing marks is 40 then percentage of ...
0 0 votes
0 0 answers
388
388 views
Nau1994 asked Nov 2, 2018
388 views
Consider two stations communicates Via 1Mops satellite link with propagation delay of270 msecThe satellite serves merely toretransmit data received from one station toano...