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'.
1. Staff(staffID, firstName, lastName, availabilityID, experience, phone, mobile, email); 2. Availability(availabilityID, Monday, Tuesday, Wednesday, Thursday, Friday, Saturday,
Explain the Exec statement in SQL Ans: Exec statement has the structure EXEC SQL END-EXEC Embeded SQl statements are of a form identical to non embedded SQL statem
domain
how many hourse have been spent on a certain project
Difference between LEFT OUTER JOIN and RIGHT OUTER JOIN In left outer join tuples from the left-hand-side relation which do not match any tuple in the right-hand-side relation
Conflicting Operations in Schedule: The three simple ways of interleaved instruction implement of transactions T1 and T2. Please note that in the following tables the first col
Types of data independence Data independence can be classified into the following two types: Physical Data Independence: This means that for any change made in the physi
Define query optimization. Query optimization refers to the process of search the lowest -cost method of evaluating a given query.
construct a B+ tree for the following set of key value (2,3,5,7,11,19,23,29,31) in ascending order where the pointers that will fit in one node is as follows:A. four B. six C. eigh
Define According to the levels of abstraction, the schema at the intermediate level is called Ans: As per to the levels of abstraction, the schema at the intermediate level is
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