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 following relational schema: Doctor(DName,Reg_no) Patient(Pname, Disease) Assigned_To (Pname,Dname) Give expression in both Tuple calculus and Domain calculus for every of the queries:(i) Get the names of patients who are assigned to more than one doctor. (ii) Get the names of doctors who are treating patients with ‘Polio'.
Ans: (i)Tuple Calculus: {p[PName] | p ∈ PATIENT ∧ ∃a1, a2 (a1 ∈ ASSIGNED_TO ∧ a2 ∈ ASSIGNED_TO ∧p[PName] = a1[PName] ∧ a1[PName] = a2[PName] ∧ a1[DName] ≠ a2[DName])} Domain Calculus:{p | ∃p1, d1, p2, d2 (
∈ PATIENT ∧ ∈ ASSIGNED_TO ∧ ∈ASSIGNED_TO ∧ p1 = p2 ∧ d1 ≠ d2)} (ii)Tuple Calculus: {u[Dname] | u ∈ ASSIGNED_TO ∧ ∃t (t ∈ PATIENT ∧ t[Disease] = ‘Polio' ∧t[PName] = u[PName])} Domain Calculus: {d | ∃p1, p2, s2 ( ∈ ASSIGNED_TO ∧ ∈ PATIENT∧ p1 = p2 ∧ s2 = ‘Polio')}
The participation Constraints shows whether the existence of an entity depends on its being associated to another entity by the relationship type. There are two kinds of participat
What are the problems if one were not to normalize? When do these problems surface? Ans: Database normalization, sometimes considered to as canonical synthesis, is
Question: Consider the following database relations for a textbook ordering system used by a college bookshop: Book (b-copy#, bname, ISBN#, author, price, subject) Order (s#
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
Mappings between Levels and Data Independence The 3 levels of abstraction in the database do not exist separately of each other. There must be some correspondence, or mapping
what are the reasons having variable length records
What is known as clustering file organization? In the clustering file organization, records of several dissimilar relations are stored in the similar file.
Differance between Open addressing and chaining for collision resolution ? In open addressing , proceeding from the occupied position specified by hash address the program che
Explain Relational model and their use in DBMS? Relational Model - The relational model was first introduced through E.F. Codd of the IBM Research in the year of 1970. The mode
What is a virtual table that draws its data from the result of an SQL SELECT statement? View is a virtual table that draws its data from the result of an SQL SELECT statement.
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