edited by
922 views
1 votes
1 votes
Let there is a Table named Stud_records  with $3000$ records of fixed length, each record size is $50$ Bytes and records are stored in a block of size $512$ Bytes, If secondary index is built on the key field of size $10$ Bytes and a block pointer of size $5$ Bytes , then the number of first level index blocks are ______
edited by

2 Answers

Best answer
1 votes
1 votes
index record size =10+5=15 B,  no of records /block = 512/50=10 records/block , No of index records/block= 512/15=34,no of index records 3000 as given,  then no of index block= 3000/34=89 blocks
selected by
0 votes
0 votes

If secondary index is built on the key field

Means dense indexing.

Hence, we'll need an index pointer for each record.

 

Total records = 3000.

In 1 block, index pointers possible = $\frac{512}{15}= 34.13=34$ indices are possible.

So, we need $\frac{3000}{34}= 88.2=89$ blocks.

Answer:

Related questions

0 votes
0 votes
1 answer
1
Bikram asked Nov 26, 2016
419 views
Let the search key field of a B+ tree is 4 Bytes , the disk block size is 199 Bytes , and the index pointer is 3 Bytes, then the order of B+ tree is _______
0 votes
0 votes
1 answer
2
Bikram asked Nov 26, 2016
744 views
Each dealer owns one or more cars and each car is owned by at-most one dealer. If Dealer table has $20$ tuples and Cars table has $60$ tuples then owns table can have max...
1 votes
1 votes
1 answer
3
Bikram asked Nov 26, 2016
334 views
Consider the join of relation R with a relation S. If R has $m$ tuples and S has $n$ tuples, then the maximum and minimum sizes of the join, respectively, are __________....
0 votes
0 votes
1 answer
4
Bikram asked Nov 26, 2016
245 views
A functional dependency of the form x → y is trivial ify ⊆ xy ⊂ xx ⊆ yx ⊂ y