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

What is storage manager, What is storage manager? A storage manager is ...

What is storage manager? A storage manager is a program module that gives the interface among the low level data keeps in a database and the application programs and queries su

What do you mean by persistence, What do you mean by persistence? How you w...

What do you mean by persistence? How you will make your data persistent? Persistent data is the data, which has a longer lifetime than program which has created it. Enabling th

Identify the candidate keys, Consider the following six relation schemes an...

Consider the following six relation schemes and their corresponding sets of functional dependencies. In each case identify a. All the candidate keys b. The highest normal for

The second normal form (2nf), The Second Normal Form (2NF) Definition: ...

The Second Normal Form (2NF) Definition: A relation is in 2NF if it is in 1NF and each non-key attribute is fully dependent on each candidate key of the relation. Some of th

Development of an ER diagram and database implementation, i want answers th...

i want answers this assignment now if yiu can maket for me now ?

Explain the dynamic hashing techniques, Explain the Dynamic Hashing Techniq...

Explain the Dynamic Hashing Techniques There are two methods in it: extendible hashing - stores an access structure in addition to the file, and therefore is somewhat identica

One-to-many relationship, For each 1: n relationship type R involving two e...

For each 1: n relationship type R involving two entities E1 and E2, we recognize the entity type (say E1) at the n-side of the relationship type R and contain primary key of the en

DW, #ques Define a job scheduling strategy that will meet business requirem...

#ques Define a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes? Show the job scheduling dependencies in a p

Schema, difference between internal schema and external schema in DBMS

difference between internal schema and external schema in DBMS

One to many - relationship cardinality, One-to-many : An entity in A is rel...

One-to-many : An entity in A is related with any number of entities in B. An entity in B is related with at the most one entity in A. Example: Relationship between faculty and d

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