CN100568184C - The locking method of data collision module in the collaborative editing - Google Patents
The locking method of data collision module in the collaborative editing Download PDFInfo
- Publication number
- CN100568184C CN100568184C CNB2007100510080A CN200710051008A CN100568184C CN 100568184 C CN100568184 C CN 100568184C CN B2007100510080 A CNB2007100510080 A CN B2007100510080A CN 200710051008 A CN200710051008 A CN 200710051008A CN 100568184 C CN100568184 C CN 100568184C
- Authority
- CN
- China
- Prior art keywords
- node
- lock
- editing
- chief editor
- locks
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Abstract
The invention discloses the locking method of data collision module in a kind of collaborative editing, each teamworker will obtain the approval of chief editor's node of own place group to the locking of oneself editing position range, each teamworker has and only has a lock, can carry out various editing operations arbitrarily in lock-in range; All preserved a group member's lock table at each node, when this locality adds latching operation and takes place, the lock table of scanning of home at first, see whether conflict, if having, then at first will be by the judgement of priority, afterwards, the judged result that locks is sent to chief editor's node, is arbitrated by chief editor's node; The present invention proposes the hommization locking method, not only can improve the efficient of collaborative editing, and can the flexible processing conflict; This locking method is easy to realize, has solved the disadvantage of primitive technology scheme, is with good expansibility; And a kind of resilient data collision solution is provided, can have satisfied many people distributed collaboration editor's collaborative demand.
Description
Technical field
The present invention relates to the collaborative editing locking method, especially relate to the locking method of data collision module in a kind of collaborative editing.
Background technology
Along with the generation of large-scale editor's demand and the continuous development of network technology, distributed collaborative editing system arises at the historic moment and has begun development at full speed.The collaborative editing system structure is divided into chief editor's volume node and the editor of association node.Chief editor's volume node is created session, association's editor's node participates in session, in conversation procedure, most important task is exactly under the prerequisite of guaranteed efficiency, find and solve many people to edit the conflict that may exist simultaneously, so just introduced the mechanism that edit object is locked, locking mechanisms mainly contains following several: traditional method that locks, tickle lock, floor control, reversible execution (Undo/Redo) and operation conversion etc.
Traditional the most outstanding advantage of the method that locks is that design and realization are comparatively simple, and it can guarantee concrete contextual semantic integrity, but it can't guarantee to add the consistance of lock position in the distributed collaboration editor.The tickle locking method is suitable for the concurrent control of the real-time distributed collaborative editing that merogenesis locks, yet, a plurality of editors can't be provided editor in saving the time.Collaborative editing among the JCE (Java Collaborative Envirment) has adopted the floor control method, and each cooperation editor has only the floor of acquisition just can carry out editing operation, is fit to the collaborative editing of discussion, is not suitable for real-time unconfined collaborative editing.But inverse operation (Undo, Redo) in the algorithm, operation can be carried out immediately, but the information relevant with operation will be retained, so that cancel this operation when being necessary. user's response performance of this method is good, but it needs the omnidistance sequential of defining operation, and this is quite difficult.The operation transfer algorithm can automatically manage conflict and need not manual intervention, and the excellent real-time response is arranged, and can keep convergence and safeguard wish, but it can not guarantee contextual semantic integrity.
The technology of locking is divided into optimistic lock technology and Pessimistic Locking technology.Optimistic lock anything, when affairs more during new record, affairs can be checked; look at after reading this record oneself last time; this record that whether other transactions modify arranged, if by other transactions modify, these affairs are understood rollback usually; again attempt then; more carry out the not high inspection of this cost new data the time, can avoid losing the modification of other data, and; have only when find revising conflict, cause that just affairs heavily come one time overhead.
The concurrent update inconsistency meeting of Pessimistic Locking mechanism hypothesis takes place, so no matter whether conflict really takes place, extra lock expense is introduced in the capital, but, this overhead is more much smaller than the overhead of isolating affairs fully, use the affairs of Pessimistic Locking can pin the record that reads, prevent that other affairs from reading and upgrade these records, other affairs can be blocked always, submission or rollback up to these affairs have discharged lock, Pessimistic Locking can prevent to revise to be lost, and the consistance that to a certain degree reads can be provided, because it can prevent record that these affairs read by other transactions modify, yet, because Pessimistic Locking does not prevent the increase of new record, thereby carries out same inquiry and may return different result sets.
Prior art related to the present invention:
The technical scheme of prior art one:
Chinese patent, application number is 200510049259.6, denomination of invention is " based on the semantic keeping method in the collaborative design of semantic lock realization pattern ", the shortcoming of this technical scheme: mainly pay attention to semantic locking, it is the processing of among tradition locks mode, having added semanteme, but the mode of locking is not carried out the improvement of essence, thereby can't avoid exclusive resource or content of edit by the problem of rollback, simultaneously, the word processing aspect that is applied in based on semanteme has certain effect, but transplantability is poor, can't be widely used in various collaborative editing systems.
The technical scheme of prior art two
Chinese patent, application number is 200510049260.9, denomination of invention is " method of the maintaining semantics consistency in the pattern collaborative design ", this technical scheme shortcoming: mainly pay attention to avoiding of semantic conflict, under the situation of not using locking mechanisms, from evading of conflicting in semantic aspect.Do not lock owing to introduce, make this scheme can't adapt to other application demand, transplantability is poor; Simultaneously, in the processing procedure of conflict, can't reach the effect of having used locking mechanisms, therefore, this scheme also can't be widely used in various collaborative editing systems.
Summary of the invention
The purpose of this invention is to provide a kind of collaborative editing efficient height, handle the locking method in the data collision module in the collaborative editing that conflicts flexibly, is easy to realize, solve present collaborative editing locking mechanisms and had problems separately, can't accomplish the problem of working in coordination with, coordinating of hommization.
In order to achieve the above object, the present invention adopts following technical scheme: the locking method of data collision module in a kind of collaborative editing, each teamworker will obtain the approval of chief editor's node of own place group to the locking of oneself editing position range, each teamworker has and only has a lock, can carry out various editing operations arbitrarily in lock-in range; All preserved a group member's lock table at each node, when this locality adds latching operation and takes place, the lock table of scanning of home at first, see not have and conflict with others' lock, if having, then at first will be by the judgement of priority, determine that this resource should be by that side's use, the result of judgement has:
(1), keeps original locking; In this case, the operation that locks of request can not be carried out;
(2), grab original locking; But this request must be by the permission of server;
(3), prompting user arbitration; When this situation occurs in identical two of priority and adds lock conflict,, can close arbitration and use the optimism lock rollback method of acquiescence if the user is unwilling to arbitrate the carrying out of interrupt task;
Afterwards, the judged result that locks is sent to chief editor's node, and chief editor's node is judged:
(a), whether there is other node to conflict with the lock position scope of this node application; If no, it will beam back the message of agreement, and the original editing operation of node of application lock comes into force;
(b) if conflict is arranged, then edit node and need judge whether effective teamworker's resource allocation request is, and effectively words are also beamed back agreement according to above-mentioned priority mode, and revise the lock table of chief editor's node maintenance, notify each cooperative node to unconditionally accept this lock table; Invalid words are then refused this judgement that locks, and the node of application also will be unconditionally accepted;
(c) if a plurality of judgements about locking are arranged simultaneously, it is whether overtime according to the timestamp checking request of each node then to edit node, non-overtime request is according to priority queueing, and uses the above-mentioned mode that locks that the request of all nodes is judged, edits node afterwards according to judged result, draft the lock table of self, judge which node needs rollback, which agreement locks, after judgement finishes, the lock table is sent back to all nodes, and association compiles node and unconditionally accepts;
Receive the node of the negative request enciphered information that chief editor's node is beamed back, cancellation operation set by this locality is cancelled editing operation in advance, when each user node discharges lock, the information that discharges lock must be issued chief editor's node, chief editor's node discharges this lock and will lock release information and issue all nodes in the group, each node is received the lock table that upgrades self after this information, if the position range that locks does not conflict with the lock table of this locality, so Ben Di editing operation is still proceeded, and the long-range chief editor's of unnecessary wait the arrival of replying is operated again.
Node is compiled in the process of application lock by described association, local editing operation can be carried out in advance, and keep these operations as the cancellation operation set, the cancellation operation set is can only just can be added in the original edit object at the eve that discharges lock by the set of rolling back action under the situation of failure that locks.
The conflict of described lock table be meant the lock-in range of two locks intersect, overlapping or comprise.
Lock is described by reference position and length.
The lock table comprises the latched position and the scope of all locks.
The invention reside in the collaborative key element that in the mechanism that locks, has added hommization, when clashing, at first attempt to manage conflict, and deposit the content of the disputed areas of conflict at chief editor's volume special buffer zone of node division by priority; When priority can't manage conflict, chief editor's volume end provided link for two editor's ends, and by the consult to decide of editor's end, a side of competition triumph obtains to lock authority.
Beneficial effect of the present invention is: proposes the hommization locking method, not only can improve the efficient of collaborative editing, and can the flexible processing conflict; This locking method is easy to realize, need not special management, has solved the disadvantage of primitive technology scheme, is with good expansibility; And a kind of resilient data collision solution is provided, can have satisfied many people distributed collaboration editor's collaborative demand.
Description of drawings
Fig. 1 is the process flow diagram of locking method of the present invention;
Fig. 2 is that the node processing flow chart that locks is compiled by association among the present invention;
Fig. 3 is the differentiation process flow diagram of chief editor's node among the present invention.
Embodiment
The abbreviation and the Key Term that relate among the present invention are defined as follows:
The editor of association node: the user who participates in certain collaborative editing session as the collaborationist.
Chief editor's volume node: first creates the user of this theme conversation, and it is the coordinator of this session, mainly is responsible for the arbitration of association's woollen yarn knitting point lock application in this session and to the management of this session.
With reference to locking: last lock of latched position during for the application lock, it is the reference point as the latched position conversion.
Relative position: refer to from reference to the end position of lock to the distance of the reference position of desiring to lock.
The conflict of lock: exist the lock-in range of two mutual exclusion lock to occur intersecting, overlapping or comprise situation.The structure of the collaborative editing system that the present invention relates to:
The system architecture of the locking method of data collision module often has centralized and distributed two kinds in the collaborative editing.Integrated system is realized simple, but the low-response of operation; And distributed system operation response is fast, but concurrent control difficulty is big.In order to reach good response effect and cooperation freely, collaborative editing system structure of the present invention has adopted the distributed and centralized architecture that combines, allow chief editor's node manage the session that node is compiled by each association concentratedly, the information such as daily record of User login information and each session, after landing successfully, communication between each teamworker is distributed fully, thereby alleviated the load of server in traditional C/s structure, also avoided the bottleneck that performance caused of server to system, in addition, it is complete distributed structure what enter session employing later on that node is compiled by each association, therefore can reduce the time delay of communication, shorten the response time, improve the real-time of system significantly, make local user's operation can inform the teamworker of far-end apace.Another aspect adopts distributed and centralized combining, and can avoid complete distributed frame data maintenance difficulty, the shortcoming of managerial confusion.
Collaborative editing system of the present invention is compiled node by a concentrated session management person and some associations and is formed, the session management person may operate on the independent station server, also can be positioned at one of them association compiles on the node, its IP address is disclosed, thereby become the access point of total system, the daily record of its main managing collaboration person, session and session, these add with a user or are relevant when leaving meeting.Simultaneously, editing operation can be carried out or send to chief editor's node also, and association's volume node mainly is responsible for the information transmit-receive with chief editor's node, with the interface display work of other association's volume node switching information and edit file.Management node has the session management main thread, send thread and accept thread, this node has well-known IP address, the session management main thread can be waited for the connection request of the association's volume node that comes from the Internet in editor, in case connection request is accepted, just create a receiving thread and a transmission thread respectively, the further communication between words supvr and this association volume node comprehended in the place to go, main thread works on, and wait for the connection request of other node, receiving thread also needs to obtain state when pre-editing from chief editor's node of each session, its mode is broadcasted downwards for chief editor's node, association compiles node and is responsible for reception, upgrade and form the daily record of session, proceed editor after being convenient to.Here, chief editor's node is as the session management person.
Node mainly comprises following thread (chief editor's node is as special node):
(1) land thread: it mainly is responsible for providing to the conference management person user's logon information, if new user will provide log-on message to the conference management person, if activate main thread just land success.
(2) main thread: it mainly is responsible for receiving the connection request of other node and creates an editing operation respectively for each new connection and sends thread and editing operation receiving thread.Main thread also is responsible for the response of local editing operation and is handled the demonstration of operated from a distance in native window of being accepted by the editing operation receiving thread.It is to activate a lock information to send thread and the information that lock message pick-up thread receives is handled that main thread also has an important task.In main thread, two important data structures are arranged: lock table and on-line session member tabulation (comprising user name and IP address).
(3) editing operation sends thread: the main responsible editing operation that this locality is taken place sends to long-range chief editor's point or node is compiled by each association.
(4) editing operation receiving thread: mainly be responsible for receiving remote association and compile the remote editing operation that node transmitted, and appropriate conversion is carried out in this operated from a distance according to the state of local text, safeguard the consistance of text status, may need to notify main thread that the lock table is changed accordingly simultaneously.
(5) lock information sends thread: the main request of being responsible for sending to chief editor's node lock.
(6) lock the message pick-up thread: the lock information that the mainly responsible chief editor's of reception node is sent and the modification information of lock table, if information is to affirm then the local editing operation of continuation, otherwise this thread also will be responsible for according to the cancellation operation set invalid operation being cancelled.
For chief editor's node, its lock message pick-up thread mainly is responsible for receiving the lock request that other teamworker sends in this session, and lock information sends the mainly responsible thread transmission response message to the request lock of thread, if sure replying, he also will all members send the message that the lock table changes in group.
Locking method in the collaborative editing of the present invention in the data collision module as Fig. 1, Fig. 2, shown in Figure 3:
Locking method among the present invention adopts the thought of optimistic lock substantially, each teamworker will obtain the approval of chief editor's node of own place group to the locking of oneself editing position range, each teamworker has and only has a lock, can carry out various editing operations arbitrarily in lock-in range, lock can be described by reference position and length; A group member's latched position and scope one lock table have all been preserved at each node, when this locality adds the latching operation generation, the lock table of scanning of home at first, seen and do not conflicted with others, the conflict of lock be meant the lock-in range of two locks intersect, overlapping or comprise, if having, then at first will be by the judgement of priority, determine that this resource should be by that side's use, the possibility of result of judgement is:
1. keep original locking; In this case, the operation that locks of request can not be carried out (original lock priority is higher than the current Request Priority that locks).
2. grab original locking; But this request must be by the permission (original lock priority is lower than the current Request Priority that locks) of server.
3. prompting user arbitration; When this situation occurs in identical two of priority and adds lock conflict.If the user is unwilling to arbitrate the carrying out of interrupt task, can close arbitration and the optimism lock rollback mechanism of use acquiescence.
But in the process of application lock, local editing operation can be carried out in advance, and keeps these operations as the cancellation operation set.The cancellation operation set is can only just can be added in the original edit object at the eve that discharges lock by the set of the operation of rollback under the situation of failure that locks.
Afterwards, the judged result that locks is sent to chief editor's node, and chief editor's node is judged:
1. whether other node conflict with the lock position scope of this node application (this step is by judging according to the single node algorithm among Fig. 3, and this single node algorithm can be existed algorithms) is arranged; If no, it will beam back the message of agreement, and the original editing operation of node of application lock comes into force.
2. if conflict is arranged, then edit node and need judge whether effective teamworker's resource allocation request is, and effectively words are also beamed back agreement according to above-mentioned priority mode, and revise the lock table of chief editor's node maintenance, notify each cooperative node to unconditionally accept this lock table; Invalid words are then refused this judgement that locks, and the node of application also will be unconditionally accepted.
3. if a plurality of judgements about locking are arranged simultaneously, it is whether overtime according to the timestamp of each node checking request then to edit node, and non-overtime request is according to priority queueing, and uses the above-mentioned mode that locks that the request of all nodes is judged.Edit node afterwards according to judged result, draft the lock table of self, judge which node needs rollback, which agreement locks.After judging end, the lock table is sent back to all nodes, association compiles node and unconditionally accepts.
Receive the node of the negative request enciphered information that the chief editor beams back, cancel editing operation in advance by the cancellation operation set of this locality.
When each user node discharges lock, the information that discharges lock must be issued chief editor's node.Chief editor's node discharges this lock and will lock release information and issue all nodes in the group, and each node is received the lock table of renewal self after this information.Can find out by the above-mentioned request process that locks, if the position range that locks does not conflict with the lock table of this locality, so Ben Di editing operation is still proceeded, the long-range chief editor's of unnecessary wait the arrival of replying is operated again, the possibility of competing a position owing to a plurality of teamworkers simultaneously is very little, therefore it is unsuccessful and the possibility cancellation operation is also very little that the lock application takes place, thereby the efficient of system compiles is very high, even under the situation that has produced conflict, can guarantee to greatest extent according to the priority scheme of selecting that locks that important editing is not at will interrupted; Simultaneously, adopt some softwares of the more convenient solution of mode of user's arbitration can't improve the collision problem of solution, and after closing user's arbitration, the scheme of locking is degenerated to based on the optimism of priority lock the arbitration scheme that locks, and still has very high efficient.
The management of the collaborative editing system that the present invention relates to:
On structure, the composition of each node is similar.Chief editor's node and association compile node and all safeguard a lock table, and this table content is the situation that locks of present system, and its renewal is synchronous, are responsible for carrying out by chief editor's node.When chief editor's node need upgrade the lock table, meeting assisted volume node broadcast to each, and association compiles node and receives after the broadcasting, and is necessary unconditional according to the broadcasted content modification lock table of editing node, thereby maintenance and other node is synchronous.
Node is when the application of chief editor's node locks, need zone of dynamic application to be used to deposit the enciphered information of needs application, promptly on the basis of the portion of this locality lock table information copy, make amendment, offer chief editor's node then, local operation is also dynamically applied for one section region of memory, and copy the information in the zone that locks, in this zone, edit, as the cancellation operation set.After request went through, then node was cancelled original lock table, used amended lock table, and continued the enterprising edlin of content basis at the cancellation operation set, and the request of prevention higher priority need be seized.After editor finishes, use the cancellation operation set to replace original ' locked ' zone content; Whenever if, the request of locking is out of court, and the content of then cancelling operation set is by rollback, and keeps original lock table, till chief editor's node requires to upgrade.
Claims (5)
1, the locking method of data collision module in a kind of collaborative editing, it is characterized in that: each teamworker will obtain the approval of chief editor's node of own place group to the locking of oneself editing position range, each teamworker has and only has a lock, can carry out various editing operations arbitrarily in lock-in range; All preserved a group member's lock table at each node, when this locality adds the latching operation generation, the lock table of scanning of home at first, see not have and conflict with others' lock, if have, then at first to determine which side this editor's resource requirement should be used by, and the result of judgement has by the judgement of priority:
(1), keeps original locking; In this case, the operation that locks of request can not be carried out;
(2), grab original locking; But this request must be by the permission of server;
(3), prompting user arbitration; When this situation occurs in identical two of priority and adds lock conflict,, close arbitration and use the optimism lock rollback method of acquiescence if the user is unwilling to arbitrate the carrying out of interrupt task; Afterwards, the judged result that locks is sent to chief editor's node, and chief editor's node is judged:
(a), whether there is other node to conflict with the lock position scope of this node application; If no, it will beam back the message of agreement, and the original editing operation of node of application lock comes into force;
(b) if conflict is arranged, then edit node and need judge whether effective teamworker's resource allocation request is, and effectively words are also beamed back agreement according to above-mentioned priority mode, and revise the lock table of chief editor's node maintenance, notify each cooperative node to unconditionally accept this lock table; Invalid words are then refused this and are added latching operation, and the node of application also will be unconditionally accepted;
(c) if a plurality of judgements about locking are arranged simultaneously, it is whether overtime according to the timestamp checking request of each node then to edit node, non-overtime request is according to priority queueing, and uses the judgment rule of chief editor's node that the request of all nodes is judged, edits node afterwards according to judged result, draft the lock table of self, judge which node needs rollback, which agreement locks, after judgement finishes, the lock table is sent back to all nodes, and cooperative node is unconditionally accepted;
Receive the node of the negative request enciphered information that chief editor's node is beamed back, cancellation operation set by this locality is cancelled editing operation in advance, when each user node discharges lock, the information that discharges lock must be issued chief editor's node, chief editor's node discharges this lock and will lock release information and issue all nodes in the group, each node is received the lock table that upgrades self after this information, if the position range that locks does not conflict with the lock table of this locality, so Ben Di editing operation is still proceeded, and the arrival of replying of the long-range chief editor's node of unnecessary wait is operated again.
2, the locking method of data collision module in the collaborative editing according to claim 1, it is characterized in that: described cooperative node is in the process of application lock, local editing operation is carried out in advance, and keep these operations as the cancellation operation set, the cancellation operation set is can only just can be added in the original edit object at the eve that discharges lock by the set of the operation of rollback under the situation of failure that locks.
3, the locking method of data collision module in the collaborative editing according to claim 1 is characterized in that: the conflict of described lock table be meant the lock-in range of two locks intersect, overlapping or comprise.
4, the locking method of data collision module in the collaborative editing according to claim 1 is characterized in that: lock is described by reference position and length.
5, the locking method of data collision module in the collaborative editing according to claim 1, it is characterized in that: the lock table comprises the latched position and the scope of all locks.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2007100510080A CN100568184C (en) | 2007-12-27 | 2007-12-27 | The locking method of data collision module in the collaborative editing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2007100510080A CN100568184C (en) | 2007-12-27 | 2007-12-27 | The locking method of data collision module in the collaborative editing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101196829A CN101196829A (en) | 2008-06-11 |
| CN100568184C true CN100568184C (en) | 2009-12-09 |
Family
ID=39547262
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2007100510080A Expired - Fee Related CN100568184C (en) | 2007-12-27 | 2007-12-27 | The locking method of data collision module in the collaborative editing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100568184C (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103150207A (en) * | 2013-03-20 | 2013-06-12 | 重庆南地科技开发有限公司 | Collaborative processing method and system for engineering exploration data computer |
Families Citing this family (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7890472B2 (en) * | 2007-09-18 | 2011-02-15 | Microsoft Corporation | Parallel nested transactions in transactional memory |
| CN101764951B (en) * | 2008-11-14 | 2013-09-18 | 新奥特（北京）视频技术有限公司 | Multi-person synergy subtitle editing method based on virtual lock mechanism |
| CN101615203B (en) * | 2009-07-23 | 2012-04-04 | 中兴通讯股份有限公司 | Concurrency control method and device |
| CN101984430A (en) * | 2010-11-04 | 2011-03-09 | 中兴通讯股份有限公司 | Multi-user collaborative graphic editing method and system for mobile terminal |
| CN102469292B (en) * | 2010-11-15 | 2015-11-25 | 中国移动通信集团公司 | A kind of video and audio synergic editing method, Apparatus and system |
| CN103544189A (en) * | 2012-07-17 | 2014-01-29 | 珠海金山办公软件有限公司 | Method and system for locking currently-edited file |
| CN104753987B (en) * | 2013-12-26 | 2019-03-01 | 北京东方通科技股份有限公司 | A kind of distributed conversation management method and system |
| CN104536834A (en) * | 2014-11-26 | 2015-04-22 | 华为技术有限公司 | Method for authorizing lock permission and distributed lock manager |
| CN104536919B (en) * | 2014-12-11 | 2018-02-13 | 浪潮(北京)电子信息产业有限公司 | A kind of method and apparatus for avoiding IO to conflict in cloning system |
| CN107466456B (en) * | 2015-12-30 | 2020-01-17 | 华为技术有限公司 | Locking request processing method and server |
| CN106375684A (en) * | 2016-10-10 | 2017-02-01 | 北京译言协力传媒科技有限公司 | Collaborative subtitle editing equipment, and collaborative subtitle editing system and method |
| CN106569797B (en) * | 2016-10-11 | 2019-07-05 | 东软集团股份有限公司 | The methods, devices and systems of multi-person synergy drafting process |
| CN107341646A (en) * | 2017-05-31 | 2017-11-10 | 北京广利核系统工程有限公司 | Configuration software coordination management system and method |
| CN108153833B (en) * | 2017-12-14 | 2019-01-18 | 北京龙软科技股份有限公司 | Coal mine distributed collaboration one opens drawing system and collaborative management method |
| CN110572360B (en) * | 2019-08-02 | 2022-05-13 | 武大吉奥信息技术有限公司 | GIS spatial data collaborative editing method |
| CN111949673B (en) * | 2020-08-04 | 2024-02-20 | 贵州易鲸捷信息技术有限公司 | Hbase storage-based distributed pessimistic lock and implementation method thereof |
| CN112070861B (en) * | 2020-08-06 | 2023-02-24 | 新疆维吾尔自治区第二测绘院 | Multi-user real-time synchronous collaborative map editing method and system considering geographic features |
| CN114385621A (en) * | 2020-10-21 | 2022-04-22 | 北京达佳互联信息技术有限公司 | Locking method, device, equipment and medium |
| CN113971551B (en) * | 2021-12-27 | 2022-04-19 | 深圳至简天成科技有限公司 | Real-time assessment method and system for online interview |
| CN116306521A (en) * | 2023-03-15 | 2023-06-23 | 北京中宏立达科技发展有限公司 | Editing authority allocation method, system, equipment and medium in collaborative editing |
-
2007
- 2007-12-27 CN CNB2007100510080A patent/CN100568184C/en not_active Expired - Fee Related
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103150207A (en) * | 2013-03-20 | 2013-06-12 | 重庆南地科技开发有限公司 | Collaborative processing method and system for engineering exploration data computer |
| CN103150207B (en) * | 2013-03-20 | 2016-07-20 | 重庆南地科技开发有限公司 | Geotechnical Engineering Investigation Data collaborative computer processing method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101196829A (en) | 2008-06-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100568184C (en) | The locking method of data collision module in the collaborative editing | |
| Sun | Optional and responsive fine-grain locking in internet-based collaborative systems | |
| JP2006504363A (en) | Specification of software architecture for capability and quality of service negotiation and session establishment for distributed multimedia applications | |
| Chen et al. | A distributed algorithm for graphic objects replication in real-time group editors | |
| CN103488754B (en) | A kind of method of transparent interoperability between heterogeneous profiles cooperation cloud service | |
| CN1331052C (en) | Method and apparatus for managing resource contention in a multisystem cluster | |
| CN103995691B (en) | Service state consistency maintenance method based on transactions | |
| CN102523179B (en) | Topic group service realization method based on instant messaging | |
| Busi et al. | Towards a formal framework for choreography | |
| CN109034716A (en) | A kind of concurrent locking method of packet-based collaborative editing | |
| Ignat et al. | Grouping in collaborative graphical editors | |
| CN101004742A (en) | Under embedded environment, method for protecting consistency of memory database | |
| Lonchamp | Process model patterns for collaborative work | |
| US20030018606A1 (en) | Revocation of tokens without communication between the token holders and the token server | |
| Xue et al. | Conflict control locking in distributed cooperative graphics editors | |
| CN109685646A (en) | A kind of fund method of servicing and its system | |
| KR100233238B1 (en) | Two way authentication communication method using multithread in distributed transaction system | |
| Patiño-Martínez et al. | Integrating groups and transactions: A fault-tolerant extension of Ada | |
| CN100456699C (en) | Service capacity interactive managing system in communication network and method thereof | |
| Fdhila et al. | Toward synchronization between decentralized orchestrations of composite web services | |
| Mao et al. | The optimistic locking concurrency controlling algorithm based on relative position and its application in real-time collaborative editing system | |
| Tang et al. | Transaction management for reliable grid applications | |
| Banks et al. | OSI distributed transaction processing commitment optimizations | |
| Böttcher et al. | Dynamic commit tree management for service oriented architectures | |
| CN1332309C (en) | Transaction processing system under Web service environment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20091209 Termination date: 20191227 |