TY - GEN
T1 - Incorporating transaction semantics to reduce reprocessing overhead in replicated mobile data applications
AU - Liu, Peng
AU - Ammann, Paul
AU - Jajodia, Sushil
PY - 1999
Y1 - 1999
N2 - 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 B) 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 B complicate the process of backing out B. We present a family of novel rewriting algorithms for the purpose of backing out B. By incorporating transaction semantics, our rewriting methods are strictly better at saving desirable tentative transactions than the traditional reads-from transitive-closure based approach. And in most cases our rewriting methods are better at saving desirable tentative transactions than an approach which is based only on commutativity.
AB - 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 B) 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 B complicate the process of backing out B. We present a family of novel rewriting algorithms for the purpose of backing out B. By incorporating transaction semantics, our rewriting methods are strictly better at saving desirable tentative transactions than the traditional reads-from transitive-closure based approach. And in most cases our rewriting methods are better at saving desirable tentative transactions than an approach which is based only on commutativity.
UR - http://www.scopus.com/inward/record.url?scp=0032684749&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0032684749&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0032684749
SN - 0769502229
T3 - Proceedings - International Conference on Distributed Computing Systems
SP - 414
EP - 423
BT - Proceedings - International Conference on Distributed Computing Systems
PB - IEEE
T2 - Proceedings of the 1999 19th IEEE International Conference on Distributed Computing Systems (ICDCS'99)
Y2 - 31 May 1999 through 4 June 1999
ER -