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 called remapping of bad sectors, What is called remapping of bad se...

What is called remapping of bad sectors? If the controller detects that a sector is injured when the disk is initially formatted, or when an attempt is made to write the secto

What are the different approaches for database design, What are the differe...

What are the different approaches for database design? There are two basic approaches for database design which are as follows: Attribute driven: It compiles a list of att

Determine bcnf-dcnf and key relation, (A) For the relation; CarSales (R...

(A) For the relation; CarSales (RegNo, BuyerName, Address, SalesPerson, Make, Model, Commission) The following functional dependences hold, RegNo _ID à Make, Model Reg

Structure of distributed database, Structure Of Distributed Database: A di...

Structure Of Distributed Database: A distributed database system haves of a collection of sites, each of which keeps a local databases system. Every site is able to process local

Define deadlock term, a. Define the term "deadlock". There are four conditi...

a. Define the term "deadlock". There are four conditions that must hold before deadlock is possible. Name them. b. Outline an algorithm that detects whether there is a deadlock.

Relational constraints, Relational and E-R Model There are three types o...

Relational and E-R Model There are three types of constraints on relational database that have: DOMAIN CONSTRAINT PRIMARY KEY CONSTRAINT INTEGRITY CONSTRAINT

Prepare a data flow diagram for computing the volume, Prepare a data flow d...

Prepare a data flow diagram for computing the volume and surface area of a cylinder. Inputs are the height and radius of the cylinder. Outputs are the volume and surface area of th

What are the issues are formed while selecting a database, What are the Iss...

What are the Issues when Selecting a Database Issues when Selecting a Database Storage space requirement: A database requires about triple storage space of the actua

Using relational algebra which query finds customers, Using Relational Alge...

Using Relational Algebra which query finds customers, who have a balance of over 1000 ? Using Relational Algebra Π Customer_name( σ balance >1000(Deposit)) is query to find cu

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