{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:38:30Z","timestamp":1750307910321,"version":"3.41.0"},"reference-count":7,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2007,4,1]],"date-time":"2007-04-01T00:00:00Z","timestamp":1175385600000},"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":["SIGOPS Oper. Syst. Rev."],"published-print":{"date-parts":[[2007,4]]},"abstract":"<jats:p>This paper describes an enhanced replica synchronization mechanism built in Microsoft's WinFS replica management system.<\/jats:p>\n          <jats:p>The system reconciles autonomously-operating replicas in a completely peer-to-peer manner, without employing a central master or locking. The main challenge is for two replicas to exchange meta-information efficiently about (potentially numerous) data objects in order to discover what updates they are missing, and detect conflicts.<\/jats:p>\n          <jats:p>The paper introduces a novel bundling mechanisms called VS, that groups together multiple objects and represents their state in a single version-vector. VS provides improved storage and communication overheads over previously known optimistic replication schemes, in the following sense. Under normal, low-fault situations, it maintains and communicates as little as a single version vector in order to represent precedence ordering of the entire set of data objects. Moreover, under settings of severe communication disruptions, VS degenerates to no worse than a single vector per object. This dramatically improves the complexities described in a preliminary write-up of the WinFS replication scheme.<\/jats:p>\n          <jats:p>The VS mechanism has potentially wide applicability as a mechanism for compactly handling synchronization of arbitrarily overlapping groups of objects.<\/jats:p>","DOI":"10.1145\/1243418.1243427","type":"journal-article","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T14:37:16Z","timestamp":1181140636000},"page":"68-74","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["P2P replica synchronization with vector sets"],"prefix":"10.1145","volume":"41","author":[{"given":"Dahlia","family":"Malkhi","sequence":"first","affiliation":[{"name":"Microsoft Research, Silicon Valley"}]},{"given":"Lev","family":"Novik","sequence":"additional","affiliation":[{"name":"Microsoft Corporation"}]},{"given":"Chris","family":"Purcell","sequence":"additional","affiliation":[{"name":"Cambridge University"}]}],"member":"320","published-online":{"date-parts":[[2007,4]]},"reference":[{"issue":"3","key":"e_1_2_1_1_1","first-page":"240","volume":"9","author":"Jr D. S.","year":"1983","journal-title":"Detection of mutual inconsistency in distributed systems. IEEE Transactions on Software Engineering"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/284482.284488"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/146941.146942"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561927_25"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"D. H. Ratner. Roam: A Scalable Replication System for Mobile and Distributed Computing. PhD thesis 1998. UCLA Technical report UCLA-CSD-970044.   D. H. Ratner. Roam: A Scalable Replication System for Mobile and Distributed Computing . PhD thesis 1998. UCLA Technical report UCLA-CSD-970044.","DOI":"10.1109\/DEXA.1999.795151"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/224056.224070"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/800217.806615"}],"container-title":["ACM SIGOPS Operating Systems Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1243418.1243427","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1243418.1243427","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:49Z","timestamp":1750258069000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1243418.1243427"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,4]]}},"alternative-id":["10.1145\/1243418.1243427"],"URL":"https:\/\/doi.org\/10.1145\/1243418.1243427","relation":{},"ISSN":["0163-5980"],"issn-type":[{"type":"print","value":"0163-5980"}],"subject":[],"published":{"date-parts":[[2007,4]]},"assertion":[{"value":"2007-04-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}