What is the precedence graph associated to S? Is the schedule S conflict-serializable? If so, describe all the conflict-equivalent serial schedules.

INSTRUCTIONS TO CANDIDATES

ANSWER ALL QUESTIONS

1. Consider the following schedule S of actions, and answer these questions:

S: r2(A), r3(B), w1(A), r2(C), r2(D), w1(D)

1. Is the schedule S view-serializable? If so, provide a view-equivalent serial schedule
2. What is the precedence graph associated to S? Is the schedule S conflict-serializable?If so, describe all the conflict-equivalent serial schedules.
3. Is the schedule S a 2PL schedule (with exclusive locks)?

 

2. Consider the following two transactions: T1: r1(x), r1(y), w1(y)

T2: r2(y), r2(x), w2(y), w2(x), r2(z)

Following are the two possible serial schedules for T1 and T2:

Schedule_1 (T1 followed by T2):r1(x), r1(y), w1(y), r2(y), r2(x), w2(y), w2(x), r2(z)

Schedule_2 (T2 followed by T1): r2(y), r2(x), w2(y), w2(x), r2(z), r1(x), r1(y), w1(y)

1. Give the conflicting pairs for schedule_1 and indicate the transaction order of these conflicting

2. Will the outcome of each transaction be different for each of the above two schedules?

3. Consider the following schedule S for T1 and T2:

S: r1(x), r2(y), r1(y), r2(x), w2(y), w2(x), r2(z), w1(y)

 

1. What are the conflicting pairs in the schedule?

2. Will this schedule produce the same outcome in the transactions as one of the serial schedules?

3. Consider the following schedule

S: r1(x), w2(x), r3(x), r1(y), r4(z), w2(y), r1(v), w3(v), r4(v), w4(y), w5(y), w5(z)

And tell whether

1. it is a view-serializable schedule or not,

2. it is a conflict-serializable schedule or not

3. it is a 2PL schedule (with shared and exclusive locks)

Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of