The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
71 views

in Databases by Active (4.7k points) | 71 views
0
it is not conflict serilizable.
0

Because there is cycle formed Right ?

Is below solution is right . I think it is wrong . Plz cross check it .

+1
yes, it is not correct.
0
What is a Way to know the view Serializability ?
0
@hem chandra If schedule is conflict serializable then surely view serializable.

If not conflict serializable then you've to check who reads first who writes last and if there is any blind write or not.

And then make polygraph according to order of who reads first and who wrote last. If no cycle in polygraph as well then it will be view serializable.

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,408 questions
53,593 answers
185,824 comments
70,874 users