Fault-Tolerant Partial Replication in Large-Scale Database Systems

  • Pierre Sutra
  • Marc Shapiro
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5168)


We investigate a decentralised approach to committing transactions in a replicated database, under partial replication. Previous protocols either reexecute transactions entirely and/or compute a total order of transactions. In contrast, ours applies update values, and generate a partial order between mutually conflicting transactions only. Transactions execute faster, and distributed databases commit in small committees. Both effects contribute to preserve scalability as the number of databases and transactions increase. Our algorithm ensures serializability, and is live and safe in spite of faults.


Data Item Total Order Precedence Constraint Read Operation Message Complexity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Alonso, G.: Partial database replication and group communication primitives in 2nd European Research Seminar on Advances in Distributed Systems (1997)Google Scholar
  2. 2.
    Bernstein, P.A., Hadzilacos, V., Goodman, N.: Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading (1987), Google Scholar
  3. 3.
    Busca, J.-M., Picconi, F., Sens, P.: Pastis: A highly-scalable multi-user peer-to-peer file system. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol. 3648. Springer, Heidelberg (2005)Google Scholar
  4. 4.
    Camargos, L., Pedone, F., Wieloch, M.: Sprint: a middleware for high-performance transaction processing. SIGOPS Oper. Syst. Rev. (2007)Google Scholar
  5. 5.
    Defago, X., Schiper, A., Urban, P.: Totally ordered broadcast and multicast algorithms: a comprehensive survey (2000)Google Scholar
  6. 6.
    Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)Google Scholar
  7. 7.
    Gray, J., Helland, P., O’Neil, P., Shasha, D.: The dangers of replication and a solution. In: Proceedings of the 1996 ACM SIGMOD international conference on Management of data (1996)Google Scholar
  8. 8.
    Haller, K., Schuldt, H., Türker, C.: Decentralized coordination of transactional processes in peer-to-peer environments. In: CIKM 2005: Proceedings of the 14th ACM international conference on Information and knowledge management (2005)Google Scholar
  9. 9.
    Holliday, J., Agrawal, D., Abbadi, A.E.: Partial database replication using epidemic communication. In: ICDCS 2002: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS 2002), Washington, DC, USA, p. 485. IEEE Computer Society, Los Alamitos (2002)CrossRefGoogle Scholar
  10. 10.
    Fritzke Jr., U., Ingels, P.: Transactions on partially replicated data based on reliable and atomic multicasts. In: Proceedings of the The 21st International Conference on Distributed Computing Systems, p. 284. IEEE Computer Society, Los Alamitos (2001)Google Scholar
  11. 11.
    Kemme, B., Alonso, G.: Don’t be lazy, be consistent: Postgres-r, a new way to implement database replication. The VLDB Journal, 134–143 (2000)Google Scholar
  12. 12.
    Kubiatowicz, J., Bindel, D., Chen, Y., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: Oceanstore: An architecture for global-scale persistent storage. In: Proceedings of ACM ASPLOS. ACM, New York (2000)Google Scholar
  13. 13.
    Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558–565 (1978)zbMATHCrossRefGoogle Scholar
  14. 14.
    Lamport, L.: Fast paxos. Distributed Computing 19(2), 79–103 (2006)CrossRefMathSciNetGoogle Scholar
  15. 15.
    Muthitacharoen, A., Morris, R., Gil, T.M., Chen, B.: Ivy: A read/write peer-to-peer file system. In: Proceedings of 5th Symposium on Operating Systems Design and Implementation (2002)Google Scholar
  16. 16.
    Pacitti, E., Coulon, C., Valduriez, P., Özsu, M.T.: Preventive replication in a database cluster. Distrib. Parallel Databases 18(3), 223–251 (2005)CrossRefGoogle Scholar
  17. 17.
    Pedone, F., Guerraoui, R., Schiper, A.: The database state machine approach. Distrib. Parallel Databases 14(1), 71–98 (2003)CrossRefGoogle Scholar
  18. 18.
    Raynal, M.: Eventual leader service in unreliable asynchronous systems: Why? how? In: NCA, pp. 11–24. IEEE Computer Society, Los Alamitos (2007)Google Scholar
  19. 19.
    Schiper, N., Schmidt, R., Pedone, F.: In: 10th International Conference on Principles of Distributed Systems (OPODIS 2006) (2006)Google Scholar
  20. 20.
    Shih, C.-S., Stankovic, J.A.: Survey of deadlock detection in distributed concurrent programming environments and its application to real-time systems. Technical report (1990)Google Scholar
  21. 21.
    Sousa, A., Pedone, F., Oliveira, R., Moura, F.: Partial replication in the database state machine (2001)Google Scholar
  22. 22.
    Sutra, P., Shapiro, M.: Fault-tolerant partial replication in large-scale database systems, Technical report,
  23. 23.
    Wiesmann, M., Schiper, A.: Comparison of database replication techniques based on total order broadcast. IEEE Transactions on Knowledge and Data Engineering 17(4) (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Pierre Sutra
    • 1
  • Marc Shapiro
    • 1
  1. 1.Université Paris VI and INRIA RocquencourtFrance

Personalised recommendations