{"title":"基于变换的广域协作一致性控制算法","authors":"Bin Shao, Du Li, Ning Gu","doi":"10.4108/ICST.COLLABORATECOM2009.8271","DOIUrl":null,"url":null,"abstract":"Operational transformation (OT) is an established optimistic consistency control method in collaborative applications. Most existing OT algorithms are developed under a well-accepted framework with a condition that cannot be formally proved. In addition, they generally support two character-based primitive operations, insert and delete, in a linear data structure. This paper proposes a novel OT algorithm that addresses the above two challenges as follows: First, it is based on a recent theoretical framework with formal conditions such that its correctness can be proved. Secondly, it supports two string-based primitive operations and handles overlapping and splitting of operations. As a result, this algorithm can be applied in a wide range of practical collaborative applications.","PeriodicalId":232795,"journal":{"name":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":"{\"title\":\"ABTS: A transformation-based consistency control algorithm for wide-area collaborative applications\",\"authors\":\"Bin Shao, Du Li, Ning Gu\",\"doi\":\"10.4108/ICST.COLLABORATECOM2009.8271\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Operational transformation (OT) is an established optimistic consistency control method in collaborative applications. Most existing OT algorithms are developed under a well-accepted framework with a condition that cannot be formally proved. In addition, they generally support two character-based primitive operations, insert and delete, in a linear data structure. This paper proposes a novel OT algorithm that addresses the above two challenges as follows: First, it is based on a recent theoretical framework with formal conditions such that its correctness can be proved. Secondly, it supports two string-based primitive operations and handles overlapping and splitting of operations. As a result, this algorithm can be applied in a wide range of practical collaborative applications.\",\"PeriodicalId\":232795,\"journal\":{\"name\":\"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"20\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4108/ICST.COLLABORATECOM2009.8271\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4108/ICST.COLLABORATECOM2009.8271","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
ABTS: A transformation-based consistency control algorithm for wide-area collaborative applications
Operational transformation (OT) is an established optimistic consistency control method in collaborative applications. Most existing OT algorithms are developed under a well-accepted framework with a condition that cannot be formally proved. In addition, they generally support two character-based primitive operations, insert and delete, in a linear data structure. This paper proposes a novel OT algorithm that addresses the above two challenges as follows: First, it is based on a recent theoretical framework with formal conditions such that its correctness can be proved. Secondly, it supports two string-based primitive operations and handles overlapping and splitting of operations. As a result, this algorithm can be applied in a wide range of practical collaborative applications.