When are two schedules said to be view equivalent, Database Management System

Assignment Help:

When are two schedules said to be view equivalent?    

Ans: Two schedules that is denoted as S and S' are said to be view equivalent if the subsequent three conditions are met

1)  For every data item Q, if a transaction Ti reads the initial value of Q in schedule S, after that transaction Ti should in schedule S'  also read the initial value of Q.

2)  For every data item Q, if a transaction Ti executes read(Q)  in schedule S and that value was generated by Tj (if any) , then transaction Ti must in schedule S'  as well read the value of Q generated by Tj.

3)  For every data item Q, if a transaction if any that carries out the final write(Q) in schedule S should perform the final write(Q) in schedule S'.


Related Discussions:- When are two schedules said to be view equivalent

Illustrate system design of an object oriented approach, System Design: An ...

System Design: An Object Oriented Approach Any software systems always try to change and evolve as technology and business rules evolve. The development of information systems

Reflects organisational structure, Reflects organisational structure: Many ...

Reflects organisational structure: Many organizations are distributed over various locations. If an organisation has many offices in dissimilar cities, databases used in such an ap

Construct a generalization-specialization hierarchy, Construct a generaliza...

Construct a generalization-specialization hierarchy for a motor-vehicle sales company. The company sells motorcycles that comprise an engine number and cost; cars that have a chass

Give the reasons for allowing concurrency, Give the reasons for allowing co...

Give the reasons for allowing concurrency? The reasons for allowing concurrency is if the transactions run serially, a short transaction might have to wait for a preceding long

Write short notes on transaction state, Write short notes on transaction st...

Write short notes on transaction state? A transaction may not always complete its implementation successfully such a transaction is termed aborted A transaction must be in o

MANAGEMWNT OF PRINCILES AND TECHNIQUES., HOW TO SOLVE THE LP Problems by si...

HOW TO SOLVE THE LP Problems by simplex method?z=x1+-3x2+2x3

Distributed query and transaction processing, Distributed query and transac...

Distributed query and transaction processing a.  Construct a query around any one of the functional divisions you made in 4a such that if executed in the distributed design of 4

What is oracle process explain for processes of oracle, What is Oracle Proc...

What is Oracle Process? Explain any four processes started by Oracle. Oracle Process is as follows: SMON: The System Monitor carries out a crash recovery while a crashed in

Describe about use case and external case in dfd, Describe about Use Case a...

Describe about Use Case and external case in DFD The processes are transformed those into the Use Case and external case in DFD has same characteristics which of an actor in O

Define deadlock avoidance, Define Deadlock avoidance These protocols a...

Define Deadlock avoidance These protocols as well ensure that the system will never enter a deadlock state although the way it is done is different from deadlock prevention. I

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd