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 subsequent relation schemes:
Project (Project#, Project_name, chief_architect)
Employee (Emp#, Empname)
Assigned_To (Project#, Emp#)
Give expression in Tuple calculus and Domain calculus for each of the queries below:
(i) Get the employee numbers of employees who work on all projects.
(ii) Get the employee numbers of employees who do not work on the COMP123 project.
Ans: (i) Tuple Calculus:
{t[Emp#] | t ∈ ASSIGNED_TO ∧ ∀p (p ∈ PROJECT ∃u (u ∈ ASSIGNED_TO ∧ p[Project#] = u[Project#] ∧ t[Emp#] = u[Emp#]))}
Domain Calculus:
{e | ∃p (
∈ ASSIGNED_TO ∧ ∀p1 ( ∈ PROJECT ∈ ASSIGNED_TO))}
(ii) Tuple Calculus:
{t[Emp#] | t ∈ ASSIGNED_TO ∧ ¬∃u (u ∈ ASSIGNED_TO ∧ u[Project#] = 'COMP123'∧ t[Emp#] = u[Emp#])}
∈ ASSIGNED_TO ∧ ∀p1, e1 ( ∉ ASSIGNED_TO ∨ p1 ≠ 'COMP123' ∨ e1 ≠ e))}
Aggregation : One limitation of the E-R diagram is that they do not permit representation of relationships between relationships. In such a case the relationship along with its ent
education.
Gaps in sequence values can happen when: - A rollback happens that is when a statement changes are not accepted. - When the system crashes - When a sequence i
Given the following set of functional dependencies {cf→ bg, g → d, cdg → f, b → de, d → c} defined on R(b,c,d,e,f,g) a. Is cf→ e implied by the FDs? b. Is dg a superkey?
The Proliferation of Object-Oriented Methods The first few years of the 1990s saw blossoming of around fifty various object oriented methods. This proliferation is a sign of g
What is the difference between SQL Server 2000 clustered and nonclustered indexes? With a clustered index, the data are kept in the bottom level of the index and in the similar
What is Candidate Key Super Key or Candidate Key: It is such an attribute of a table that can uniquely recognize a row in a table. Generally they have unique values and can n
1. Which relational algebra operations do not need the participating tables to be union-compatible? Ans: Join is the relational algebra operations that do not need the particip
what are the main characteristics of database
What is meant by heuristic optimisation? Discuss the main heuristics that are applied during query optimisation. Ans: In heuristic optimization, heuristics are employed to r
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