Multi-party interaction method based on data application and visualization system
Through the optimistic locking mechanism and timestamp merging algorithm, multi-user data interaction conflicts are handled, and combined with dynamic permission evaluation factors, data consistency and security issues in multi-user concurrent operations are solved, and an efficient and secure multi-party interaction method is realized.
Patent Information
- Application Number
- CN202510884972.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-06-30
- Publication Date
- 2025-07-29
- Estimated Expiration
- 2045-06-30
AI Technical Summary
When facing concurrent operations of multiple users, the traditional multi-user data interaction method lacks an effective conflict resolution mechanism that leads to data inconsistency, operation loss or logical errors, and the traditional role-based access control model is difficult to adapt to dynamically changing business environment and user behavior.
The optimistic locking mechanism is used to combine version number judgment data modification, the operation log merging algorithm based on the timestamp handles conflicts, and the permission control is performed through the user-role-permission mapping table and dynamic permission evaluation factor to resolve conflicts and resolve permissions.
It realizes data consistency and security during concurrent editing of multiple users, improves system response speed and collaboration efficiency, adapts to dynamic business environment, reduces the risks of manual intervention and overreach, and meets enterprise-level data collaboration and security control needs.
Smart Images

Figure CN120387180A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of multi-party interaction, and particularly relates to a multi-party interaction method based on a data application and a visualization system. Background Art
[0002] With the improvement of business complexity and the increasing demand for cross-departmental and cross-team collaboration, the scenario where multiple users simultaneously edit, analyze, and operate on the same data set has become increasingly common, which poses severe challenges to the multi-party interaction ability, data consistency guarantee, and security control mechanism of the system.
[0003] In the face of concurrent operations by multiple users, traditional data interaction methods often lead to data inconsistency, operation loss, or logical errors due to the lack of an effective conflict resolution mechanism. For example, when multiple users simultaneously modify the same data object, if the system cannot timely identify the operation sequence and conflict type, it may result in a chaotic final data result, affecting the continuity of the business process and the accuracy of decision-making.
[0004] In the field of data security, traditional role-based access control models implement permission management through static mapping of predefined roles and permissions, and it is difficult to adapt to dynamic business environments and user behaviors.
[0005] In existing multi-party interaction methods, conflict resolution and permission control are usually designed as independent modules and lack coordinated linkage. For example, during the merging of operation logs, conflicts are processed only based on timestamps or simple priorities, without fully considering the real-time permission status of users.
[0006] In view of the above problems, the present invention proposes a multi-party interaction method that integrates synchronous operation conflict resolution, dynamic permission control, and the coordination mechanism between the two. This solution aims to improve the reliability, security, and coordination efficiency of the data application and visualization system in multi-party interaction scenarios, and meet the core requirements of modern enterprises for real-time data collaboration and dynamic security management. Summary of the Invention
[0007] The purpose of the present invention is to provide a multi-party interaction method based on a data application and a visualization system, which solves the technical problems proposed in the background art.
[0008] The purpose of the present invention can be achieved through the following technical solutions: A multi-party interaction method based on a data application and a visualization system includes the following steps: Synchronous operation conflict resolution: When multiple users simultaneously edit the same data set, by defining a version number for each data object, the optimistic lock mechanism is used to determine whether the data has been modified by other users; If the version numbers match, the operation is allowed to execute and the version number is updated. If they don't match, the operation log merge algorithm is triggered. This algorithm merges operations based on the timestamp order of the operation logs. For timestamp conflicts, the algorithm handles the operations separately based on whether the operation types are the same and updates the version number. Permission and data security control: Construct user-role mapping tables and role-permission mapping tables, aggregate user permissions into the union of permissions corresponding to the assigned roles, and then calculate the permission evaluation value based on pre-defined permission evaluation factors and preset weights. Then, based on the comparison results of the permission evaluation value with the preset threshold, dynamically control the user's operation permissions; Conflict resolution and permission control collaboration: During the operation log merging process, when a user priority conflict occurs, the permission evaluation value is introduced for secondary judgment. By comparing the permission evaluation values of the current user with those of other users, the user operations with higher permission evaluation values are retained first.
[0009] As a further solution of the present invention, the specific method for resolving synchronization operation conflicts is as follows: Step A1: define a version number V for each data object and set its initial value to 0; When a user operates a data object, the operation request contains the current version number V of the current data object. current ; Step A2: Optimistic locking mechanism execution: The user initiates an operation request Q, which carries the operation type, operation data, and current version number V. current ; According to the operation request, query the actual version number V of the corresponding data object in the database actual ; Compare V current With V actual : If V current =V actual , it means that during the period from the time when the current user initiates the request to the time when the server receives the request, the data corresponding to the data object has not been modified by other users, and the operation request Q is allowed to be executed; After the operation request is completed, the version number V of the data object is updated to V new =V actual +1; If V current ≠V actual , it means that the data corresponding to the data object has been modified by other users, which triggers the operation log merging algorithm; Step A3: Operation log merging algorithm execution: Extract the operation logs of each user from the data objects modified by other users, and denote them as Y i ={Q ij}, and at the same time extract the operation logs of the current user's operations on the data object, and denote them as Y0={Q 0j}; Among them, i represents the serial number of other users who modified the data object, j represents the serial number of the corresponding operation log of the user, and both i and j are variables; Extract the timestamps of each operation log from the operation logs of all users in the data object; Then mark the timestamps corresponding to Y i ={Q ij} and Y0={Q 0j} as T ij and T 0j ; Initialize and merge the operation logs of all users to obtain Y z ; Traverse Y0 and Y in real time i ; Compare Y0 and Y i respectively corresponding timestamps T 0j and T ij ; If T 0j < T ij , it means that the current user's operation is prior to other users, then add Q 0j to Y z ; If T 0j > T ij , it means that other users' operations are prior to the current user, then add Q ij to Y z ; If T 0j = T ij , then further process according to the operation type, specifically as follows: When the operation types corresponding to Y0 and Y i are the same and the operation data is consistent, only keep one operation and add it to Y z ; When the operation types corresponding to Y0 and Y i are the same but the operation data is different, adopt the user priority strategy; First, set a priority for the current user and others respectively, and denote them as P0 and P i ; If P0 < P i , then add Q 0j to Y z ; If P0 > P i , then add Q ij to Y z ; If P0 = P i , then send a conflict prompt to the current user, and the current user manually selects the operations to be retained; When the operation types corresponding to Y0 and Y i are different, process according to the logical relationship preset according to the operation type; After the traversal is completed, execute the operations in Y z in sequence, and update the version number of the data object to V new = V actual + 1 + the number of merge operations.
[0010] As a further solution of the present invention: Among them, the operation types include insertion, deletion, and modification; The preset logical relationship is as follows: If the operation types corresponding to Y0 and Y i are one insertion and one deletion: If the insertion operation is executed before the deletion operation, first execute the insertion operation, then execute the deletion operation, and record the deletion operation in Y z ; If the insertion operation is executed after the deletion operation, the insertion operation is not executed, and the deletion operation is added to Y z ; If the operation types corresponding to Y0 and Y i are one modification and one deletion: If the modification operation is executed before the deletion, the modified data is deleted, and only the deletion operation is recorded in Y z ; If the modification operation is executed after the deletion, the data after deletion does not exist, and the modification operation is invalid, that is, the modification operation is ignored; If the operation types corresponding to Y0 and Y i are one insertion and one modification, then the last executed operation shall prevail.
[0011] As a further solution of the present invention: The specific methods of permission and data security control are as follows: Step B1, extract the user set U = {U t}, role set R = {R g}, permission set E = {E k}; Among them, t represents all user numbers, g represents all role numbers, and k represents all permission numbers; Step B2. Assign roles to the user according to the user's job responsibilities and requirements, and establish a user-role mapping table M(UR), which represents the corresponding relationship between the user and the role; Among them, if user U t is assigned role R g , then record (U t , R g ) in M(UR); Step B3. Assign corresponding permissions to each role according to the user's job responsibilities and requirements, and establish a role-permission mapping table M(RE), which represents the corresponding relationship between the role and the permission; Among them, if role R g is given permission E k , then record (R g , E k ) in M(RE); Step B4. User permission assignment: Select a user U t ; First, through: , determine the role set R(U) of this user; Then, through: , determine the permission set E(U) of this user; And so on, determine the permission sets of all users; Step B5. Dynamic adjustment of user permissions: Based on the RBAC model, introduce a dynamic permission adjustment mechanism: According to the predefined permission evaluation factors, extract the permission evaluation factor set F = {F s}, where s represents the predefined permission evaluation factor serial number; At the same time, extract the preset weight βs corresponding to each permission evaluation factor; Then, through , calculate the permission evaluation value G; Then compare the permission evaluation value G with the predefined permission threshold Gy: If G≥Gy, allow the operation requests that conform to the user's corresponding permission set to be executed, and at the same time restrict the execution of the operation requests that do not conform to the user's corresponding permission set; If G<Gy, restrict the execution of the user's corresponding operation requests, including: restricting the execution of the operation requests that conform to the user's corresponding permission set.
[0012] As a further solution of the present invention: Among them, the permission evaluation factors include the user's operation frequency factor, operation time factor, and operation location factor; The operation frequency factor is used to reflect the number of operations performed by the user per unit time; the operation time factor is used to evaluate whether the time when the operation occurs conforms to the normal working period; The operation location factor is used to verify whether the geographical location where the operation is initiated conforms to the normal working location.
[0013] As a further solution of the present invention: wherein: The operation frequency factor = the number of operations in the current time period / the preset operation number threshold; As a further solution of the present invention: wherein: When the time when the operation is evaluated to occur is within the normal working period, the operation time factor takes a value of 1; When the time when the operation is evaluated to occur is within the overtime working period, the operation time factor takes a value of 0.7; When the time when the operation is evaluated to occur is not within the normal working period nor within the overtime working period, the operation time factor takes a value of 0.2; When the time when the operation is evaluated to occur is within the restricted working period, the operation time factor takes a value of 0; As a further solution of the present invention: wherein: ; In the formula, FD is referred to as the operation location factor, d is referred to as the distance between the geographical location of the current operation and the preset normal working location, r is the radius of the allowable range of the normal working location, a circular area is delimited with radius r as the allowable range of the normal working location, and λ is a preset attenuation coefficient used to control the influence degree of the distance on the permission.
[0014] As a further solution of the present invention: wherein, , (d x , d y ) is referred to as the geographical location of the current operation, and (d x0 , d y0 ) is referred to as the normal working location.
[0015] As a further solution of the present invention: In the secondary judgment, if the G value is the same, the user manual selection mechanism is triggered, which retains the user operation through user manual selection.
[0016] The beneficial effects of the present invention: The present invention defines a version number for each data object and combines an optimistic lock mechanism to ensure that it can quickly judge whether the data has been modified during multi-user concurrent editing. When the version numbers are the same, the operation is directly executed and the version is updated, avoiding the performance overhead of the traditional lock mechanism and improving the system response speed. The version number update rule ensures the sequentiality and uniqueness of the operations, reducing the conflict probability from the source.
[0017] The present invention merges operation logs based on the timestamp order, ensuring execution according to the actual operation sequence, which conforms to the user's intuition. When there is a timestamp conflict, it is automatically processed according to the preset logic of the operation type, reducing the cost of manual intervention. When the operation types are the same but there is a data conflict, the operation with a higher priority is automatically retained according to the user priority; when the priorities are the same, manual selection is triggered, taking into account both automation and flexibility.
[0018] The present invention, through a two-layer mapping table of "user-role-permission", aggregates user permissions into the union of role permissions, realizes hierarchical management and batch allocation of permissions, simplifies the complexity of permission configuration, and is especially suitable for multi-user scenarios with complex organizational structures. It introduces multi-dimensional evaluation factors such as operation frequency, time, and location, combines weights to calculate the permission evaluation value, and realizes dynamic adjustment of permissions; the comparison result between the permission evaluation value and the threshold directly controls the operation permissions, realizing the "least privilege principle". Users with a high evaluation value have more operation permissions, while users with a low evaluation value are restricted or even prohibited from operating within their original permissions, enhancing the dynamic defense ability.
[0019] The present invention, during the process of merging operation logs, when there is a conflict in user priorities, introduces the permission evaluation value for secondary judgment, and preferentially retains the operations of high-privilege users to ensure the consistency of data control rights and responsibility permissions. If the permission evaluation values are the same, a manual selection mechanism is triggered to avoid misjudgment that may be caused by the system's automatic decision-making and ensure the accuracy of critical operations. From conflict prevention (i.e., version control), conflict detection (i.e., optimistic lock), conflict resolution (i.e., log merge) to dynamic calibration of permissions, a complete security control chain is formed, which not only ensures the smoothness of multi-user collaboration but also, through in-depth intervention in the permission dimension, prevents unauthorized operations and data abuse, meeting the requirements of data security-sensitive scenarios such as finance and healthcare.
[0020] The present invention, the optimistic lock and the log merge algorithm reduce lock contention and blocking, and are more suitable for high-concurrency scenarios than pessimistic locks, improving the system throughput and response speed. The permission evaluation factors can be customized and extended, and the weight parameters can be dynamically adjusted to adapt to the security policy requirements of different industries. The role-permission mapping table supports dynamic updates, facilitating system administrators to quickly adjust permission configurations according to organizational structure changes. Automatic conflict resolution reduces the user waiting time, and the manual selection mechanism gives users control in complex conflicts, enhancing the operation transparency and trust. The visualization system can combine the permission evaluation results to provide real-time feedback on the operation status and guide users to operate in compliance.
[0021] The present invention realizes the balance of data consistency, operation security, and collaboration efficiency through a three-dimensional solution of "version control + intelligent merge + dynamic permissions" in multi-user interaction scenarios, and is especially suitable for scenarios such as data visualization analysis, collaborative office platforms, and supply chain management systems that require multi-person real-time collaboration, providing reliable technical support for enterprise-level data applications. BRIEF DESCRIPTION OF THE DRAWINGS
[0022] The present invention will be further described below with reference to the accompanying drawings.
[0023] Figure 1 It is a flow chart of a multi-party interaction method based on a data application and visualization system of the present invention. DETAILED DESCRIPTION
[0024] The following will clearly and completely describe the technical solutions in the embodiments of the present invention in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making any creative efforts shall fall within the scope of protection of the present invention.
[0025] As embodiment 1 of the present invention: See also Figure 1 As shown, the present invention is a multi-party interaction method based on data application and visualization system, comprising: When multiple users edit the same dataset simultaneously, conflict resolution is performed on their synchronization operations: Conflict resolution uses a hybrid conflict resolution strategy that combines an optimistic locking mechanism with an operation log merging algorithm. Step A1: define a version number V for each data object and set its initial value to 0; When a user operates a data object, the operation request contains the current version number V of the current data object. current ; Step A2: Optimistic locking mechanism execution: The specific steps are as follows: Step A2.1: The user initiates an operation request Q; The operation request carries the operation type, operation data, and current version number V current ; Among them, the operation types include insert, delete, and modify; Step A2.2: The server receives the operation request and then queries the actual version number V of the corresponding data object in the database. actual ; Step A2.3: Compare V current With V actual : If V current =V actual , it means that during the period from the time when the current user initiates the request to the time when the server receives the request, the data corresponding to the data object has not been modified by other users, and the operation request Q is allowed to be executed; After the operation request is executed, update the version number V of the data object to V new =V actual +1; If V current ≠V actual , it means that the data corresponding to the data object has been modified by other users, and the operation log merging algorithm is triggered accordingly; Step A3. Execution of the operation log merging algorithm: The specific steps are as follows: Step A3.1. In the data object modified by other users, extract the operation logs of each user and denote them as Y i ={Q ij}, and at the same time extract the operation log of the current user's operation on the data object and denote it as Y0={Q 0j}; Among them, i represents the serial number of other users who modified the data object, j represents the serial number of the corresponding operation log of the user, and both i and j are variables; Step A3.2. In the operation logs of all users in the data object, extract the timestamps of each operation log; Then mark the timestamps corresponding to Y i ={Q ij} and Y0={Q 0j} as T ij and T 0j respectively; Step A3.3. Initialize and merge to obtain the operation logs Y of all users according to the time trend of the timestamps corresponding to each operation log z ; Step A3.4. Traverse Y0 and Y in real time i ; Compare the timestamps T i and T 0j corresponding to Y0 and Y ij respectively; If T 0j <T ij , it means that the current user's operation precedes other users, then add Q 0j to Y z ; If T 0j >T ij , it means that other users' operations precede the current user, then add Q ij to Y z ; If T 0j =T ij , further processing will be carried out according to the operation type, as follows: When Y0 and Y iIf the corresponding operation types are the same and the operation data is consistent, only retain one operation and add it to Y z ; When Y0 and Y i correspond to the same operation type but different operation data, adopt the user priority strategy; First, set a priority for the current user and others respectively, and record them as P0 and P i ; If P0 < P i , then add Q 0j to Y z ; If P0 > P i , then add Q ij to Y z ; If P0 = P i , then send a conflict prompt to the current user, and let the current user manually select the operation to be retained; When Y0 and Y i correspond to different operation types, process according to the pre-set logical relationship of the operation types; Among them: If Y0 and Y i correspond to operation types, one is insert and the other is delete: If the insert operation is executed before the delete operation, first execute the insert operation, then execute the delete operation, and record the delete operation in Y z ; If the insert operation is executed after the delete operation, the insert operation is not executed, and the delete operation is added to Y z ; If Y0 and Y i correspond to operation types, one is modify and the other is delete: If the modify operation is executed before the delete operation, the modified data is deleted, and only the delete operation is recorded in Y z ; If the modify operation is executed after the delete operation, the data after deletion does not exist, and the modify operation is invalid, that is, the modify operation is ignored; If Y0 and Y i correspond to operation types, one is insert and the other is modify, then take the last executed operation as the standard; After the traversal is completed, execute the operations in Y z in sequence, and update the version number of the data object to V new =V actual +1 + the number of merge operations.
[0026] Example 1 solves the data consistency problem when multiple users concurrently edit the same data set through a hybrid conflict resolution strategy, namely optimistic locking + operation log merging algorithm: Version control and optimistic locking mechanism: Define a version number for the data object and combine it with optimistic locking to avoid the performance loss of the traditional locking mechanism and achieve fast conflict detection. When the version numbers are the same, the operation is directly executed and the version is updated to improve the system response speed. When the version numbers are different, log merging is triggered to reduce the blocking of invalid operations.
[0027] Time-driven intelligent merging algorithm: Merge operation logs based on the timestamp order to ensure execution according to the actual operation time sequence. When there is a timestamp conflict, it is automatically processed according to the preset logic of the operation type, reducing manual intervention and improving the conflict resolution efficiency. The user priority strategy is combined with the manual selection mechanism to balance automation and flexibility when there are conflicts in operating data.
[0028] Dynamic version number update rule: After the merge operation, the version number is updated as "V actual +1 + number of merge operations", clearly recording the operation history, facilitating data traceability and auditing, and enhancing the maintainability of the system.
[0029] As Example 2 of the present invention: Please refer to Figure 1 As shown, in the specific implementation of the present application, compared with Example 1, the difference between the technical solution of this example and that of Example 1 is only that in this example, permission and data security control: Adopt a role-based access control extension model and combine it with a dynamic permission evaluation strategy to dynamically manage the permissions of different users: Step B1, extract the user set U = {U t}, role set R = {R g}, and permission set E = {E k}; Where t represents all user serial numbers, g represents all role serial numbers, and k represents all permission serial numbers; Step B2, according to the job responsibilities and requirements of the users, assign roles to the users and establish a user-role mapping table M(UR), which represents the corresponding relationship between users and roles; In this example, if the user U t is assigned the role R g , then (U t , R g ) is recorded in M(UR); Step B3, according to the job responsibilities and requirements of the users, assign corresponding permissions to each role and establish a role-permission mapping table M(RE), which represents the corresponding relationship between roles and permissions; In this example, if the role R gGranted permission E k , then record (Rg, E) in M(RE) k ); Step B4, User permission assignment: Select a user U t ; First, through: , determine the role set R(U) of this user; Then, through: , determine the permission set E(U) of this user; In this embodiment, assume that the role sets corresponding to user U1 are R2 and R3; Among them: the permission set corresponding to R2 is {E5, E7}, and the permission set corresponding to R3 is {E7, E9}; Then: E(U1) = {E5, E7} ∪ {E7, E9} = {E5, E7, E9}; And so on, determine the permission sets of all users; Step B5, Dynamic adjustment of user permissions: Based on the RBAC model, introduce a dynamic permission adjustment mechanism: According to the pre-defined permission evaluation factors, extract the permission evaluation factor set F = {F s}; Among them, s represents the serial number of the pre-defined permission evaluation factor; In this embodiment, the permission evaluation factors include but are not limited to the operation frequency factor, operation time factor, and operation location factor of the user; The operation frequency factor is used to reflect the number of operations of the user within a unit time; Among them: Operation frequency factor = Number of operations in the current time period / Preset operation number threshold The operation time factor is used to evaluate whether the time when the operation occurs conforms to the normal working period; Among them: When the time when the evaluated operation occurs is in the normal working period, the operation time factor takes a value of 1; When the time when the evaluated operation occurs is in the overtime working period, the operation time factor takes a value of 0.7; When the time when the evaluated operation occurs is neither in the normal working period nor in the overtime working period, the operation time factor takes a value of 0.2; When the time when the evaluated operation occurs is in the restricted working period, the operation time factor takes a value of 0; The operation location factor is used to verify whether the geographical location where the operation is initiated conforms to the normal working location; Among them:
[0030] In the formula, FD represents the operation location factor, d represents the distance between the geographical location of the current operation and the preset normal working position, r is the radius of the allowable range of the normal working position, a circular area is delimited with radius r as the allowable range of the normal working position, and λ is a preset attenuation coefficient used to control the influence degree of distance on permissions; Where: , (d x , d y ) represents the geographical location of the current operation, and (d x0 , d y0 ) represents the normal working position; λ = 0.1 / m, which means that for every 1-meter increase in distance, the permission decays exponentially by 0.1 times; At the same time, the corresponding preset weights βs of each permission evaluation factor are extracted; Then, through , the permission evaluation value G is calculated; Subsequently, the permission evaluation value G is compared with a preset permission threshold Gy: If G ≥ Gy, the operation requests that conform to the user's corresponding permission set are allowed to be executed, and at the same time, the operation requests that do not conform to the user's corresponding permission set are restricted from being executed; If G < Gy, the operation requests corresponding to the user are restricted from being executed, including: restricting the execution of operation requests that conform to the user's corresponding permission set.
[0031] Example 2 implements refined data security control based on the Role-Based Access Control (RBAC) extended model and dynamic permission evaluation strategy: Hierarchical permission management architecture: Through a two-layer mapping table of "user-role-permission", the user permissions are aggregated into the union of role permissions, simplifying the complexity of permission configuration, applicable to enterprise scenarios with changing organizational structures, and supporting batch permission allocation and dynamic adjustment.
[0032] Multi-dimensional dynamic permission evaluation: Evaluation factors such as operation frequency, time, and location are introduced, and the permission evaluation value is calculated in combination with weights: The operation frequency factor quantifies the risk of abnormal operations and can identify suspicious behaviors in a timely manner through "the current number of operations / preset threshold"; The operation time factor distinguishes working hours, overtime hours, non-working hours, and restricted hours, restricts operations during unauthorized hours, and reduces the risk of data leakage; The operation location factor dynamically calculates permissions based on geographical location distance and attenuation coefficient, prohibits unauthorized cross-location access, and meets the requirements of data security compliance.
[0033] Dynamic Permission Calibration Mechanism: By comparing the permission evaluation value with the threshold, the "principle of least privilege" is implemented - users with high evaluation values retain full permissions, while users with low evaluation values are restricted or even prohibited from operating within their original permissions, enhancing the system's defense against dynamic risks.
[0034] As Embodiment 3 of the present invention: Please refer to Figure 1 As shown, when the present application is specifically implemented, compared with Embodiment 1 and Embodiment 2, the technical solution of this embodiment lies in combining the solutions of the above Embodiment 1 and Embodiment 2. The difference between the technical solution of this embodiment and Embodiment 1 and Embodiment 2 is only that in this embodiment, conflict resolution and permission control are coordinated, and the specific method is as follows: When a priority conflict occurs in the operation log merge, that is, P0 = P i then a secondary judgment is made based on the permission evaluation value G0 of the current user and other users G i for a secondary judgment:
[0035] In this embodiment, for example, when two users modify the same data simultaneously, the current user E0 = 0.7 and other users E i = 0.5, then the operation of the current user is retained.
[0036] Embodiment 3 improves the reliability and security of multi-user interaction through the collaborative mechanism of conflict resolution and permission control: Secondary decision-making for priority conflicts: In the operation log merge, when there is a user priority conflict, the permission evaluation value is introduced for secondary judgment, and the operations of high-privilege users are preferentially retained to ensure the consistency of data control rights and responsibility permissions, and to avoid decision-making biases caused by static priority configurations.
[0037] Deep integration of security policies: Embed the permission evaluation value into the conflict resolution process to form a closed loop of "conflict detection → permission verification → operation retention": not only strengthen the legality of data operations using the permission dimension, but also adapt to the permission changes of different users in different scenarios through the real-time calculation of dynamic permission values, improving the rationality of system decisions.
[0038] Fallback mechanism for manual selection: If the permission evaluation values are the same, trigger manual selection by the user to avoid possible misjudgments in automatic system decisions, ensure the accuracy of critical operations, and balance automation efficiency and manual controllability.
[0039] As Embodiment 4 of the present invention: Please refer to Figure 1As shown, in the specific implementation of this application, compared with Embodiment 1, Embodiment 2, and Embodiment 3, the technical solution of this embodiment lies in combining the solutions of the above-mentioned Embodiment 1, Embodiment 2, Embodiment 3, and Embodiment 4 for implementation.
[0040] Through the combined implementation of the overall solution in Embodiment 4, comprehensive optimization of data consistency, operation security, and collaboration efficiency in multi-user interaction scenarios has been achieved: Three-dimensional conflict management system: Integrating version control, timestamp sorting, operation type logic processing, and permission-driven priority decision-making to form a multi-level conflict resolution link: from quickly filtering conflict-free operations with optimistic locks, to log merging for handling version inconsistency scenarios, and then to permission collaboration for resolving complex priority conflicts, covering various concurrent problems from simple to complex.
[0041] Global penetration of dynamic permissions: Permission evaluation factors are not only used to control operation permissions but also deeply involved in the conflict resolution process, upgrading the permission system from "static access control" to "dynamic behavior supervision".
[0042] System-level performance and security balance: Optimistic locks reduce lock contention, log merging algorithms reduce manual intervention, dynamic permissions reduce the risk of unauthorized access, and the collaboration mechanism avoids policy conflicts. The overall solution maintains low latency and high throughput in high-concurrency scenarios, while meeting the compliance requirements of data-security-sensitive industries such as finance and healthcare, and has broad applicability and technological leadership.
[0043] It should be stated that all user data collected in this application is collected with the consent and authorization of the users, and the uses of the user data are legal and compliant, and the use and processing of the user data comply with the relevant laws, regulations, and standards of the relevant regions.
[0044] The above formulas are all dimensionless and take their numerical values for calculation. The formulas are obtained by collecting a large amount of data for software simulation to obtain a formula that is closest to the actual situation. The preset parameters and threshold selections in the formulas are set by those skilled in the art according to the actual situation.
[0045] The above is only the specific implementation manner of this application, but the protection scope of this application is not limited thereto. Any person skilled in the art within the technical scope disclosed by this application can easily think of changes or substitutions, which should all be covered within the protection scope of this application. Therefore, the protection scope of this application should be subject to the protection scope of the claims.
Claims
1. A multi-party interaction method based on a data application and visualization system, characterized in that, It includes the following steps: Synchronization operation conflict resolution: When multiple users edit the same data set simultaneously, by defining a version number for each data object and using the optimistic locking mechanism to determine whether the data has been modified by other users; If the version numbers are the same, the operation is allowed to be executed and the version number is updated; If they are different, an operation log merging algorithm is triggered, which merges operations based on the timestamp order of the operation logs. For the timestamp conflict scenario, it is processed separately according to whether the operation types are the same and the version number is updated; Permission and data security control: Construct a user-role mapping table and a role-permission mapping table, aggregate the user permissions into the union of the permissions corresponding to the assigned roles, and then based on the predefined permission evaluation factors and combined with the preset weights, calculate the permission evaluation value. After that, according to the comparison result between the permission evaluation value and the preset threshold, dynamically control the user operation permissions; Coordination of conflict resolution and permission control: During the operation log merging process, when there is a user priority conflict, the permission evaluation value is introduced for secondary judgment, which compares the permission evaluation values of the current user and other users and preferentially retains the operations of the user with a higher permission evaluation value.
2. The multi-party interaction method based on a data application and visualization system according to claim 1, characterized in that, The specific method of synchronization operation conflict resolution is as follows: Step A1: Define a version number V for each data object and set its initial value to 0; When the user operates on a data object, the operation request contains the current version number V of the current data object current ; Step A2: Execute the optimistic locking mechanism; The user initiates an operation request Q; among them, the operation type, operation data, and the current version number V are carried in the operation request current ; Query the actual version number V of the corresponding data object in the database according to the operation request actual ; Compare V current with V actual : If V current = V actual , it indicates that during the period from when the current user initiates a request to when the server receives the request, the data corresponding to the data object has not been modified by other users, and the operation request Q is allowed to be executed; After the operation request is executed, update the version number V of the data object to V new =V actual +1; If V current ≠ V actual , it indicates that the data corresponding to the data object has been modified by other users, thereby triggering the operation log merging algorithm; Step A3: Execute the operation log merging algorithm; Extract the operation logs of each user from the data objects modified by other users, and record them as Y i ={Q ij}, and at the same time extract the operation logs of the current user's operations on the data object, and record them as Y0={Q 0j}; Among them, i represents the serial number of other users who modify the data object, j represents the serial number of the corresponding operation log of the user, and both i and j are variables; Extract the timestamps of each operation log from all users' operation logs in the data object; Subsequently, the time stamps corresponding to Y i ={Q ij} and Y0={Q 0j} are respectively marked as T ij and T 0j ; Initialize and merge all users' operation logs Y according to the time trend of the timestamps corresponding to each operation log z ; Traverse Y0 and Y in real time i ; Compare Y0 and Y i with their respective timestamps T 0j and T ij ; If T 0j <T ij , then add Q 0j to Y z ; If T 0j > T ij , then add Q ij to Y z ; If T 0j = T ij , further processing is performed according to the operation type as follows: When Y0 and Y i correspond to the same operation type and the operation data is consistent, only one operation is retained and added to Y z ; When Y0 and Y i correspond to the same operation type but different operation data, the user priority strategy is adopted; First, set a priority for the current user and others respectively, and denote them as P0 and P i ; If P0 < P i , then add Q 0j to Y z ; If P0 > P i , then add Q ij to Y z ; If P0 = P i , a conflict prompt is sent to the current user, and the current user manually selects the operations to be retained; When Y0 and Y i correspond to different operation types, they are processed according to the logical relationships preset according to the operation types; After the traversal ends, perform the operations in Y z in sequence, and update the version number of the data object to V new =V actual +1 + the number of merge operations.
3. A multi-party interaction method based on a data application and visualization system according to claim 2, characterized in that, Among them, The operation types include insert, delete, and modify; The predefined logical relationship is as follows: If Y0 and Y i The corresponding operation types are one for insertion and one for deletion: If the insertion operation is performed before the deletion operation, the insertion operation is performed first, followed by the deletion operation, and the deletion operation is recorded in Y z ; If the insertion operation is performed after the deletion operation, the insertion operation is not executed, and the deletion operation is added to Y z ; If Y0 and Y i The corresponding operation types are one for modification and one for deletion: If the modification operation is performed before the deletion, the modified data is deleted, and only the deletion operation is recorded in Y z ; If the modify operation is executed after the delete operation, the data does not exist after the delete operation, and the modify operation is invalid, that is, the modify operation is ignored; If Y0 and Y i For the corresponding operation types, one is insertion and the other is modification, the operation finally executed shall prevail.
4. A multi-party interaction method based on a data application and visualization system according to claim 1, characterized in that, The specific method of permission and data security control is as follows: Step B1. Extract the user set U = {U t}, the role set R = {R g}, and the permission set E = {E k}; Among them, t represents all user serial numbers, g represents all role serial numbers, and k represents all permission serial numbers; Step B2: According to the job responsibilities and requirements of the user, assign roles to the user and establish a user-role mapping table M(UR), which represents the corresponding relationship between the user and the role; Among them, if user U t is assigned role R g , then record (U t , R g ) in M(UR); Step B3: According to the job responsibilities and requirements of the user, assign corresponding permissions to each role and establish a role-permission mapping table M(RE), which represents the corresponding relationship between the role and the permission; Among them, if the role R g is granted the permission E k , then (R g , E k ) is recorded in M(RE); Step B4: User permission assignment: Select a user U t ; First, by: , the role set R(U) of the user is determined; Subsequently, through: , the permission set E(U) of the user is determined; And so on, determine the permission sets of all users; Step B5: Dynamic adjustment of user permissions: Based on the RBAC model, introduce a dynamic permission adjustment mechanism; According to the predefined permission evaluation factors, extract the set of permission evaluation factors F = {F s}, where s represents the serial number of the predefined permission evaluation factor; At the same time, extract the preset weights βs corresponding to each permission evaluation factor; Then, through , the permission evaluation value G is calculated; Then compare the permission evaluation value G with the preset permission threshold Gy: If G≥Gy, allow the operation request that conforms to the user's corresponding permission set to be executed, and at the same time restrict the execution of the operation request that does not conform to the user's corresponding permission set; If G<Gy, restrict the execution of the user's corresponding operation request, which includes: restricting the execution of the operation request that conforms to the user's corresponding permission set.
5. A multi-party interaction method based on a data application and visualization system according to claim 4, characterized in that, Among them, The permission evaluation factors include the user's operation frequency factor, operation time factor, and operation location factor; The operation frequency factor is used to reflect the number of operations performed by the user per unit time; the operation time factor is used to evaluate whether the time when the operation occurs conforms to the normal working period; The operation location factor is used to verify whether the geographical location where the operation is initiated conforms to the normal working location.
6. The multi-party interaction method based on a data application and visualization system according to claim 5, characterized in that, Among them: Operation frequency factor = Number of operations in the current time period / Preset operation number threshold.
7. A multi-party interaction method based on a data application and visualization system according to claim 5, characterized in that, Among them: When evaluating that the time when the operation occurs is during the normal working period, the operation time factor takes a value of 1; When evaluating that the time when the operation occurs is during the overtime working period, the operation time factor takes a value of 0.7; When evaluating that the time when the operation occurs is neither during the normal working period nor during the overtime working period, the operation time factor takes a value of 0.2; When evaluating that the time when the operation occurs is during the restricted working period, the operation time factor takes a value of 0.
8. A multi-party interaction method based on a data application and visualization system according to claim 5, characterized in that, Among them: ; In the formula, FD represents the operation location factor, d represents the distance between the geographical location of the current operation and the preset normal working location, r is the radius of the allowable range of the normal working location, a circular area is delimited with radius r as the allowable range of the normal working location, and λ is a preset attenuation coefficient used to control the influence degree of the distance on the permission.
9. A multi-party interaction method based on a data application and visualization system according to claim 8, characterized in that, Among them, , (d x , d y ) refers to the geographical location of the current operation, (d x0 , d y0 ) refers to the normal working position.
10. A multi-party interaction method based on a data application and visualization system according to claim 1, characterized in that, In the secondary judgment, if the G value is the same, the user manual selection mechanism is triggered, and the user operation is retained through the user manual selection.
Citation Information
Patent Citations
Word document online collaborative editing method and system
CN108269063A
Conflict resolution method for configuration data synchronization of smart home
CN109660433A
Method and device for supporting online editing of financial documents and authenticity verification by multiple persons
CN113822024A
Multi-person online document-oriented real-time collaborative editing system and method
CN118798136A
Professional online collaborative editing method and system for hydropower project cost schemes
CN119720965A