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 is the purpose of storage manager, What is the purpose of storage mana...

What is the purpose of storage manager? The storage manager is responsible for the following a) Interaction with the file manager b) Translation of DML commands in to low

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

Compare the two log based recovery schemes, Compare the two log-based recov...

Compare the two log-based recovery schemes in terms of ease of implementation and overhead cost.    Ans:  There are two types of log based recovery techniques: deferred update

Accessing information permissions users, Accessing information about permis...

Accessing information about permissions to all users- Object level permissions: With the use of data dictionary you can see the permissions to user. Let us get the table name fro

Relational DB, Suppose R is a relation with attributes A1, A2,..., An. As a...

Suppose R is a relation with attributes A1, A2,..., An. As a function of n, tell how many superkeys R has, if: 1.1 The only key is A1. 1.2 The only key is A1 and A2. 1.3 The o

Determine the un-normalized form, Un-Normalized Form (UNF) If a table h...

Un-Normalized Form (UNF) If a table having non-atomic values at every row, it is said to be in UNF. An atomic value is something that cannot be further decomposed. A non-atomic

Logical entity relationship diagrams, How can i turn a conceptual entity re...

How can i turn a conceptual entity relationship diagram into a logical entity relationship diagram? what do i have to do with "mandetory or" and "optional or" relationships?

Define dba database administrator, Define DBA database administrator? ...

Define DBA database administrator? DBA : A database administrator (DBA) is a person who is responsible for the environmental aspects of a database. In common, these involves:

Normalization assigment, what would go in order patient#, patient name, pat...

what would go in order patient#, patient name, patien address, surgeon#, surgeon name, surgery date, surgery type, drug admin

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