Question Description a. Consider that the data-file has 750000 records of employees. The employee-records are ordered based

Question Description

Transcribed Image Text:

a. Consider that the data-file has 750000 records of employees. The employee-records are ordered based on non-key field project_id and size of that field is 8 bytes. Each of the employee records has size of 100 bytes. Consider none of the records are allowed to cross block boundaries. Consider clustering index structure for the data file has been created to speed up the retrieval of the records where indexing field is based on the project_id and a block pointer which is 5 bytes long. Assume the Block size is 8 Kilobytes. Find out the total number of block accesses to search for an employee record using the said index. Consider, there are 50 employees working on each project. [7] b. Suppose you are going to implement dynamic multilevel indexing using B tree and B* trees. Consider size of the data pointer, key, and the block pointer or tree pointer is 8 bytes each, block size is 5 kilobytes. Suppose, a single internal node of the tree (B tree or B* tree) can fit into a single block. Find out the order of the said trees. [5] a. Consider that the data-file has 750000 records of employees. The employee-records are ordered based on non-key field project_id and size of that field is 8 bytes. Each of the employee records has size of 100 bytes. Consider none of the records are allowed to cross block boundaries. Consider clustering index structure for the data file has been created to speed up the retrieval of the records where indexing field is based on the project_id and a block pointer which is 5 bytes long. Assume the Block size is 8 Kilobytes. Find out the total number of block accesses to search for an employee record using the said index. Consider, there are 50 employees working on each project. [7] b. Suppose you are going to implement dynamic multilevel indexing using B tree and B* trees. Consider size of the data pointer, key, and the block pointer or tree pointer is 8 bytes each, block size is 5 kilobytes. Suppose, a single internal node of the tree (B tree or B* tree) can fit into a single block. Find out the order of the said trees. [5]

Answer rating: 100% (QA)

The detailed a... View the full answer