Please solve d,e and f Consider a disk with block size B = 512 bytes. A block pointer is P = 6 bytes long,and a record pointer is PR 7 bytes long. A file has r = 30,000 EMPLOYEE recordsof fixed length. Each record has the following fields: Name (30 bytes), Ssn (9 bytes),Department_code (9 bytes), Address (40 bytes), Phone (10 bytes), Birth_date (8bytes), Sex (1 byte), Job_code (4 bytes), and Salary (4 bytes, real number). Anadditional byte is used as a deletion marker.a. Calculate the record size R in bytes.b. Calculate the blocking factor bfr and the number of file blocks b, assuming anunspanned organization.c. Suppose that the file is ordered by the key field Ssn and we want to construct aprimary index on Ssn. Calculate (i) the index blocking factor bfr (which is also theindex fan-out fo); (ii) the number of block accesses needed to search for and retrieve arecord from the file-given its Ssn value-using the primary index.d. Suppose that the file is not ordered by the key field Ssn and we want to construct asecondary index on Ssn. Repeat the previous exercise (part c) for the secondary indexand compare with the primary index.e. Suppose that the file is not ordered by the nonkey field Department_code and wewant to construct a secondary index on Department_code, Assume there are 1,000distinct values of Department_code and that the EMPLOYEE records are evenlydistributed among these values. Calculate (i) the index blocking factor bfri (ii) theapproximate number of block accesses needed to search for and retrieve all records inthe file that have a specific Department_code value, using the index.f. Suppose that the file is ordered by the nonkey field Department_code and we wantto construct a clustering index on Department_code that uses block anchors (everynew value of Department_code starts at the beginning of a new block). Assume thereare 1,000 distinct values of Department_code and that the EMPLOYEE records areevenly distributed among these values. Calculate (i) the index blocking factor bfri (ii)the number of block accesses needed to search for and retrieve all records in the filethat have a specific Department_code value, using the clustering index (assume thatmultiple blocks in a cluster are contiguous).

Question

Accepted Answer

As per our guidelines we are supposed to answer only one question. Kindly repost other questions as…

d. Suppose that the file is not ordered by the key field Ssn and we want to construct a secondary index on Ssn. Repeat the previous exercise (part c) for the secondary index and compare with the primary index.