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

Design of distributed databases, Design Of Distributed Databases: The dist...

Design Of Distributed Databases: The distributed databases are mainly relational at local level. So a local database schema is the similar as that of a centralised database design

Which steps must designer take to adjust inheritance, In object oriented de...

In object oriented design, which steps must designer take to adjust inheritance? To readjust inheritance following steps should be taken: i)  Rearrange and adjust the classe

Query processor in database management system, Query Processor The qu...

Query Processor The query language processor is responsible for taking query language statements or shifting them from the English-like syntax of the query language to a form

Explain dynamic two-phase locking, Explain Dynamic Two-Phase Locking H...

Explain Dynamic Two-Phase Locking Here a transaction locks a data item instantly earlier than any operation is applied on the data item.  After finishing all the operations on

Benefits abd drawback of hashed file organisation, Benefits of Hashed file ...

Benefits of Hashed file Organisation 1.      Insertion or search on hash-key is quick. 2.      Best if equality search is required on hash-key. Drawbacks of Hashed file

Which component is not included in database environment, Which component is...

Which component is not included in database environment ? A users component is not included in database environment.

Write query to insert data in student table, Consider student (std_id, std_...

Consider student (std_id, std_name, date_of_birth, phone, dept_name). Put the data for a student with student id200, name arun, birth date 1 February, 1985, phone number (01110 328

Note gate, i want notes on this topic

i want notes on this topic

Index and tree structure, Index And Tree Structure Let us talk about th...

Index And Tree Structure Let us talk about the data structure that is used for creating indexes. Can we use Binary Search Tree (BST) as Indexes? Let us initial reconsider

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