Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Consider the following schema: driver (emp_id, first_name, last_name, salary) route (route_code, from, to, distance, depart_time, arrival_time) bus (bus_id, manufacturer, model, fuel, max autonomy) has_license (emp_id,
Consider the following schema: driver (emp_id, first_name, last_name, salary) route (route_code, from, to, distance, depart_time, arrival_time) bus (bus_id, manufacturer, model, fuel, max autonomy) has_license (emp_id, bus_id) The driver relation has information about the bus drivers; the route relation indicates each bus route characteristics. The bus relation contains information about each bus. The has_certification relation indicates which drivers have a license to drive a certain bus. For each query displayed below, provide the following 3 expressions: i) in relational algebra, ii) in domain relational calulus, and iii) in tuple relational calculus. d) (9%) Find the bus_ids of all buses that can be used on the long-range non-stop route from "Ottawa" to "Quebec City", i.e., we want the bus maximum autonomy to be greater than the route distance so that a stop is not necessary. e) (9%) Find the names of drivers who can drive buses with an autonomy greater than 400 miles but do not have a license for any bus manufactured by Technobus". f) (9%) Find the employee id's of the drivers who make the highest salary. Consider the following schema: driver (emp_id, first_name, last_name, salary) route (route_code, from, to, distance, depart_time, arrival_time) bus (bus_id, manufacturer, model, fuel, max autonomy) has_license (emp_id, bus_id) The driver relation has information about the bus drivers; the route relation indicates each bus route characteristics. The bus relation contains information about each bus. The has_certification relation indicates which drivers have a license to drive a certain bus. For each query displayed below, provide the following 3 expressions: i) in relational algebra, ii) in domain relational calulus, and iii) in tuple relational calculus. d) (9%) Find the bus_ids of all buses that can be used on the long-range non-stop route from "Ottawa" to "Quebec City", i.e., we want the bus maximum autonomy to be greater than the route distance so that a stop is not necessary. e) (9%) Find the names of drivers who can drive buses with an autonomy greater than 400 miles but do not have a license for any bus manufactured by Technobus". f) (9%) Find the employee id's of the drivers who make the highest salary
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started