Consider a failure that occurs during 2PC for a transaction. For each possible failure that you listed in Exercise 19.6a, explain how 2PC ensures transaction atomicity despite the failure.
Answer to relevant QuestionsConsider a distributed system with two sites, A and B. Can site A distinguish among the following?• B goes down.• The link between A and B goes down.• B is extremely overloaded and response time is 100 times longer ...Give an example where lazy replication can lead to an inconsistent database state even when updates get an exclusive lock on the primary (master) copy. Given that the LDAP functionality can be implemented on top of a database system, what is the need for the LDAP standard?Consider join processing using symmetric fragment and replicate with range partitioning how can you optimize the evaluation if the join condition is of the form | r.A − s.B| ≤ k, where k is a small constant. ...What is the motivation for splitting a long transaction into a series of small ones? What problems could arise as a result, and how can these problems be averted?
Post your question