Abstract
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.
The work presented in this paper has been partially funded by the Hasler Foundation, Switzerland (project #1899) and SNSF, Switzerland (project #200021-107824).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bernstein, P.A., Hadzilacos, V., Goodman, N.: Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading (1987)
Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2), 225–267 (1996)
Gray, J., Lamport, L.: Consensus on transaction commit. Technical Report MSR-TR-2003-96, Microsoft Research (2004)
Guerraoui, R., Schiper, A.: Total order multicast to multiple groups. In: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS), Baltimore, USA, pp. 578–585 (May 1997)
Fritzke Jr., U., Ingels, P.: Transactions on partially replicated data based on reliable and atomic multicasts. In: Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS), pp. 284–291 (2001)
Kemme, B., Alonso, G.: A suite of database replication protocols based on group communication primitives. In: Proceedings of the 18th International Conference on Distributed Computing Systems (ICDCS), pp. 156–163 (1998)
Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21(7), 558–565 (1978)
Pedone, F., Guerraoui, R., Schiper, A.: The database state machine approach. Journal of Distributed and Parallel Databases and Technology 14(1), 71–98 (2003)
Pedone, F., Schiper, A., Urbán, P., Cavin, D.: Solving agreement problems with weak ordering oracles. In: Bondavalli, A., Thévenod-Fosse, P. (eds.) EDCC 2002. LNCS, vol. 2485, pp. 44–61. Springer, Heidelberg (2002)
Schiper, A.: Early consensus in an asynchronous system with a weak failure detector. Distributed Computing 10(3), 149–157 (1997)
Schiper, N., Schmidt, R., Pedone, F.: Optimistic algorithms for partial database replication. Technical Report 2006, University of Lugano (2006)
Sousa, A., Pedone, F., Oliveira, R., Moura, F.: Partial replication in the database state machine. In: Proceedings of the 1st International Symposium on Network Computing and Applications (NCA) (October 2001)
Stanoi, I., Agrawal, D., Abbadi, A.E.: Using broadcast primitives in replicated databases. In: Proceedings of the 18th International Conference on Distributed Computing Systems (ICDCS), pp. 148–155 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schiper, N., Schmidt, R., Pedone, F. (2006). Optimistic Algorithms for Partial Database Replication . In: Shvartsman, M.M.A.A. (eds) Principles of Distributed Systems. OPODIS 2006. Lecture Notes in Computer Science, vol 4305. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11945529_7
Download citation
DOI: https://doi.org/10.1007/11945529_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49990-9
Online ISBN: 978-3-540-49991-6
eBook Packages: Computer ScienceComputer Science (R0)