New Consistency Control Algorithms based on Operational Transformation

Abstract

In distributed systems, groupware systems are multi user interactive computer based systems where users have great interaction for each other. Traditional consistency methods could not apply in groupware systems because they only considered system limited issues, serial applications and might not satisfy interaction results and user intention consistency. It is analysed that OT (Operational Transformation) is most desired standard solution for concurrency control, consistency maintenance and satisfies intentions of user. newlineOT made real time groupware tools by correct transformation functions without suffering local operations. Since last 25 years, a comparative study of 80 papers of OT algorithms presented, in which discussed various parameters. It highlighted the strengths and remaining challenges of existing OT algorithms. It was concluded that ABTS (AdmissibilityBased Transformation with Strings) was best string handling algorithm as had less time and space complexity and correctness could be proved. newlineMore work was required to reduce time complexity and space complexity of OT algorithms. Hardly few OT algorithms like GOT (Generic Operation Transformation), GOTO (GOT Optimized), and ABTS only supported insert/ delete basic string operations. So requirement rose for development of new OT algorithms which supported new composite string operations like Cut-Paste and these algorithms should be formally proved. ABTS Algorithm which was existing string operational transformation algorithm should be improved. newlineThe goal of the work was to acquire string based new Consistency Control Algorithms which were based on Operational Transformation for high quality consistency and concurrency control. newlineA data set has been created since data set was not available for the proposed algorithms and experts in this field have suggested the creation of the dataset. The authors of ABTS also created their own dataset. A dataset has been made covering all possible cases of input.