Linear commit protocol, Database Management System

With the linear commit protocol, sites are connected in a chain, and the subtransaction at the left-hand end of the chain initiates the protocol. Propose a crash recovery protocol for a site in the chain. Consider the following three points at which the crash might occur and state in each case (1) how the site determines from its log that it is at that point and (2) what action it takes (beyond standard recovery processing)

(a)  The site crashes before the first message from its left-hand neighbor arrives.

(b)  The site crashes after sending the first message to its neighbor on the right, but before receiving a message from its neighbor on the right.

(c)  The site crashes after sending a message to its neighbor on the left but before receiving the second message from its neighbor on the left.


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

Related Discussions:- Linear commit protocol, Assignment Help, Ask Question on Linear commit protocol, Get Answer, Expert's Help, Linear commit protocol Discussions

Write discussion on Linear commit protocol
Your posts are moderated
Related Questions
Write an sql statement to find what is the percentage of home policies which are from the state of Arizona out of all Home policies by Policy Value.

Durability : This property necessitates that once a transaction has committed, the changes made by it be never lost because of subsequent failure. Thus, a transaction is also a bas

Describe the term- State Diagram State Diagram: An object could receive a sequence of the input instructions. The state of the object can differ depending upon sequence of in

Define the notation for classes and atrributes The notation for class, attribute, and operations are shown below:     Figure: Class with attributes and operations A

Question: (a) What is ODBC and what is its function? (b) What is Web application server, and how does it work from a database perspective? (c) What does e-commerce mean

Consider a database schema consisting of four relations, whose schemas are: Product (maker, model, type) PC (model, speed, ram, hd, price) Laptop (model, speed, ram, hd, s

UNION If R1 and R2 are two union compatible relations then R3 = R1 ∪ R2 is the relation having tuples that are either in R1 or in R2 or in both. In case, R3 will have tuples

How can Redundant Associations be done It can be done by asking questions: i)  Is there a specific arrangement of network which would optimize critical aspects of completed

Question 1 Discuss about second normal form and third normal form Question 2 Write short note on                        1) Data Manipulation Language 2) Data Definition La

Consider the 1ollowin8 relation: CAR SALE (Car_id, Option_type, Option_listprice, Sale_date, Option_discountedprice) This relation refers to options installed in cars (e.g., crui