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

Design and prototype, This assignment is worth 45% of your final grade for ...

This assignment is worth 45% of your final grade for this module.  Marks will be awarded as follows: Prototypes (wireframe and web based prototype) You are expected

Explain the aggregation implies concurrency, Explain the Aggregation implie...

Explain the Aggregation implies concurrency Concurrency actually is: This in objects can be identified by the way they change state. Present objects can change state independen

What is hashing file organization, What is hashing file organization? ...

What is hashing file organization? In the hashing file organization, a hash function is computed on some attribute of every record. The result of the hash function specify in

Determine the concept of process, Determine the concept of Process Pro...

Determine the concept of Process Process: A process transforms the data values. It is represented as ellipse containing a description of transformation. Each procedure has a

What is the candidate key for a table with columns, For problems 1-4, give ...

For problems 1-4, give all candidate keys for the tables with FDs specified.  Composite candidate keys must be put in parentheses, and candidate keys must be separated with commas

Construct substantial data model, PART MARKING:  We will only mark TWO of t...

PART MARKING:  We will only mark TWO of the four questions below but you must submit answers to all four. We will choose the questions we mark randomly and we will supply you with

Hangman, a method named WonGame that checks each letter in the word is matc...

a method named WonGame that checks each letter in the word is matched by its label

Many-to-many relationship, For each m:n relationship type R, we make a new ...

For each m:n relationship type R, we make a new table (say S) to represent R. We also contain the primary key attributes of both the participating entity types as a foreign key att

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