Read question properly and give correct answer fastttt within 30 minutes.... will upvote Answer the questions below using the following information: 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 records of fixed length. Each record hs the following fields: Name (30 bytes), SSN (9 bytes), Department_code (9 bytes), Address (40 bytes), Phone (9 bytes), Birth_date (8 bytes), Sex (1 byte), Job_code (4 bytes), Salary (4 bytes, real number). An additional byte is used as a deletion marker. Suppose that the file is not ordered by the key field SSN and we want to construct a B+-tree access structure (index) on SSN. Calculate: The orders p and pleaf of the B+-tree The number of leaf-level blocks needed if blocks are approximately 69 percent full (rounded up for convenience) The number of levels needed if internal nodes are also 69 percent full (also rounded up) The total number of blocks required by the B+-tree The total number of block accesses needed to search for and retrieve a record from the file – given its SSN value – using the B+-tree
Read question properly and give correct answer fastttt within 30 minutes.... will upvote
Answer the questions below using the following information: 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 records of fixed length. Each record hs the following fields: Name (30 bytes), SSN (9 bytes), Department_code (9 bytes), Address (40 bytes), Phone (9 bytes), Birth_date (8 bytes), Sex (1 byte), Job_code (4 bytes), Salary (4 bytes, real number). An additional byte is used as a deletion marker.
Suppose that the file is not ordered by the key field SSN and we want to construct a B+-tree access structure (index) on SSN. Calculate:
The orders p and pleaf of the B+-tree
The number of leaf-level blocks needed if blocks are approximately 69 percent full (rounded up for convenience)
The number of levels needed if internal nodes are also 69 percent full (also rounded up)
The total number of blocks required by the B+-tree
The total number of block accesses needed to search for and retrieve a record from the file – given its SSN value – using the B+-tree
Trending now
This is a popular solution!
Step by step
Solved in 4 steps
