Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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'.
Discuss the differences among the candidate keys and the primary key of a relation. Give instance to describe your answer? A candidate key is one that can be used as primary ke
describe all the tables you have created. ?get table_name, status, num_rows, user_stats in user_tables system view ?get table_name, constraint_name, constraint_type in user_constr
Control as a State Machine Engine First let us define the state machine: "the state machine is a machine which is an object but not an application object. It is a part of lang
List some instances of collection types? a) sets b) arrays c) multisets
What are shortcomings in structured approach? Structured methodology treats data and their behaviours separately, and this makes it harder to isolate changes. If changes are re
What is Nested Queries explain in details? Nested Queries - A SELECT query could have subquery(s) in it. While a SELECT query having another SELECT query in it, is known as n
A student entity type has the following attributes,name..
Define Partial Key and Primary Key A partial key, also known as discriminator, is the set of attributes which can uniquely identify weak entities that are related to similar o
What is recursive closure? Why is it not possible to describe this operation in relational algebra? Recursive closure is applied to recursive relationship. An instance of rec
Eliminate Columns Not Dependent On Key The Employee Relation satisfies - First normal form - As it has no repeating groups. Second normal form - As it do not have multi-a
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd