A many-to-one relationship exists between entity sets r 1 and r 2 . How will it be represented using functional dependencies if Pk(r) denotes the primary key attribute of relation r ?
Given the relations
employee (name, salary, dept-no), and
department (dept-no, dept-name,address)
Which of the following queries cannot be expressed using the basic
relational algebra operations (σ, π, x, -, ∪, p)
Department address of every employee
Employees whose name is the same as their department name
Let R1 (a, b, c) and R2 (x, y, z) be two relations in which a is the foreign key of R1 that refers to the primary key of R2 . Consider following four options.
(a)Insert into R 1
(b)Insert into R 2
(c)Delete from R 1
(d)Delete from R 2
Which of the following is correct about the referential integrity constraint with respect to above?
The relation schemas R1 and R2 form a Lossless join decomposition of R if and only if:
(a) R1 ∩ R2 ↠ (R1 - R2)
(b) R1 → R2
(c) R1 ∩ R2 ↠ (R2 - R1 )
(d)(R2 → R1) ∩ R2