1. Homepage
  2. Homework
  3. 351/751 Database Systems Lab 07: Transactions, Deadlocks and Crash Recovery
This question has been solved

351/751 Database Systems Lab 07: Transactions, Deadlocks and Crash Recovery

Engage in a Conversation
SOFTENG 351COMPSCI 751COMPSCI 351Fundamentals of Database SystemsNew ZealandUniversity of Auckland

351/751 Database Systems , 202 3, Semester 1 Lab 07 CourseNana.COM

This Lab has an attendance component of (3 marks) CourseNana.COM

  1. Transactions, Phenomena. Say for each of the following schedules: does the schedul e contain phenomena or any other violation of the locking rules of the common scheduler? If not, give an explanation why not. If yes, say on which data object the phenomenon occurs; describe the phenomenon. State the highest isolation level that the schedule can be performed on.

(a) s1 : r1[x], r2[y], r3[y], w1[x], w3[y], c3, r2[x], c2, c1 (1 mark) CourseNana.COM

(b) s2 : r1[x], r2[y], r3[y], w1[x], w3[y], c3, r2[y], c2, c1 (1 mark) CourseNana.COM

(c) s3 : r1[x], r2[y], r3[y], w1[x], w3[y], c3, w2[y], c2, c1 (1 mark) CourseNana.COM

(d) r1[x], r2[y], r1[y], r3[y], r2[x], r3[x], w1[x], c3 , c1, w2[y], c2 (1 mark) CourseNana.COM

  1. Transactions, Deadlocks. Consider the following set s of transactions. Can the set of transactions run into a deadlock if we use the common scheduler? If yes, give a scheduling diagram showing the deadlock, if no say why not.

(a) (2 marks) CourseNana.COM

TA1: w1[k], r1[x] TA2: r2[z], r2[x] TA3: r3[x], w3[z] CourseNana.COM

(b) (2 marks) CourseNana.COM

TA1: r1[k], r1[x], w1[x] TA2: r2[z], r2[x], w2[z ], w2[x] TA3: r3[x], r3[z] CourseNana.COM

  1. Crash recovery for steal, no -force policy: The following list gives pages, objects on these pages and their values in the stable database at a certain point in time:

Page 1: x = 62 y = 43 Page 2: z = 46 k = 12 CourseNana.COM

The following is the list of the most recent stable log records at the same point in time. The database uses the steal, no -force policy. CourseNana.COM

[nr: 321, ta: 62, obj: x, b: 31, a: 62] [nr: 324, ta: 62, obj: k, b: 12, a: 58] [nr: 322, ta: 63, obj: y, b: 34, a: 43] [nr: 323, ta: 62, obj: x, b: 62, a: 54] [nr: 325, ta: 62, commit] [nr: 327, ta: 64, obj: z, b: 46, a: 89] [nr: 328, ta: 64, obj: k, b: 58, a: 91] CourseNana.COM

a) You are supposed to perform crash recovery. What operations do you have to perform on which transactions ? Give the content of the stable database after the crash recovery. (1 marks) CourseNana.COM

b) Was a database buffer page with an uncommitted write written to the stable database? If yes, say which page and identify the time interval when it was written to the stable database. Give the interval as two log sequence numbers before and after, and say how you came to that conclusion. If no, give reasons for your answer. (3 marks) CourseNana.COM

Get in Touch with Our Experts

Wechat WeChat
Whatsapp Whatsapp
SOFTENG 351代写,COMPSCI 751代写,COMPSCI 351代写,Fundamentals of Database Systems代写,New Zealand代写,University of Auckland代写,SOFTENG 351代编,COMPSCI 751代编,COMPSCI 351代编,Fundamentals of Database Systems代编,New Zealand代编,University of Auckland代编,SOFTENG 351代考,COMPSCI 751代考,COMPSCI 351代考,Fundamentals of Database Systems代考,New Zealand代考,University of Auckland代考,SOFTENG 351help,COMPSCI 751help,COMPSCI 351help,Fundamentals of Database Systemshelp,New Zealandhelp,University of Aucklandhelp,SOFTENG 351作业代写,COMPSCI 751作业代写,COMPSCI 351作业代写,Fundamentals of Database Systems作业代写,New Zealand作业代写,University of Auckland作业代写,SOFTENG 351编程代写,COMPSCI 751编程代写,COMPSCI 351编程代写,Fundamentals of Database Systems编程代写,New Zealand编程代写,University of Auckland编程代写,SOFTENG 351programming help,COMPSCI 751programming help,COMPSCI 351programming help,Fundamentals of Database Systemsprogramming help,New Zealandprogramming help,University of Aucklandprogramming help,SOFTENG 351assignment help,COMPSCI 751assignment help,COMPSCI 351assignment help,Fundamentals of Database Systemsassignment help,New Zealandassignment help,University of Aucklandassignment help,SOFTENG 351solution,COMPSCI 751solution,COMPSCI 351solution,Fundamentals of Database Systemssolution,New Zealandsolution,University of Aucklandsolution,