Traditional locking mechanism is fit for the concurrency controlling and data consistency maintenance undercentralized architecture, but its response is slow, so it can not be used as concurrency controlling strategy ...Traditional locking mechanism is fit for the concurrency controlling and data consistency maintenance undercentralized architecture, but its response is slow, so it can not be used as concurrency controlling strategy for real-time distributed cooperative editing system. Moreover, operation transformation and data consistency maintenancetechnology are able to assure of quick response and unconstraint, but can't solve the context-specific inconsistencyproblems. Enlightened by the idea of operation transformation and optimistic locking mechanism, we bring forwardthe concurrency control algorithm of optimistic locking based on relative position. In this algorithm, the start positionof locking region and the position of operation are relative, and they are not transformed into absolute position untiloperations are sent to cooperative sites. Furthermore, any coeditor can edit in advance before his/her locking is con-firmed. If his/her locking is successful, the previous operations go into effect, or else undo these previous operations.We have analyzed the actual applications and can find that the possibility of undoing the previous editing operationsbecause of locking conflict is very little. So this concurrency controlling algorithm has virtues of quick response, nicedata consistency maintenance etc.展开更多
文摘Traditional locking mechanism is fit for the concurrency controlling and data consistency maintenance undercentralized architecture, but its response is slow, so it can not be used as concurrency controlling strategy for real-time distributed cooperative editing system. Moreover, operation transformation and data consistency maintenancetechnology are able to assure of quick response and unconstraint, but can't solve the context-specific inconsistencyproblems. Enlightened by the idea of operation transformation and optimistic locking mechanism, we bring forwardthe concurrency control algorithm of optimistic locking based on relative position. In this algorithm, the start positionof locking region and the position of operation are relative, and they are not transformed into absolute position untiloperations are sent to cooperative sites. Furthermore, any coeditor can edit in advance before his/her locking is con-firmed. If his/her locking is successful, the previous operations go into effect, or else undo these previous operations.We have analyzed the actual applications and can find that the possibility of undoing the previous editing operationsbecause of locking conflict is very little. So this concurrency controlling algorithm has virtues of quick response, nicedata consistency maintenance etc.
