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

Transaction states, The following variant of the primary copy asynchronous-...

The following variant of the primary copy asynchronous-update replication protocol has been proposed for totally replicated systems. (a)  A transaction executing at site A updat

Define data independence, Data independence seems that "the application is...

Data independence seems that "the application is independent of the access strategy and storage structure of data". In other words, the ability to change the schema definition in o

State about the use case diagram, State about the Use Case Diagram A u...

State about the Use Case Diagram A use case diagram represents a set of use cases, actors and their relationships. These diagrams shall be used to model context or requirement

Define union compatibility, Define union compatibility? Explain why INTERSE...

Define union compatibility? Explain why INTERSECTION of two relations cannot be performed if they are not union compatible? Two relations R(A1, A2,-------, An) and S(B1, B2,--

Discuss the method for a hash file to expand shrink dynamic, Discuss the me...

Discuss the methods for a hash file to expand and shrink dynamically. What are the advantages and disadvantages of each? The hashing methods that permit dyanamic file expansi

How is concurrency identified, How is concurrency identified? Concurren...

How is concurrency identified? Concurrency in objects can be identified by the way they alter their state. Current objects can change their state independently. Aggregation imp

Define average seek time, Define average seek time. The average seek ti...

Define average seek time. The average seek time is the average of the seek times, calculated over a sequence of random requests.

What are temporary tables, What are temporary tables? Temporary tables...

What are temporary tables? Temporary tables exist solely for a particular session or whose data persists for the duration of the transaction.

Participation constraints, The participation Constraints shows whether the ...

The participation Constraints shows whether the existence of an entity depends on its being associated to another entity by the relationship type. There are two kinds of participat

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