Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
The Database State Machine Approach
Distributed and Parallel Databases
Solving Agreement Problems with Weak Ordering Oracles
EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
Total Order Multicast to Multiple Groups
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Using Broadcast Primitives in Replicated Databases
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
A Suite of Database Replication Protocols based on Group Communication Primitives
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Transactions on Partially Replicated Data based on Reliable and Atomic Multicasts
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Partial Replication in the Database State Machine
NCA '01 Proceedings of the IEEE International Symposium on Network Computing and Applications (NCA'01)
Early consensus in an asynchronous system with a weak failure detector
Distributed Computing
SIPRe: a partial database replication protocol with SI replicas
Proceedings of the 2008 ACM symposium on Applied computing
A formal analysis of the deferred update technique
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Database replication: a tutorial
Replication
Formal development of byzantine immune total order broadcast system using event-b
ICDEM'10 Proceedings of the Second international conference on Data Engineering and Management
MoSQL: an elastic storage engine for MySQL
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Hi-index | 0.00 |
In this paper, we study the problem of partial database replication. Numerous previous works have investigated database replication, however, most of them focus on full replication. We are here interested in genuine partial replication protocols, which require replicas to permanently store only information about data items they replicate. We define two properties to characterize partial replication. The first one, Quasi-Genuine Partial Replication, captures the above idea; the second one, Non-Trivial Certification, rules out solutions that would abort transactions unnecessarily in an attempt to ensure the first property. We also present two algorithms that extend the Database State Machine [8] to partial replication and guarantee the two aforementioned properties. Our algorithms compare favorably to existing solutions both in terms of number of messages and communication steps.