Consider a relation that is fragmented horizontally by location (plant-number):
Employee (name, address, salary, plant-number)
Assume each fragment has two replicas: one stored at the Los Angeles site and one stored locally at the plant site. Describe a good processing strategy (in outline, not SQL) for the following queries entered at the Baltimore site and say why you think it is a good processing strategy.
- Find all employees at the San Diego plant.
- Find the average salary of all employees.
- Find the highest-paid employee at each of the following sites: Omaha, Chicago, Seattle, Richmond.
- Find the lowest-paid employee in the comp