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')}
What is property - properties of a database ? It is an integrated collection of logically related records. It consolidates separate files into a common pool of data records and
An entity set that does not have sufficient attributes to form a primary key is called? An entity set that doesn't have sufficient attribute to form a primary key is known as w
What is called as an N-way merge? The merge operation is a generalization of the two-way merge used by the standard in-memory sort-merge algorithm. It merges N runs, so it is k
how to solve the C type problems?
Serialisability: Any schedule that makes the similar results as a serial schedule is known as a serialisable schedule. But how can a schedule are determined to be serialisable or n
Objectives After Reading this part, you should be able to: Explain the term CONCURRENCY; Describe the term transaction and concurrent transactions; Talk about co
Illustrate the view of software architecture A model is a semantically closed abstraction of system composes of elements. It can be visualized using any of the following five v
Views in relational algebra: 1. Basic expression contains either a) A relation in the database. b) A constant relation. 2. General expressions are madde out of sma
A field-groups statement or an insert statement reverses storage space and transfers values. False.
Compare the Nested-loop join and block-nested loop join Ans: Nested loop join - It is costly as worst case cost, no. of block accesses needed is n r * b s + b r where b
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