Back to the 2025 paper
Similar questions
DATABASE MANAGEMENT SYSTEMSerializability of concurrent transaction is ensured by - (i) locking - (ii) time stamping - (iii) both (a) and (b) - (iv) none of these20232mDatabase Management SystemConsider the schedule: R1(X), R2(X), W1(X), W2(X). The schedule is: (i) View serializable only (ii) Conflict serializable (iii) Not serializable (iv) Recoverable20252mDATABASE MANAGEMENT SYSTEMShow that the two-phase locking protocol ensures conflict serializability and that transaction can be serialized according to their lock points.202114mDATABASE MANAGEMENT SYSTEMExplain two-phase locking protocol & conflict serializability. | Unit 3 – Transaction Management | Concurrency control.20247m
PreviousConsider a hash table of size 10 with the hash function h(k) = k \pmod{10}. Insert the keys 23, 43, 13, 27, 37, and 50 into the hash table. Construct the hash table using separate chaining for collision resolution and then reconstruct it using linear probing. Compare the final arrangements obtained using both methods.NextExplain two-phase locking protocol with an example.