Question

Assume one file has r = 10^6 records. Each record takes R = 100 bytes, of which 10 bytes are for the key of the record. Suppose the key values range from 1 through 1,000,000 inclusive. Assume the block size B is 1000 bytes for all files, and that an address (block pointer, tree node pointer, or data record pointer) takes 10 bytes.

1. What is the blocking factor bfr i for the single level index ?
2. How many index blocks bi are needed to build the single level primary index ?
3. How many block accesses on the average are needed to fetch a record by doing linear search on the single level index part?
4. What is the least number of block accesses to fetch a record by using single level primary index with binary search?

Answer 1

  Hope this answer helped you.Please like.Happy learning.