Reducing transaction abort rate of epidemic algorithm in replicated databases

Authors:
Huaizhong Lin;Zengwei Zheng;Chun Chen
Affiliations:
College of Computer Science, Zhejiang University, Hangzhou, China;College of Computer Science, Zhejiang University, Hangzhou, China;College of Computer Science, Zhejiang University, Hangzhou, China
Venue:
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
Year:
2005

Citing 9
Cited 0

The dangers of replication and a solution

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Epidemic algorithms in replicated databases (extended abstract)

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Flexible update propagation for weakly consistent replication

Proceedings of the sixteenth ACM symposium on Operating systems principles
Replication, consistency, and practicality: are these mutually exclusive?

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Decentralized replicated-object protocols

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Optimistic voting for managing replicated data

Journal of Computer Science and Technology
Replicated Data Management for Transactions Sharing in Distributed Database

HPC '00 Proceedings of the The Fourth International Conference on High-Performance Computing in the Asia-Pacific Region-Volume 2 - Volume 2
Support for Speculative Update Propagation and Mobility in Deno

ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Epidemic Information Dissemination in Distributed Systems

Computer

Quantified Score

Hi-index	0.00

Visualization

Abstract

Easy to deploy, robust, and highly resilient to failures, epidemic algorithms are a potentially effective mechanism for propagating information in large peer-to-peer systems deployed on Internet or ad hoc networks. In the paper, we explore the epidemic algorithms used for transaction processing in replicated databases that reside in weakly connected environments. We concentrate on the transaction commit voting process of the epidemic algorithms and suggest a new voting method, which takes an optimistic approach in conflict reconciliation. The optimistic voting protocol decreases abort rate and improves average response time of transactions.