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

What do you understand by a view, What do you understand by a view? What do...

What do you understand by a view? What does WITH CHECK OPTION clause for a view do? - A view is a virtual table which comprises fields from one or more real tables. - It is

Create an index for the table client, Create an index for the table Client,...

Create an index for the table Client, field CLIENT_NO of Q ? Command:   CREATE INDEX client_client_no ON client(client_no);

What is a recursive relationship, What is a recursive relationship? Give an...

What is a recursive relationship? Give an example not used in the text. A recursive relationship is a relationship among an entity and itself. For example, given the entity PER

Data models, why older data models are being replaced by new data models....

why older data models are being replaced by new data models.

View of data, how to submit answers softcopy

how to submit answers softcopy

Name the metrics for selecting top algorithm, Name the metrics for selectin...

Name the metrics for selecting top algorithm There are a number of metrics for selecting top algorithm: i) Computational complexity: Computational complexity refers to eff

Explain alternate key, Explain Alternate key? Alternate Key - All the...

Explain Alternate key? Alternate Key - All the candidate keys except primary key are known as alternate keys.

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

Describe participation constraints, Describe Participation Constraints? ...

Describe Participation Constraints? Participation Constraints - The participation constraint exacts whether the existence of an entity depends on its being related to another

Explain the internal architecture of 8086, Problem 1. Write an assembly...

Problem 1. Write an assembly program to find the smallest among two numbers Writing an assembly program to find the smallest among two numbers 2. Explain the intern

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