Question: Question 2 1 options: A disk has block size of 1 0 2 4 bytes. A file has 3 0 , 0 0 0 EMPLOYEE
Question options:
A disk has block size of bytes. A file has EMPLOYEE records of fixed length. Each record has the following fields: NAME bytes SSN bytes DEPARTMENTCODE bytes ADDRESS bytes PHONE bytes BIRTHDATE bytes SEX byte JOBCODE bytes SALARY bytes, real number
Assume that you have built a dense Btree index on SSN and the Btree's leaf nodes directly contain data records there is no separate data file Assume points eg record IDs are byte long. Assume also that you built the tree by using bulk loading so that the nodes at each level were filled up as much as possible.
How many levels does the resulting tree have?
How many child pages does the root page have?
How many block IOs are needed to search for and retrieve a record from the file given its SSN value using the index?
How many levels would the resulting tree has with all pages full only?
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
