Scribd
Upload
265 views1 page

Assignment-1: " Every Conflict Serializable Schedule Is View Serializable But Reverse Is Not True"

The document discusses concepts of schedule serializability in database systems. It defines conflicting and non-conflicting instructions and asks to determine if a given schedule is conflict serializable, providing the equivalent serial schedule if so. It also asks to justify that every conflict serializable schedule is view serializable but not vice versa, and to define view serializability and determine if another schedule is view serializable with its equivalent serial schedule.

Uploaded by

Mahi On D Rockzz
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
265 views1 page

Assignment-1: " Every Conflict Serializable Schedule Is View Serializable But Reverse Is Not True"

The document discusses concepts of schedule serializability in database systems. It defines conflicting and non-conflicting instructions and asks to determine if a given schedule is conflict serializable, providing the equivalent serial schedule if so. It also asks to justify that every conflict serializable schedule is view serializable but not vice versa, and to define view serializability and determine if another schedule is view serializable with its equivalent serial schedule.

Uploaded by

Mahi On D Rockzz
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Assignment-1

Q1 : Explain the concept of conflict serializibility. Define Conflicting instructions and Non Conflicting instructions. Q2 : Determine Whether the following schedule is conflict serializable? If conflict serializable , then determine the equivalent serial schedule. T1 Read(A) Write(A) Read(B) Write(B) Read(A) Write(B) Read(B) Write(B) T2

Q3: Justify the Statement given below by taking an example. Every conflict serializable schedule is view serializable but reverse is not true. Q4: Define view serializibilty . Determine whether the following schedule is view serializable ? If Yes, then determine the equivalent serial schedule.

T1 Write(A)

T2

T3

Read(A) Write(B)

Read(B) Write(A) Write(B)

You might also like