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

Compare three clustering algorithms in weka, Compare three clustering algor...

Compare three clustering algorithms in Weka. For this comparison, you will need to use at least two different datasets. Run the algorithms on the datasets, and use the visual

Special comparison operator used in where clause-dml, Special comparison op...

Special comparison operator used in where Clause a.   between. ...and...It gives range among two values (inclusive) Example: SELECT ENAME, SAL FROM EMP WHERE SAL BETWE

What are multiple inheritances, What are multiple inheritances? Multipl...

What are multiple inheritances? Multiple inheritances allow a class to inherit variables and methods from many super classes.

Create a database for their customers, The ABC Bank authority now wants to ...

The ABC Bank authority now wants to create a database for their customers. So you are requested to modify your program of Assignment A3 as follows. The main program first displa

Define database management system, Normal 0 false false fal...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Explain the aggregation implies concurrency, Explain the Aggregation implie...

Explain the Aggregation implies concurrency Concurrency actually is: This in objects can be identified by the way they change state. Present objects can change state independen

What is data storage, What is Data Storage? The storage structures and ...

What is Data Storage? The storage structures and access methods used by database system are specified by a set of explanation in a special type of DDL called data storage-defin

E-r model uses this symbol to represent weak entity set, E-R model uses thi...

E-R model uses this symbol to represent weak entity set ? A Doubly outlined rectangle symbol is used to represent weak entity set.

Naïve bayesian approach-id3 algorithm, You are working for the ABC Telecom ...

You are working for the ABC Telecom and are given some customer records for data mining. You are asked to discover, from the data, patterns that characterize low-, medium- and high

Define boyce codd normal form, Define Boyce codd normal form A relation...

Define Boyce codd normal form A relation schema R is in BCNF with respect to a set F of functional dependencies if, for all functional dependencies in F + of the form.α ->β.

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