GATEverse Practice, past papers & mock tests
GATE 2027: 115 days Sign in Create account
GATE 2014 · session-3
Database ManagementRelational Model: Relational Algebra and Tuple CalculusmediumMCQ2 marks
Consider the relational schema given below, where eId of the relation dependent is a foreign key referring to empId of the relation employee. Assume that every employee has at least one associated dependent in the dependent relation. employee(empId, empName, empAge) dependent(depId, eId, depName, depAge) Primary keys: employee.empId; dependent.(depId,eId). Consider the following relational algebra query: π_empId(employee) − π_empId(employee ⋈_((empId=eId)∧(empAge≤depAge)) dependent) The above query evaluates to the set of empIds of employees whose age is greater than that of
Save your progress

Related Database Management PYQs

GATE 2014 · SET - 1

Consider the following schedule S involving two transactions T1 and T2: S: r1(X); r2(X); w1(X); r2(Y); w2(X); c1; c2; Which of the…

GATE 2014 · SET - 2

A relation R(A, B, C) has functional dependencies F = {A -> B, B -> C}. If R is decomposed into R1(A, B) and R2(B, C), this decomp…

GATE 2014 · SET - 1

Consider a schema R(A, B, C, D) with functional dependencies F = {AB -> C, C -> D, D -> A}. What are all the candidate keys of R?

GATE 2014 · session-1

Consider the relation scheme R=(E,F,G,H,I,J,K,L,M,N) and the set of functional dependencies {{E,F}→{G}, {F}→{I,J}, {E,H}→{K,L}, {K…

GATE 2014 · session-1

Given the following statements: S1: A foreign key declaration can always be replaced by an equivalent check assertion in SQL. S2: …

GATE 2014 · session-1

Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x…