Abstract
Database replication protocols based on group communication have recently received a lot of attention. The main reason for this stems from the fact that group communication primitives offer adequate properties, namely agreement on the messages delivered and on their order, to implement synchronous database replication. Most of the complexity involved in synchronizing database replicas is handled by the group communication layer. Previous work on group-communication-based database replication has focused mainly on full replication. However, full replication might not always be adequate. First, sites might not have enough disk or memory resources to fully replicate the database. Second, when access locality is observed, full replication is pointless. Third, full replication provides limited scalability since every update transaction should be executed by each replica.
The work presented in this paper has been partially funded by the Hasler Foundation, Switzerland (project #1899) and SNSF, Switzerland (project #200021-107824).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Bernstein, P.A., Hadzilacos, V., Goodman, N.: Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading (1987)
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)
Pedone, F., Guerraoui, R., Schiper, A.: The database state machine approach. Journal of Distributed and Parallel Databases and Technology 14(1), 71–98 (2003)
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)
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). Brief Announcement: Optimistic Algorithms for Partial Database Replication. In: Dolev, S. (eds) Distributed Computing. DISC 2006. Lecture Notes in Computer Science, vol 4167. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11864219_44
Download citation
DOI: https://doi.org/10.1007/11864219_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44624-8
Online ISBN: 978-3-540-44627-9
eBook Packages: Computer ScienceComputer Science (R0)