{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:39:07Z","timestamp":1750307947032,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T00:00:00Z","timestamp":1186876800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,8,12]]},"DOI":"10.1145\/1281100.1281137","type":"proceedings-article","created":{"date-parts":[[2011,8,3]],"date-time":"2011-08-03T23:36:52Z","timestamp":1312414612000},"page":"254-263","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Optimal inter-object correlation when replicating for availability"],"prefix":"10.1145","author":[{"given":"Haifeng","family":"Yu","sequence":"first","affiliation":[{"name":"National University of Singapore"}]},{"given":"Phillip B.","family":"Gibbons","sequence":"additional","affiliation":[{"name":"Intel Research Pittsburgh"}]}],"member":"320","published-online":{"date-parts":[[2007,8,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060289.1060291"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"Alon N.","year":"2000","unstructured":"N. Alon and J. H. Spencer . The Probabilistic Method . John Wiley & amp; Sons, 2000 . N. Alon and J. H. Spencer. The Probabilistic Method. John Wiley & Sons, 2000."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/339331.339345"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502054"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/645958.676110"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945450"},{"key":"e_1_3_2_1_7_1","volume-title":"Decentralized Storage Despite Massive Correlated Failures. In USENIX NSDI","author":"Haeberlen A.","year":"2005","unstructured":"A. Haeberlen , A. Mislove , and P. Druschel . Glacier: Highly Durable , Decentralized Storage Despite Massive Correlated Failures. In USENIX NSDI , 2005 . A. Haeberlen, A. Mislove, and P. Druschel. Glacier: Highly Durable, Decentralized Storage Despite Massive Correlated Failures. In USENIX NSDI, 2005."},{"key":"e_1_3_2_1_8_1","volume-title":"USENIX FAST","author":"Huston L.","year":"2004","unstructured":"L. Huston , R. Sukthankar , R. Wickremesinghe , M. Satyanarayanan , G. Ganger , E. Riedel , and A. Ailamaki . Diamond: A Storage Architecture for Early Discard in Interactive Search . In USENIX FAST , 2004 . L. Huston, R. Sukthankar, R. Wickremesinghe, M. Satyanarayanan, G. Ganger, E. Riedel, and A. Ailamaki. Diamond: A Storage Architecture for Early Discard in Interactive Search. In USENIX FAST, 2004."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240010209"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4%3C467::AID-RSA15%3E3.0.CO;2-W"},{"key":"e_1_3_2_1_11_1","volume-title":"Random Graphs'87 (M. Karo'nski and J. Jaworski and A. Ruci'nski","author":"Janson S.","year":"1990","unstructured":"S. Janson , T. Luczak , and A. Rucinski . An Exponential Bound for the Probability of Nonexistence of a Specified Subgraph in a Random Graph . In Random Graphs'87 (M. Karo'nski and J. Jaworski and A. Ruci'nski , Eds.). John Wiley & amp; Sons, 1990 . S. Janson, T. Luczak, and A. Rucinski. An Exponential Bound for the Probability of Nonexistence of a Specified Subgraph in a Random Graph. In Random Graphs'87 (M. Karo'nski and J. Jaworski and A. Ruci'nski, Eds.). John Wiley & Sons, 1990."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258660"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/146941.146942"},{"key":"e_1_3_2_1_14_1","volume-title":"The Art of Computer Programming","author":"Knuth D. E.","year":"1997","unstructured":"D. E. Knuth . The Art of Computer Programming , Volume 1 . Addison Wesley , 1997 . D. E. Knuth. The Art of Computer Programming, Volume 1. Addison Wesley, 1997."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/378993.379239"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383072"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1024591915518"},{"key":"e_1_3_2_1_18_1","volume-title":"Distributed Object Location and Routing for Large-scale Peer-to-peer Systems. In ACM Middleware","author":"Rowstron A.","year":"2001","unstructured":"A. Rowstron and P. Druschel . Pastry: Scalable , Distributed Object Location and Routing for Large-scale Peer-to-peer Systems. In ACM Middleware , 2001 . A. Rowstron and P. Druschel. Pastry: Scalable, Distributed Object Location and Routing for Large-scale Peer-to-peer Systems. In ACM Middleware, 2001."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/339331.339352"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383071"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240010210"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335439"},{"key":"e_1_3_2_1_23_1","unstructured":"TPC Benchmark. http:\/\/www.tpc.org\/.  TPC Benchmark. http:\/\/www.tpc.org\/."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"},{"key":"e_1_3_2_1_25_1","volume-title":"USENIX OSDI","author":"van Renesse R.","year":"2004","unstructured":"R. van Renesse and F. B. Schneider . Chain Replication for Supporting High Throughput and Availability . In USENIX OSDI , 2004 . R. van Renesse and F. B. Schneider. Chain Replication for Supporting High Throughput and Availability. In USENIX OSDI, 2004."},{"key":"e_1_3_2_1_26_1","volume-title":"USENIX NSDI","author":"Yu H.","year":"2006","unstructured":"H. Yu , P. B. Gibbons , and S. Nath . Availability of Multi-Object Operations . In USENIX NSDI , 2006 . H. Yu, P. B. Gibbons, and S. Nath. Availability of Multi-Object Operations. In USENIX NSDI, 2006."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571839"}],"event":{"name":"PODC07: ACM Symposium on Principles of Distributed Computing 2007","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Portland Oregon USA","acronym":"PODC07"},"container-title":["Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1281100.1281137","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1281100.1281137","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:52:32Z","timestamp":1750258352000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1281100.1281137"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,12]]},"references-count":27,"alternative-id":["10.1145\/1281100.1281137","10.1145\/1281100"],"URL":"https:\/\/doi.org\/10.1145\/1281100.1281137","relation":{},"subject":[],"published":{"date-parts":[[2007,8,12]]},"assertion":[{"value":"2007-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}