{"title":"A landmark-based transformation approach to concurrency control in group editors","authors":"Rui Li, Du Li","doi":"10.1145/1099203.1099252","DOIUrl":null,"url":null,"abstract":"Operational transformation (OT) is a responsive and nonblocking concurrency control method widely-accepted in group editors. Correctness and performance are the basis of usefulness and usability of OT-based group editors. However, the correctness of previous OT algorithms depends on conditions that are very difficult to verify. In this paper we propose a novel landmark-based transformation (LBT) approach, its correctness no longer depending on those conditions and thus easy to prove. In addition, we give an example algorithm that significantly outperforms a state-of-the-art OT algorithm. This work reveals a more practical approach to developing OT algorithms.","PeriodicalId":179423,"journal":{"name":"Proceedings of the 2005 ACM International Conference on Supporting Group Work","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"35","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2005 ACM International Conference on Supporting Group Work","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1099203.1099252","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 35
Abstract
Operational transformation (OT) is a responsive and nonblocking concurrency control method widely-accepted in group editors. Correctness and performance are the basis of usefulness and usability of OT-based group editors. However, the correctness of previous OT algorithms depends on conditions that are very difficult to verify. In this paper we propose a novel landmark-based transformation (LBT) approach, its correctness no longer depending on those conditions and thus easy to prove. In addition, we give an example algorithm that significantly outperforms a state-of-the-art OT algorithm. This work reveals a more practical approach to developing OT algorithms.