GATEverse Practice, past papers & mock tests
GATE 2027: 115 days Sign in Create account
GATE 2014 · session-2
Database ManagementRelational Model: Relational Algebra and Tuple CalculusmediumMCQ2 marks
Consider a join (relational algebra) between relations r(R) and s(S) using the nested loop method. There are 3 buffers each of size equal to disk block size, out of which one buffer is reserved for intermediate results. Assuming size(r(R)) < size(s(S)), the join will have fewer number of disk block accesses if
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…