Exercise $1$:

Given the following data file EMPLOYEE $($NAME$,$ SSN$,$ ADDRESS, JOB, $...),$ suppose that: the record size $($R$)=170$ bytes; the block size $($B$)=512$ bytes and the number of file blocks $=5000.$

a$)$ Calculate the blocking factor.

b$)$ Calculate the number of records $($r$).$

Let$$s assume that the total size of the primary index entry is equal to $16$ bytes.

c$)$ Calculate the index blocking factor.

d$)$ Calculate the number of index blocks

e$)$ Calculate the binary search cost $($in time$)$ for a direct search on the data file and for a search on the primary index files.

Your answer:

$($step by step$)$

Exercise $2$:

Suppose that we have a and the size of the search key field V is equal to $10$ bytes, the size of the data $($record$)$ pointer Pr $=6$ bytes, and the tree $($block$)$ pointer P is $5$ bytes and the value of p $($the order or the maximum number of a tree pointers in a node$)$ is equal to $20$ for an internal node.

a$)$ Calculate the block size $($B$)$

b$)$ Suppose that we have a B$-$ tree instead of and based on the block size found in question $($a$),$ calculate the order $($p$)$ for an internal node in this case.

Your answer:

$($step by step$)$