Consider a relation with this schema:

Suppose that the following indexes, all using Alternative (2) for data entries, exist: a hash index on eid, a B+ tree index on sal, a hash index on age, and a clustered B+ tree index on {age, sal}. Each Employees record is 100 bytes long, and you can assume that each index data entry is 20 bytes long. The Employees relation contains 10,000 pages.

1. Consider each of the following selection conditions and, assuming that the reduction factor (RF) for each term that matches an index is 0.1, compute the cost of the most selective access path for retrieving all Employees tuples that satisfy the condition:

(a)  > 100

(b)  = 25

(c)  > 20

(d)  = 1, 000

(e)  > 200 ∧  > 30

(f)  > 200 ∧ age = 20

(g)  > 200 ∧  =0 ‘CFO’

(h)  > 200 ∧  > 30 ∧  = ‘CFO’

2. Suppose that for each of the preceding selection conditions, you want to retrieve the average salary of qualifying tuples. For each selection condition, describe the least expensive evaluation method and state its cost.

3. Suppose that for each of the preceding selection conditions, you want to compute the average salary for each age group. For each selection condition, describe the least expensive evaluation method and state its cost.

4. Suppose that for each of the preceding selection conditions, you want to compute the average age for each  level (i.e., group by ). For each selection condition, describe the least expensive evaluation method and state its cost.

5. For each of the following selection conditions, describe the best evaluation method: