{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T12:20:30Z","timestamp":1756383630422,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":14,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387355443"},{"type":"electronic","value":"9780387399409"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-0-387-39940-9_299","type":"book-chapter","created":{"date-parts":[[2009,9,16]],"date-time":"2009-09-16T08:08:45Z","timestamp":1253088525000},"page":"2317-2317","source":"Crossref","is-referenced-by-count":1,"title":["Quorum Systems"],"prefix":"10.1007","author":[{"given":"Marta","family":"Pati\u00f1o-Martinez","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"299_CR1_299","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1145\/146931.146935","volume":"17","author":"D. Agrawal","year":"1992","unstructured":"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\u2013717, 1992.","journal-title":"ACM Trans. Database Syst."},{"issue":"5","key":"299_CR2_299","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0020-0190(98)00017-9","volume":"65","author":"Y. Amir","year":"1998","unstructured":"Amir Y. and Wool A. Optimal Availability Quorums Systems: Theory and Practice. Inf. Proc. Letters, 65(5):223\u2013228, 1998.","journal-title":"Inf. Proc. Letters"},{"key":"299_CR3_299","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1109\/TC.1987.1676860","volume":"36","author":"D. Barbara","year":"1987","unstructured":"Barbara D. and Garcia-Molina H. The reliability of vote mechanisms. IEEE. Trans. Comput., 36:1197\u20131208, 1987.","journal-title":"IEEE. Trans. Comput."},{"key":"299_CR4_299","unstructured":"Bernstein P.A., Hadzilacos V., and Goodman N. Concurrency Control and Recovery in Database Systems. Addison Wesley, 1987."},{"key":"299_CR5_299","doi-asserted-by":"crossref","unstructured":"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\u2013445.","DOI":"10.1109\/ICDE.1990.113497"},{"key":"299_CR6_299","doi-asserted-by":"crossref","unstructured":"Gifford D.K. Weighted Voting for Replicated Data. In Proc. 7th ACM Symp. on Operating System Principles, 1979, pp. 150\u2013162.","DOI":"10.1145\/800215.806583"},{"key":"299_CR7_299","doi-asserted-by":"crossref","unstructured":"Jim\u00e9nez-Peris R., Pati\u00f1o-Mart\u00ednez M., Alonso G., and Kemme B. Are Quorums an Alternative for Data Replication. ACM Trans. Database Syst., 28(3):257\u2013294, 2003.","DOI":"10.1145\/937598.937601"},{"issue":"9","key":"299_CR8_299","doi-asserted-by":"crossref","first-page":"996","DOI":"10.1109\/12.83661","volume":"40","author":"A. Kumar","year":"1991","unstructured":"Kumar A. Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data. IEEE Trans. Comput., 40(9):996\u20131004, 1991.","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"299_CR9_299","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/214438.214445","volume":"3","author":"M. Maekawa","year":"1985","unstructured":"Maekawa M. A Algorithm for Mutual Exclusion in Decentralized Systems. ACM Trans. Computer Syst., 3(2):145\u2013159, 1985.","journal-title":"ACM Trans. Computer Syst."},{"issue":"6","key":"299_CR10_299","doi-asserted-by":"crossref","first-page":"1889","DOI":"10.1137\/S0097539797325235","volume":"29","author":"D. Malkhi","year":"2000","unstructured":"Malkhi D., Reiter M.K., and Wool A. The Load and Availability of Byzantine Quorum Systems. SIAM J. Comput., 29(6):1889\u20131906, 2000.","journal-title":"SIAM J. Comput."},{"issue":"2","key":"299_CR11_299","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/S0097539795281232","volume":"27","author":"M. Naor","year":"1998","unstructured":"Naor M. and Wool A. The Load, Capacity, and Availability of Quorum Systems. SIAM J. Comput., 27(2):423\u2013447, 1998.","journal-title":"SIAM J. Comput."},{"key":"299_CR12_299","doi-asserted-by":"crossref","unstructured":"Peleg D. and Wool A. The Availability of Quorum Systems. Information and Computation, 123(2):210\u2013223, 1995.","DOI":"10.1006\/inco.1995.1169"},{"key":"299_CR13_299","doi-asserted-by":"crossref","unstructured":"Thomas R.H. A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases. ACM Trans. Database Syst. , 4(9):180\u2013209, 1979.","DOI":"10.1145\/320071.320076"},{"key":"299_CR14_299","unstructured":"Tong Z. and Kain R.Y. Vote Assignments in Weighted Voting Mechanisms. In Proc. 7th Symp. on Reliable Distributed Syst., 1988, pp. 138\u2013143."}],"container-title":["Encyclopedia of Database Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-39940-9_299","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T05:26:01Z","timestamp":1739337961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-39940-9_299"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9780387355443","9780387399409"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-39940-9_299","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}