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
A Relation Schema represented by R(A1, A2, ..., An) is made up of the relation name the list of attributes and R Ai that it contains. A relation is described as a set of tuples

2NF Normal Form : A relation schema process R is in 2NF if it is in 1NF and each non-prime attribute A in R is fully functionally related on primary key. Second normal form (2N

What is key ? Key - A single attribute or a combination of two or more attributes of an entity set which is used to recognize one or more instances (rows) of the set (table) is

Horizontal Fragmentation- Horizontal fragmentation groups together the tuples in a relation that are collectively used by the main transactions. A horizontal fragment is produced b

I am doing research in this area, especially in sime join and join efficacy when several relations have been queried. Relations located in different sites. I need something like n

3NF Normal Form A relation schema R is in 3NF if it is in 2NF and for each FD X A either of the following is true X is a Super-key of R. A is a prime attribute of R

A relation has: Relational Schema Relation instance Relational Schema: A relational schema shows the relation's name, its attributes and the domain of every a

Physical Database Design Issues The database design includes the process of logical design with the use of E-R diagram, normalisation, etc., followed by the physical design.

How Relational Calculus is different from Relational Algebra? What do understand by TRC queries and DRC queries?  Ans: Relational calculus contain two calculi, the tuple relati