Write the queries in relational algebra, Database Management System

Assignment Help:

Problem:

You are given the following schema

1. Flights(flno, from, to, distance)
2. Aircraft(aid, flno, aname, cruisingRange)
3. Certified(eid, aid)
4. Employees(eid, ename, salary)

‘CruisingRange' is the distance that can be covered by an aircraft in a non-stop mode.

(i) Write the following queries in Relational Algebra.

(a) Find the names of pilots certified for 'Boeing 747' aircraft.

(b) Find the ids of all aircraft that can be used on non-stop flights from New York to Los Angeles.

(c) Find the names of pilots who can operate planes with a range greater than 3000 miles, but are not certified on 'Boeing 747' aircraft.

(ii) Write the following queries in SQL.

(a) Find the ids of employees who are not certified at all.

(b) Find the ids of all aircraft that can be used on non-stop flights from New York to Los Angeles.

Related Discussions:- Write the queries in relational algebra

The natural join is equal to which product, The natural join is equal to wh...

The natural join is equal to which product? The natural join is equal to Combination of projection and Cartesian product

Cases of constraint violations, (1) Insert into PERSON Violated con...

(1) Insert into PERSON Violated constraint: - Key constraint Reason: - Primary key 1 already exists in PERSON. Dealing: - DBMS could ask the user to provide valid PER

Replicating data, Replicating Data One approach that may support effici...

Replicating Data One approach that may support efficient access to dissimilar applications as above may be to give access to every of the applications from dissimilar replicate

Normalization, Normalize the given relation to 3NF, justifying each step

Normalize the given relation to 3NF, justifying each step

Ordering of tuples, In a relation, tuples are not inserted in any definite ...

In a relation, tuples are not inserted in any definite order. Ordering of tuples is not defined as a part of a relation definition. Though, records may be structured later accordin

Cartesian product, If R1 and R2 are two relations or functions, then the re...

If R1 and R2 are two relations or functions, then the result of R3 = R1 × R2 is the combination of tuples that are in R1 and R2. The product is associative and commutative. Degr

Read-set(t) and timestamps-optimistic concurrency contents, read-set(T) : E...

read-set(T) : Each data items that are read by a transaction T Timestamps : for all transaction T, the start-time and the end time are reserved for all the three phases.

Question, I want to buy this but I want to see a couple sample questions fi...

I want to buy this but I want to see a couple sample questions first. http://www.expertsmind.com/library/what-happens-to-rms-error-for-the-training-data-set-51564843.aspx

Objectives of database manangement system, OBJECTIVES After going thro...

OBJECTIVES After going through this unit you should be capable to: Explain the File Based system and its limitations; Explain the structure of DBMS; Explain the

Define atom of domain relational calculus, Define Atom of domain relational...

Define Atom of domain relational calculus An atom has the outline 1 , x 2 , ... , x n > -> r , in which r stands for a relation on n attributes and x 1 , x 2 , ... , x n ar

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages