Skip to main content

Quorum Systems

  • Reference work entry
Book cover Encyclopedia of Database Systems
  • 113 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Agrawal D. and Abbadi A.E. The Generalized Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data. ACM Trans. Database Syst., 17(4):689ā€“717, 1992.

    Google ScholarĀ 

  2. Amir Y. and Wool A. Optimal Availability Quorums Systems: Theory and Practice. Inf. Proc. Letters, 65(5):223ā€“228, 1998.

    MathSciNetĀ  Google ScholarĀ 

  3. Barbara D. and Garcia-Molina H. The reliability of vote mechanisms. IEEE. Trans. Comput., 36:1197ā€“1208, 1987.

    MathSciNetĀ  Google ScholarĀ 

  4. Bernstein P.A., Hadzilacos V., and Goodman N. Concurrency Control and Recovery in Database Systems. Addison Wesley, 1987.

    Google ScholarĀ 

  5. Cheung S.Y., Ahamad M., and Ammar M.H. The grid protocol: a high performance scheme for maintaining replicated data. In Proc. 6th Int. Conf. on Data Engineering, 1990, pp. 438ā€“445.

    Google ScholarĀ 

  6. Gifford D.K. Weighted Voting for Replicated Data. In Proc. 7th ACM Symp. on Operating System Principles, 1979, pp. 150ā€“162.

    Google ScholarĀ 

  7. JimĆ©nez-Peris R., PatiƱo-MartĆ­nez M., Alonso G., and Kemme B. Are Quorums an Alternative for Data Replication. ACM Trans. Database Syst., 28(3):257ā€“294, 2003.

    Google ScholarĀ 

  8. Kumar A. Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data. IEEE Trans. Comput., 40(9):996ā€“1004, 1991.

    Google ScholarĀ 

  9. Maekawa M. A Algorithm for Mutual Exclusion in Decentralized Systems. ACM Trans. Computer Syst., 3(2):145ā€“159, 1985.

    Google ScholarĀ 

  10. Malkhi D., Reiter M.K., and Wool A. The Load and Availability of Byzantine Quorum Systems. SIAM J. Comput., 29(6):1889ā€“1906, 2000.

    MATHĀ  MathSciNetĀ  Google ScholarĀ 

  11. Naor M. and Wool A. The Load, Capacity, and Availability of Quorum Systems. SIAM J. Comput., 27(2):423ā€“447, 1998.

    MATHĀ  MathSciNetĀ  Google ScholarĀ 

  12. Peleg D. and Wool A. The Availability of Quorum Systems. Information and Computation, 123(2):210ā€“223, 1995.

    Google ScholarĀ 

  13. Thomas R.H. A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases. ACM Trans. Database Syst. , 4(9):180ā€“209, 1979.

    Google ScholarĀ 

  14. Tong Z. and Kain R.Y. Vote Assignments in Weighted Voting Mechanisms. In Proc. 7th Symp. on Reliable Distributed Syst., 1988, pp. 138ā€“143.

    Google ScholarĀ 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

Ā© 2009 Springer Science+Business Media, LLC

About this entry

Cite this entry

PatiƱo-Martinez, M. (2009). Quorum Systems. In: LIU, L., ƖZSU, M.T. (eds) Encyclopedia of Database Systems. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-39940-9_299

Download citation

Publish with us

Policies and ethics