Abstract
Operational transformation (OT) is an established optimistic consistency control method in collaborative applications. This approach requires correct transformation functions. In general all OT algorithms only consider two character-based primitive operations and hardly two or three of them support string based two primitive operations, insert and delete. In this paper we have proposed a new algorithm MSITDD that consider transformation of two deletions and give right result in all possible cases satisfying user intentions and has removed the faults of previous ITDD[1]. In this paper a comparative study is done of the new proposed algorithm MSITDD with ITDD[1] taking an example and is proved that new proposed algorithm MSITDD is giving right output and ITDD[1] is giving wrong output. It also handles overlapping and splitting of operations when concurrent operations are transformed. These algorithms can be applied in a wide range of practical collaborative applications.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
