precedence graph
GATE CSE & IT · Transactions · 1996-2024
Study anchor
Korth — Database System Concepts
Relational model, SQL, normalization, transactions
Practice action
Start latest PYQPYQs in this concept
All concepts →Consider the following read-write schedule $S$ over three transactions $T_{1}$, $T_{2}$, and $T_{3}$, where the subscripts in the schedule indicate transaction IDs: $S: r_{1}(z); w...
Let R i (z) and W i (z) denote read and write operations on a data element z by a transaction T i , respectively. Consider the schedule S with four transactions. S : R 4 (x), R 2 (...
Let S be the following schedule of operations of three transactions T 1 , T 2 and T 3 in a relational database system: R 2 (Y), R 1 (X), R 3 (Z), R 1 (Y), W 1 (X), R 2 (Z), W 2 (Y)...
Suppose a database schedule $$S$$ involves transactions $${T_1},\,...,\,{T_n}.$$ Construct the precedence graph of $$S$$ with vertices representing the transactions and edges repre...
Consider the transactions T1, T2, and T3 and the schedules S1 and S2 given below. T1 : r1 (X) ; r1 (Z) ; w1 (X) ; w1 (Z) T2 : r2 (X) ; r2 (Z) ; w2 (Z) T3 : r3 (X) ; r3 (X) ; w3 (Y)...
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by r(x) and w(x) respectively. Which one...
Consider the following transactions with data items P and Q initialized to zero: T 1 : read (P) ; read (Q) ; if P = 0 then Q : = Q + 1 ; write (Q). T 2 : read (Q) ; read (P) if Q =...
Consider two transactions T 1 and T 2 and four schedules S 1 , S 2 , S 3 , S 4 of T 1 and T 2 as given below: T 1 : R 1 [ x ] W 1 [ x ] W 1 [ y ] T 2 : R 2 [ x ] R 2 [ y ] W 2 [ y...
Consider the following three schedules of transactions T 1 , T 2 and T 3 . [ Notation: In the following NYO represents the action Y (R for read, W for write) performed by transact...
Consider the following schedules involving two transactions. Which one of the following statements is TRUE? S 1 : r 1 (X); r 1 (Y); r 2 (Y); r 2 (X); w 2 (Y); w 1 (X); S 2 : r 1 (X...
The concurrent programming constructs fork and join are as below: Fork (label) which creates a new process executing from the specified label join (variable) which decrements the s...