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

Database for Managers, I have to create a database about anything of my cho...

I have to create a database about anything of my choice. It has to contain 4 queries, and 4 forms. It can be anything as simple as a shoe inventory with numbers - is this a service

BI, (a) Why did SAP introduce the extended star schema?

(a) Why did SAP introduce the extended star schema?

Cube building in dataware housing , 1) Define a job scheduling strategy tha...

1) 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 pict

Explain data independence, Explain data independence ? Data independenc...

Explain data independence ? Data independence is the capacity to modify the schema at one stage of a database system without having to change the schema at the further level.

E r diagram, how to make an e r diagram?

how to make an e r diagram?

Name the metrics for selecting top algorithm, Name the metrics for selectin...

Name the metrics for selecting top algorithm There are a number of metrics for selecting top algorithm: i) Computational complexity: Computational complexity refers to eff

Replication-design of distributed databases, Replication : It is definite a...

Replication : It is definite as a copy of a relation. Every replica is stored at a dissimilar site. The alternative to replication is to store only single copy of a relation which

Locking, define locking in simple language and decribed it

define locking in simple language and decribed it

How is concurrency identified, How is concurrency identified? Concurren...

How is concurrency identified? Concurrency in objects can be identified by the way they alter their state. Current objects can change their state independently. Aggregation imp

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