Relational algebra, Database Management System

Assignment Help:

Consider the relation schemas as follows.

works (person name, company name, salary);
lives (person name, street, city);
located in(company name, city);
managers (person name, manager name); where manager name refers to person name.

Express the following queries firstly using Relational Algebra and then using SQL.

i) Find the names of the persons who work for company 'FBC' (company name= ‘FBC').

ii) List the names of the persons who work for company ‘FBC' along with the cities they live in.

iii) Find the persons who work for company ‘FBC' with a salary of more than 10000. List the names of these persons along with the streets and cities where they live.

iv) Find the names of the persons who live and work in the same city.

v) Find the names of the persons who do not work for company ‘FBC'.


Related Discussions:- Relational algebra

Explain the weak entity set, Explain the Weak Entity Set An Entity set...

Explain the Weak Entity Set An Entity set which does not have sufficient attribute to make a primay key is known as weak entity set. For instance, dependents of an employee in

Binary relationships, One-to-one relationship: For every 1:1 relationshi...

One-to-one relationship: For every 1:1 relationship type R in the ER diagram including two entities E1 and E2 we take one of entities (say E1) preferably with total participatio

What is difference between primary index and secondary index, What is diffe...

What is difference between primary index and secondary index? Primary Index a) It is an ordered file whose records are of fixed length along with two fields. b) Only base

Explain how the associations are implemented as classes, Explain how the as...

Explain how the associations are implemented as classes. A general approach in this case is to transform an association class into a simple class linked to two original classes

Explain the cascadeless schedule, Explain the Cascadeless Schedule A ca...

Explain the Cascadeless Schedule A cascadeless schedule is one in which for every pair of transactions Ti and Tj like that Tj reads a data item before written by Ti, the commit

What is the need of a log in a dbms, What is the need of a log in a DBMS? B...

What is the need of a log in a DBMS? Briefly describe the various types of records that are normally present in a log.            Ans:  The system log, which is generally writt

What are ways of finding out derived attributes, What are ways of finding o...

What are ways of finding out either an update is required or not for derived attributes? The ways to find out an update is required or, not are as: Explicit update

Relation schema for student, Example RELATION SCHEMA for STUDENT: STU...

Example RELATION SCHEMA for STUDENT: STUDENT (Roll No: string, name: string, login: string, age: integer) RELATION INSTANCE

Entity integrity, Before defines the second type of integrity constraint, v...

Before defines the second type of integrity constraint, viz., Entity Integrity, we should be well-known with the concept of NULL. Mostly, NULL is intended as a basis for dealing

What is online transaction processing, What is OLTP (Online Transaction Pro...

What is OLTP (Online Transaction Processing)? In OLTP - online transaction processing systems relational database design use the discipline of data modeling and generally follo

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd