| T1 | T2 | T3 | T4 |
|---|---|---|---|
| Reads(X) | |||
| Writes(X) | |||
| Commit | |||
| Writes(X) | |||
| Commit | |||
| Writes(Y) | |||
| Reads(Z) | |||
| Commit | |||
| Reads(X) | |||
| Reads(Y) | |||
| Commit |
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…
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…
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?
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…
Given the following statements: S1: A foreign key declaration can always be replaced by an equivalent check assertion in SQL. S2: …
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x…
Free account benefits
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.