{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T14:30:11Z","timestamp":1648909811418},"reference-count":12,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,10,1]],"date-time":"1999-10-01T00:00:00Z","timestamp":938736000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1999,10]]},"DOI":"10.1016\/s0020-0255(99)00024-9","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:32:24Z","timestamp":1049722344000},"page":"107-123","source":"Crossref","is-referenced-by-count":1,"title":["Minimal cost replicated file system with an availability constraint"],"prefix":"10.1016","volume":"119","author":[{"given":"Her-Kun","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shyan-Ming","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0255(99)00024-9_BIB1","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1109\/32.16608","article-title":"Performance characterization of quorum consensus algorithms for replicated data","volume":"15","author":"Ahamad","year":"1989","journal-title":"IEEE Trans. Soft. Eng."},{"key":"10.1016\/S0020-0255(99)00024-9_BIB2","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1109\/TR.1984.5221843","article-title":"Computing k-out-of-n system reliability","volume":"33","author":"Barlow","year":"1984","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/S0020-0255(99)00024-9_BIB3","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1145\/356842.356846","article-title":"Concurrency control in distributed database systems","volume":"13","author":"Bernstein","year":"1981","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/S0020-0255(99)00024-9_BIB4","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0022-0000(85)90058-3","article-title":"Serializability theory for replicated databases","volume":"31","author":"Bernstein","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0255(99)00024-9_BIB5","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/5505.5508","article-title":"Consistency in partitioned networks","volume":"17","author":"Davidson","year":"1985","journal-title":"ACM Comput. surveys"},{"key":"10.1016\/S0020-0255(99)00024-9_BIB6","doi-asserted-by":"crossref","unstructured":"D.K. Gifford, Weighted voting for replicated data, in: Proceedings of 7th Symposium on Operating System Principles, ACM SIGOPS, 1979, pp. 150\u2013162","DOI":"10.1145\/800215.806583"},{"key":"10.1016\/S0020-0255(99)00024-9_BIB7","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1109\/24.106783","article-title":"Voting mechanisms in distributed systems","volume":"40","author":"Kumar","year":"1991","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/S0020-0255(99)00024-9_BIB8","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1145\/151284.151287","article-title":"Cost and availability tradeoffs in replicated data concurrency control","volume":"18","author":"Kumar","year":"1993","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/S0020-0255(99)00024-9_BIB9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1145\/234313.234368","article-title":"Distributed and parallel database systems","volume":"28","author":"Ozsu","year":"1996","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/S0020-0255(99)00024-9_BIB10","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1016\/0026-2714(86)90239-8","article-title":"Utilization of symmetric switching functions in the computation of k-out-of-n system reliability","volume":"26","author":"Rushdi","year":"1986","journal-title":"Microelectronics and Reliability"},{"key":"10.1016\/S0020-0255(99)00024-9_BIB11","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1109\/24.31113","article-title":"An efficient non-recursive algorithm for computing the reliability of k-out-of-n systems","volume":"38","author":"Sarje","year":"1989","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/S0020-0255(99)00024-9_BIB12","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1145\/320071.320076","article-title":"A majority consensus approach to concurrency control for multiple copy databases","volume":"4","author":"Thomas","year":"1979","journal-title":"ACM Trans. Database Systems"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025599000249?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025599000249?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T06:26:34Z","timestamp":1556259994000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025599000249"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,10]]},"references-count":12,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,10]]}},"alternative-id":["S0020025599000249"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0255(99)00024-9","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1999,10]]}}}