Question

Consider the following relational schema as part of a university database: -age-sex-s-q339281 39 Prof(sin, pname, oce, age, sex, specialty, dept did) Dept(did, dname, budget, num majors, chair sin) ssume the following queries are the most common queries in the workload for this university and they are almost equivalent in frequency and importance ssume that both B+ trees and hashed indexes are supported by the DBMS and that both single- and multiple-attribute index search keys are permitted. Specify the attributes you recommend indexing on, indicating whether each index should be clustered or unclustered and whether it should be a B+ tree or a hashed index. Note: If you can search with an index-only plan you should create a composite search key. Find the maximum age of professors in each department. 2. List the minimum age of professors who have a user-specified research specialty 3. List the name of a department with the lowest budget 4. 1. List the department id, department name, and chairperson name for departments with a user- specified number of majors.