Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Dynamic voting algorithms for maintaining the consistency of a replicated database
ACM Transactions on Database Systems (TODS)
The dangers of replication and a solution
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Perspectives on optimistically replicated, peer-to-peer filing
Software—Practice & Experience
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
DNS and BIND
Managing Usenet
Efficient Dynamic Voting Algorithms
Proceedings of the Fourth International Conference on Data Engineering
The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Decentralized weighted voting for P2P data management
Proceedings of the 3rd ACM international workshop on Data engineering for wireless and mobile access
Relaxed currency and consistency: how to say "good enough" in SQL
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
ACM Computing Surveys (CSUR)
Indexing data-oriented overlay networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Replication strategies for highly available peer-to-peer storage
Future directions in distributed computing
Self-star Properties in Complex Information Systems
Proceedings of the VLDB Endowment
Dynamic hybrid replication effectively combining tree and grid topology
The Journal of Supercomputing
| Hi-index | 0.00 |
Data replication is a central technique to increase availability and performance of distributed systems. While offering many advantages it also requires more effort for ensuring data consistency in case of updates. In the research literature various approaches for replication management in distributed databases have been presented, but they are mostly limited either in scalability or in the consistency guarantees they provide. On the other hand, P2P systems usually provide replication support but ignore the update problem. In this paper we present a new approach for managing replicated data in wide area distributed networks. Our solution is orthogonal to the underlying infrastructure and managed in a decentralized manner. It guarantees single-master consistency and allows updates at any node of the system by combining traditional replication techniques with ideas known from P2P systems.