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'.
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.
how to implement mid square hashing?
Explain Candidate Key and Super Key A super key is a set of one or more than attributes that, taken collectively, permits us to identify uniquely a tuple in the relation. Wher
What are the various symbols used to draw an E-R diagram? Explain with the help of an example how weak entity sets are represented in an E-R diagram. Various symbols used to d
Define two-phase locking protocol. Ans: Two-phase locking is significance in the context of ensuring that schedules are serializable. The two-phase locking protocol defines a p
What is an ERD?
What do you mean by persistence? How you will make your data persistent? Persistent data is the data, which has a longer lifetime than program which has created it. Enabling th
Define the concept of aggregation. Give two examples where this concept is useful. Ans: Aggregation transforms a relationship among the objects into a higher-level object. A
Explain in details about Data Sharing
Describe the nested-loop join and block-nested loop join. Ans: The block nested- loop join algorithm is as described below: for every block B r of relation R do beg
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