1. Consider the relation r (Key, Name, Address). The relation takes 100 blocks on disk and holds 10000 tuples.

a. What is the selectivity of an equality predicate on Key?

b. Given a secondary Index_Name (height = 3) and a range predicate on Name with selectivity of 0.02, estimate the cost of doing the lookup on A.

c. Given a clustered Index_Name (height = 2) and a range predicate on Name with selectivity of 0.02, estimate the cost of doing the lookup on A.

d. Given a predicate P_A with selectivity of 0.3 and a predicate P_B with a selectivity of 0.5, what are the selectivities of:

(NOTE: you just need to compute the selectivity value, you do not need to estimate any costs in this part. You will have to make some assumptions about correlation between P_A and P_B)

1. NOT P_A
2. P_A AND P_B
3. P_A OR P_B
4. P_A AND (NOT P_B)