Undo as concurrent inverse in group editors
ACM Transactions on Computer-Human Interaction (TOCHI)
Flexible notification for collaborative systems
CSCW '02 Proceedings of the 2002 ACM conference on Computer supported cooperative work
Flexible Merging for Asynchronous Collaborative Systems
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
Using the transformational approach to build a safe and generic data synchronizer
GROUP '03 Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work
A Complete Textual Merging Algorithm for Software Configuration Management Systems
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
An Operational Transformation Algorithm and Performance Evaluation
Computer Supported Cooperative Work
Journal of Computer and System Sciences
| Hi-index | 0.00 |
Version control systems are widely used to support distributed concurrent software development, where document merging is a key function. Most existing systems adoptstate-based merging, which relies on the derivation of deltas among documents. The derivation of deltas involves transferring documents over the network and executing time-consuming text differentiation algorithms, which may result in a poor system response. Operation-based merging saves executed operations in logs as deltas, thus eliminating theneed for deriving deltas. However, for the operation-based merging to be adopted in version control systems, a major technical challenge is how to keep the size of logs small so that it requires less time to transfer the log over the network and to re-execute operations in the log. In this paper, we contribute a novel compression algorithm, which is able to minimize the size of a log as well as the number of operations within it. It has been proven both correct and complete in the sense that the compressed log has the same effect as the original one and operations that can be merged have already been merged.