{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T16:19:26Z","timestamp":1648570766934},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,8,18]],"date-time":"2009-08-18T00:00:00Z","timestamp":1250553600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2009,12]]},"DOI":"10.1007\/s10586-009-0097-8","type":"journal-article","created":{"date-parts":[[2009,8,17]],"date-time":"2009-08-17T12:54:11Z","timestamp":1250513651000},"page":"387-398","source":"Crossref","is-referenced-by-count":4,"title":["Cell approximation method in quorum systems for minimizing access time"],"prefix":"10.1007","volume":"12","author":[{"given":"Yong-Ju","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hag-Young","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheol-Hoon","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,8,18]]},"reference":[{"key":"97_CR1","volume-title":"Concurrency Control and Recovery in Database Systems","author":"P.A. Bernstain","year":"1987","unstructured":"Bernstain, P.A., Hadzilacos, V., Goodman, N.: Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading (1987)"},{"issue":"2","key":"97_CR2","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1145\/320071.320076","volume":"4","author":"R.H. Thomas","year":"1979","unstructured":"Thomas, R.H.: A majority consensus approach to concurrency control for multiple copy databases. ACM Trans. Database Syst. (TODS) 4(2), 180\u2013209 (1979)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"97_CR3","doi-asserted-by":"crossref","unstructured":"Gifford, D.K.: Weighted voting for replicated data. In: Proceedings of the 7th ACM Symposium on Operating Systems, New York, pp. 150\u2013162 (1979)","DOI":"10.1145\/800215.806583"},{"issue":"9","key":"97_CR4","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":"6","key":"97_CR5","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1109\/69.180609","volume":"4","author":"S.Y. Cheung","year":"1992","unstructured":"Cheung, S.Y., Ammar, M.H., Ahamad, M.: The grid protocol: a\u00a0high performance scheme for maintaining replicated data. IEEE Trans. Knowl. Data Eng. 4(6), 582\u2013592 (1992)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"97_CR6","unstructured":"Erdos, P., Lovasz, L.: Problems and results on 3-chromatic hypergraphs and some related questions. Colloq. Math. Soc. Janos Bolyai 10, 609\u2013627"},{"key":"97_CR7","unstructured":"Agrawal, D., El Abbadi, A.: The tree quorum protocol: an efficient approach for managing replicated data. In: Proceedings of the Sixteenth International Conference on Very Large Databases, 1990"},{"key":"97_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/103727.103728","volume":"9","author":"D. Agrawal","year":"1991","unstructured":"Agrawal, D., El Abbadi, A.: An efficient and fault-tolerance solution for distributed mutual exclusion. ACM Trans. Comput. Syst. 9, 1\u201320 (1991)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"1","key":"97_CR9","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1109\/71.569655","volume":"8","author":"A.W. Fu","year":"1997","unstructured":"Fu, A.W.: Delay-optimal quorum consensus for distributed systems. IEEE Trans. Parallel Distrib. Syst. 8(1), 59\u201369 (1997)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"97_CR10","unstructured":"Gilbert, S., Malewicz, G.: The quorum deployment problem. In: 8th International Conference on Principles of Distributed Systems (OPODIS\u201904), 2004"},{"key":"97_CR11","doi-asserted-by":"crossref","unstructured":"Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: an approach to universal topology generation. In: Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS\u201901), p.\u00a0346, August 15\u201318, 2001","DOI":"10.1109\/MASCOT.2001.948886"},{"key":"97_CR12","unstructured":"Hartigan, J.A., Wong, M.A.: (1979). A k-means clustering algorithm. Appl. Stat. 28"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-009-0097-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-009-0097-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-009-0097-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T14:40:11Z","timestamp":1559227211000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-009-0097-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,18]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["97"],"URL":"https:\/\/doi.org\/10.1007\/s10586-009-0097-8","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,18]]}}}