Transaction states, Database Management System

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 updates only the replicas at A before it commits (it needed to access no other site since replication is total).

(b)  After the transaction commits, a second transaction is initiated to update the primary copies of all items updated at A.

(c)  After the transaction in step (b) has completed, each primary site propagates the update made at that site to all secondaries (including the one at site A). Updates made to a primary copy by several transactions are propagated to secondaries in the order in which the primary was updated.

Explain why, in step (b), all primaries must be updated in a single transaction and, in step (c), the update is propagated to site A.

 

Posted Date: 3/11/2013 1:18:10 AM | Location : United States







Related Discussions:- Transaction states, Assignment Help, Ask Question on Transaction states, Get Answer, Expert's Help, Transaction states Discussions

Write discussion on Transaction states
Your posts are moderated
Related Questions
In this practical assignment, we will run through a complete database application development cycle, starting with the schema design, from an initial data import to database applic

Types Of Indexes One of the words used during the file organisation is the term index. In this part, let us describe this term in more detail. We find the index of keywords

Explain mechanism of nested queries? SQL gives a mechanism for nesting subqueries. A subquery is a select from where expression that is nested within one more query. A common u

Domain Constraint It shows that each attribute in a relation has to contain an atomic value only from the corresponding domains. The data types associated with commercial RDBMS

List the types of authorization. A) Read authorization B) Write authorization C) Update authorization D) Drop authorization

How does Oracle act as ODBC and give examples of front end uses with ODBC? ODBC achieve portability at the level of the executable by introducing an extra level of indirection.

Explain pipelining.        Ans: In order to describe pipelining in simple terms, think of it as breaking down processor functions into smaller and smaller parts. For instance,

Describe the algorithm to draw the dependency graph?   Ans: Algorithm to draw Precedence Graph is like this: a.  For every transaction T i participating in schedule S, make

Complexity : A distributed DBMS that is available, reliable, and secure is inherently more difficult than a centralised DBMS. Though, adequate data replication is essential to have

A set of possible data values is called? A set of possible data values is called as domain.