Incorporating Transaction Semantics to Reduce Reprocessing Overhead in Replicated Mobile Data Applications

Update anywhere-anytime-anyway transactional replication has unstable behavior as the workload scales up. To reduce this problem, a two-tier replication algorithm is proposed in [GHOS96] that allows mobile applications to propose tentative transactions that are later applied to a master copy. However, it can suffer from heavy reprocessing overhead in many circumstances. In this paper, we present the method of merging histories instead of reprocessing to reduce the overhead of two-tier replication. The basic idea is when a mobile node connects to the base nodes merging the tentative history into the base history so that substantial work of tentative transactions could be saved. As a result, a set of undesirable transactions (denoted ) have to be backed out to resolve the conflicts between the two histories. Desirable transactions that are affected, directly or indirectly, by the transactions in complicate the process of backing out . We present a family of novel rewriting algorithms fo...

• Type: Conference
• Year: 1999
• Where: ICDCS
• Authors: Peng Liu, Paul Ammann, Sushil Jajodia
• Keywords: Desirable Tentative Transactions, Distributed And Parallel Computing, ICDCS 1999, Tentative Transactions, Two-tier Replication