Give expression in both tuple calculus and domain calculus, Database Management System

Assignment Help:

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')}


Related Discussions:- Give expression in both tuple calculus and domain calculus

Write short notes on extension and intension, Write short notes on extensio...

Write short notes on extension and intension? In any data model, it is significant to distinguish among the description of the database and the database itself the description

Single-valued dependencies, Single-Valued Dependencies A database is a ...

Single-Valued Dependencies A database is a collection of related information and it is therefore inevitable that some items of information in the database would depend on some

Describe specialsation and generalization, Describe Specialsation and gener...

Describe Specialsation and generalization? Specialisation /generalization: This is a top down and bottom up approach to the design of database. It displays the IS_A relation

Deadlock prevention, Deadlock Prevention One of the easiest approaches ...

Deadlock Prevention One of the easiest approaches for avoiding a deadlock would be to obtain all the locks at the begin of the transaction. Though, this approach restricts conc

Define the canonical cover, Define the Canonical cover Ans: A canonical...

Define the Canonical cover Ans: A canonical cover F c for F is a set of dependencies like F logically implies all dependencies in F c , and F c logically entails all dependen

Define two phase commit, Define Two phase commit Two phase commit: To m...

Define Two phase commit Two phase commit: To make sure atomicity, all the sites where a transaction is being executed must agree on the final outcome of the execution. The tran

What is system catalog or catalog relation, What is system catalog or catal...

What is system catalog or catalog relation? How is better known as? A RDBMS maintains a explanation of all the data that it contains, information about every relation and index

Example of sequences, Example : Create a sequence named SEQSS that starts a...

Example : Create a sequence named SEQSS that starts at 105, has a step of 1 and can take maximum value as 2000.  CREATE SEQUENCE SEQSS START WITH 105 INCREMENT BY 1 MAX VA

Explain the deadlock avoidance, Define deadlock avoidance. An alternat...

Define deadlock avoidance. An alternative method for avoiding deadlocks is to needs additional information about how resources are to be requested. Each request requires the s

Define and differentiate among ordered indexing and hashing, Define and dif...

Define and differentiate between ordered indexing and hashing. Ans: Ordered indexing: To gain fast random access to records in a file, we can make of an index structure. Every

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd