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 our earlier paper [1] we have proposed new algorithms that consider first time in history new string operations that are update for atomic string operations in addition to primitive operations like insert and delete. In this paper we have proposed new algorithms LocalU and RemoteU for handling local and remote update operations of strings for both atomic and sequential operations. These algorithms first time in history are handling sequential update string operations. These algorithms satisfy correctness criteria like causality preservation and admissibility preservation. These algorithms are for sequential update operations but have synchronization with existing primitive operations like insert and delete also. 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.