{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T08:32:58Z","timestamp":1675153978684},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2008,11,11]],"date-time":"2008-11-11T00:00:00Z","timestamp":1226361600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,11,11]],"date-time":"2008-11-11T00:00:00Z","timestamp":1226361600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s00446-008-0072-2","type":"journal-article","created":{"date-parts":[[2008,11,10]],"date-time":"2008-11-10T11:38:18Z","timestamp":1226317098000},"page":"367-384","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Optimal inter-object correlation when replicating for availability"],"prefix":"10.1007","volume":"21","author":[{"given":"Haifeng","family":"Yu","sequence":"first","affiliation":[]},{"given":"Phillip B.","family":"Gibbons","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,11,11]]},"reference":[{"key":"72_CR1","doi-asserted-by":"crossref","unstructured":"Adya, A., Bolosky, W.J., Castro, M., Cermak, G., Chaiken, R., Douceur, J.R., Howell, J., Lorch, J.R., Theimer, M., Wattenhofer, R.P.: FARSITE: federated, available, and reliable storage for an incompletely trusted environment. In: USENIX OSDI (2002)","DOI":"10.1145\/1060289.1060291"},{"key":"72_CR2","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154","volume-title":"The probabilistic method","author":"N. Alon","year":"2000","unstructured":"Alon N., Spencer J.H.: The probabilistic method. Wiley, New York (2000)"},{"key":"72_CR3","doi-asserted-by":"crossref","unstructured":"Bolosky, W.J., Douceur, J.R., Ely, D., Theimer, M.: Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs. In: ACM SIGMETRICS (2000)","DOI":"10.1145\/339331.339345"},{"key":"72_CR4","doi-asserted-by":"crossref","unstructured":"Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with CFS. In: ACM SOSP (2001)","DOI":"10.1145\/502034.502054"},{"key":"72_CR5","doi-asserted-by":"crossref","unstructured":"Douceur, J.R., Wattenhofer, R.P.: Competitive hill-climbing strategies for replica placement in a distributed file system. In: DISC (2001)","DOI":"10.1007\/3-540-45414-4_4"},{"key":"72_CR6","doi-asserted-by":"crossref","unstructured":"Ghemawat, S., Gobioff, H., Leung, S.T.: The google file system. In: ACM SOSP (2003)","DOI":"10.1145\/945445.945450"},{"key":"72_CR7","unstructured":"Haeberlen, A., Mislove, A., Druschel, P.: Glacier: highly durable, decentralized storage despite massive correlated failures. In: USENIX NSDI (2005)"},{"key":"72_CR8","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/rsa.3240010209","volume":"1","author":"S. Janson","year":"1990","unstructured":"Janson S.: Poisson approximations for large deviations. Random Struct Algorithm 1, 221\u2013230 (1990)","journal-title":"Random Struct Algorithm"},{"key":"72_CR9","unstructured":"Janson, S., Luczak, T., Rucinski, A.: An exponential bound for the probability of nonexistence of a specified subgraph in a random graph. In: Karo\u2019nski, M., Jaworski, J., Ruci\u2019nski, A. (eds.) Random Graphs\u201987. Wiley, New York (1990)"},{"key":"72_CR10","doi-asserted-by":"crossref","unstructured":"Karger, D., Lehman, E., Leighton, T., Levine, M., Lewin, D., Panigrahy, R.: Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web. In: ACM STOC (1997)","DOI":"10.1145\/258533.258660"},{"issue":"1","key":"72_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/146941.146942","volume":"10","author":"J. Kistler","year":"1992","unstructured":"Kistler J., Satyanarayanan M.: Disconnected operation in the coda file system. ACM Trans. Comput. Syst. 10(1), 3\u201325 (1992)","journal-title":"ACM Trans. Comput. Syst."},{"key":"72_CR12","volume-title":"The Art of Computer Programming, vol 1","author":"D.E. Knuth","year":"1997","unstructured":"Knuth D.E.: The Art of Computer Programming, vol 1. Addison Wesley, Reading (1997)"},{"key":"72_CR13","unstructured":"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: ACM ASPLOS (2000)"},{"key":"72_CR14","doi-asserted-by":"crossref","unstructured":"Pang, J., Gibbons, P.B., Kaminsky, M., Seshan, S., Yu, H.: Defragmenting DHT-based distributed file systems. In: Proceedings of International Conference on Distributed Computing Systems (2007)","DOI":"10.1109\/ICDCS.2007.97"},{"key":"72_CR15","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: ACM SIGCOMM (2001)","DOI":"10.1145\/383059.383072"},{"key":"72_CR16","unstructured":"Ratnasamy, S., Karp, B., Shenker, S., Estrin, D., Govindan, R., Yin, L., Yu, F.: Data-centric storage in sensornets with GHT: a geographic hash table. Mobile Netw. Appl. 8(4), 427\u2013442 (2003)"},{"key":"72_CR17","unstructured":"van Renesse, R., Schneider, F.B.: Chain replication for supporting high throughput and availability. In: USENIX OSDI (2004)"},{"key":"72_CR18","doi-asserted-by":"crossref","unstructured":"Rowstron, A., Druschel, P.: Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems. In: ACM Middleware (2001)","DOI":"10.1007\/3-540-45518-3_18"},{"key":"72_CR19","doi-asserted-by":"crossref","unstructured":"Santos, J., Muntz, R., Ribeiro-Neto, B.: Comparing random data allocation and data striping in multimedia serviers. In: ACM SIGMETRICS (2000)","DOI":"10.1145\/339331.339352"},{"key":"72_CR20","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. In: ACM SIGCOMM (2001)","DOI":"10.1145\/383059.383071"},{"key":"72_CR21","doi-asserted-by":"crossref","unstructured":"Szalay, A., Kunszt, P., Thakar, A., Gray, J., Slutz, D.: Designing and mining multi-terabyte astronomy archives: the sloan digital sky survey. In: ACM SIGMOD (2000)","DOI":"10.1145\/342009.335439"},{"key":"72_CR22","unstructured":"TPC Benchmark. http:\/\/www.tpc.org\/"},{"issue":"3","key":"72_CR23","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410\u2013421 (1979)","journal-title":"SIAM J. Comput."},{"key":"72_CR24","unstructured":"Yu, H., Gibbons, P.B., Nath, S.: Availability of multi-object operations. In: USENIX NSDI (2006)"},{"key":"72_CR25","doi-asserted-by":"crossref","unstructured":"Yu, H., Vahdat, A.: Minimal replication cost for availability. In: ACM PODC (2002)","DOI":"10.1145\/571825.571839"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-008-0072-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-008-0072-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-008-0072-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-008-0072-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,8]],"date-time":"2021-03-08T20:07:32Z","timestamp":1615234052000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-008-0072-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,11]]},"references-count":25,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["72"],"URL":"https:\/\/doi.org\/10.1007\/s00446-008-0072-2","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,11]]},"assertion":[{"value":"23 August 2007","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2008","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2008","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}