Tree-Based Dynamic Primary Copy Algorithms for Replicated Databases

Authors:
Pradhan Bagur Umesh;A. R. Bharath Kumar;V. S. Ananthanarayana
Affiliations:
Department of Information Technology, National Institute of Technology Karnataka, Surathkal, Mangalore, India;Department of Information Technology, National Institute of Technology Karnataka, Surathkal, Mangalore, India;Department of Information Technology, National Institute of Technology Karnataka, Surathkal, Mangalore, India
Venue:
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Year:
2009

Citing 7
Cited 0

A tree-based algorithm for distributed mutual exclusion

ACM Transactions on Computer Systems (TOCS)
Replication, consistency, and practicality: are these mutually exclusive?

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
A Competitive Dynamic Data Replication Algorithm

Proceedings of the Ninth International Conference on Data Engineering
A Fault Tolerant Protocol As an Extension to a Distributed Mutual Exclusion Algorithm

ICPADS '97 Proceedings of the 1997 International Conference on Parallel and Distributed Systems
Comparison of UDDI Registry Replication Strategies

ICWS '04 Proceedings of the IEEE International Conference on Web Services
Dynamic primary copy with piggy-backing mechanism for replicated UDDI registry

ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

With increasing demand for performance, availability and fault tolerance in databases, data replication is gaining more and more importance. Resolving or serializing conflicting update requests is the main challenge in large scale deployment of replicated databases. In this paper, we propose the first token based dynamic primary copy algorithms for resolving conflicting requests among different sites of replicated databases. The contribution being reduction in the number of messages required per update request.