A multi-party interaction method based on data application and visualization system

Abstract

The present invention relates to the technical field of multi-party interaction, and discloses a multi-party interaction method based on a data application and visualization system, comprising the steps of synchronous operation conflict resolution, authority and data security control, and conflict resolution and authority control collaboration; in terms of synchronous operation conflict resolution, the version number is combined with an optimistic locking mechanism to quickly determine whether the data has been modified, thereby avoiding performance overhead and improving response speed; the operation log merging algorithm handles conflicts based on timestamps, operation type logic and user priority, reduces manual intervention, and dynamically updates the version number; in terms of authority and data security control, the RBAC model is used to implement hierarchical authority management, and multi-dimensional evaluation factors are introduced to dynamically calculate authority values, and operations are flexibly controlled based on thresholds to enhance data security; in terms of conflict resolution and authority control collaboration, a secondary judgment of the authority evaluation value is introduced when priorities conflict, and manual selection is triggered when the authority values ​​are the same, thereby ensuring the rationality of the decision.

Description

Technical Field

[0001] The present invention relates to the technical field of multi-party interaction, and in particular to a multi-party interaction method based on a data application and visualization system. Background Art

[0002] With the increasing complexity of business and the growing demand for cross-departmental and cross-team collaboration, scenarios where multiple users simultaneously edit, analyze, and operate the same data set are becoming increasingly common. This poses severe challenges to the system's multi-party interaction capabilities, data consistency assurance, and security control mechanisms.

[0003] Traditional data interaction methods often lack effective conflict resolution mechanisms when faced with concurrent multi-user operations, leading to data inconsistencies, lost operations, or logical errors. For example, when multiple users modify the same data object simultaneously, if the system cannot promptly identify the order of operations and the type of conflict, the final data may be chaotic, affecting the continuity of business processes and the accuracy of decision-making.

[0004] In the field of data security, the traditional role-based access control model implements permission management through static mapping of predefined roles and permissions, which is difficult to adapt to dynamically changing business environments and user behaviors.

[0005] In existing multi-party interaction methods, conflict resolution and permission control are often designed as independent modules, lacking coordination and collaboration. For example, during the operation log merging process, conflicts are handled solely based on timestamps or simple priorities, without fully integrating the user's real-time permission status.

[0006] To address these issues, this paper proposes a multi-party interaction method that integrates synchronous operation conflict resolution, dynamic permission control, and a collaborative mechanism between the two. This solution aims to improve the reliability, security, and collaborative efficiency of data application and visualization systems in multi-party interaction scenarios, meeting the core needs 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 data application and visualization system, which solves the technical problems raised in the background technology.

[0008] The purpose of the present invention can be achieved through the following technical solutions:

[0009] A multi-party interaction method based on a data application and visualization system comprises the following steps:

[0010] Synchronous operation conflict resolution:

[0011] When multiple users edit the same dataset simultaneously, an optimistic locking mechanism is used to determine whether the data has been modified by other users by defining a version number for each data object.

[0012] 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.

[0013] Permission and data security control:

[0014] 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;

[0015] Conflict resolution and permission control collaboration:

[0016] 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.

[0017] As a further solution of the present invention, the specific method for resolving synchronization operation conflicts is as follows:

[0018] Step A1: define a version number V for each data object and set its initial value to 0;

[0019] When a user operates a data object, the operation request contains the current version number V of the current data object. current ;

[0020] Step A2: Optimistic locking mechanism execution:

[0021] The user initiates an operation request Q, which carries the operation type, operation data, and current version number V. current ;

[0022] According to the operation request, query the actual version number V of the corresponding data object in the database actual ;

[0023] Compare V current With V actual :

[0024] 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;

[0025] After the operation request is completed, the version number V of the data object is updated to Vnew =V actual +1;

[0026] 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;

[0027] Step A3: Operation log merging algorithm execution:

[0028] In the data objects modified by other users, extract the operation logs of each user and record them as Y i ={Q ij}, and extract the operation log of the current user on the data object and record it as Y0={Q 0j};

[0029] Where i represents the serial number of other users who modified the data object, j represents the serial number of the operation log corresponding to the corresponding user, and both i and j are variables;

[0030] Extract the timestamp of each operation log from the operation logs of all users in the data object;

[0031] Then Y i ={Q ij} and Y0={Q 0j}The corresponding timestamps are marked as T ij and T 0j ;

[0032] Based on the time trend of the corresponding timestamps of each operation log, initialize and merge to obtain the operation log Y of all users z ;

[0033] Real-time traversal of Y0 and Y i ;

[0034] Compare Y0 and Y i The corresponding timestamps T 0j and T ij ;

[0035] If T 0j <T ij , which means that the current user's operation is before other users, then Q 0j Join Y z ;

[0036] If T 0j >T ij , which means that other users' operations are performed before the current user, then Q ij Join Y z ;

[0037] If T0j =T ij , further processing is performed according to the operation type, as follows:

[0038] When Y0 and Y i If the corresponding operation types are the same and the operation data are consistent, only one operation is retained and added to Y z ;

[0039] When Y0 and Y i For operations of the same type but with different data, the user priority strategy is used;

[0040] First, set a priority for the current user and others, and record them as P0 and P i ;

[0041] If P0<P i , then Q 0j Join Y z ;

[0042] If P0>P i , then Q ij Join Y z ;

[0043] If P0=P i , a conflict prompt is sent to the current user, and the current user manually selects the operation to be retained;

[0044] When Y0 and Y i If the corresponding operation types are different, they will be processed according to the pre-set logical relationship of the operation type;

[0045] After the traversal is completed, execute Y in sequence z The operation in the data object is updated to V new =V actual +1 + the number of merge operations.

[0046] As a further solution of the present invention: wherein the operation type includes insert, delete, and modify;

[0047] The preset logical relationships are as follows:

[0048] If Y0 and Y i The corresponding operation types are insert and delete:

[0049] If the insert operation is performed before the delete operation, the insert operation is performed first, then the delete operation is performed, and Y z The deletion operation is recorded in the

[0050] If the insert operation is performed after the delete operation, the insert operation is not performed and the delete operation is added to Yz ;

[0051] If Y0 and Y i The corresponding operation types are modification and deletion:

[0052] If the modification operation is performed before the deletion, the modified data is deleted and Y z Only delete operations are recorded;

[0053] If the modification operation is performed after deletion, the data does not exist after deletion and the modification operation is invalid, that is, the modification operation is ignored;

[0054] If Y0 and Y i The corresponding operation types are insert and modify, and the last operation performed will take precedence.

[0055] As a further solution of the present invention: the specific method of authority and data security control is as follows:

[0056] Step B1: Extract user set U={U t}、Role set R={R g}、Permission set E={E k};

[0057] Among them, t represents all user serial numbers, g represents all role serial numbers, and k represents all permission serial numbers;

[0058] Step B2: Assign roles to users based on their job responsibilities and needs, and create a user-role mapping table M(UR) that represents the correspondence between users and roles.

[0059] Among them, if user U t Assigned role R g , then record (U t ,R g );

[0060] Step B3: Assign corresponding permissions to each role based on the user's job responsibilities and needs, and establish a role-permission mapping table M(RE), which represents the correspondence between roles and permissions;

[0061] Among them, if the character R g Granted permission E k , then record (R g ,E k );

[0062] Step B4: User rights allocation:

[0063] Select a user U t ;

[0064] First pass: , determine the user's role set R (U);

[0065] Then through: , determine the user's permission set E (U);

[0066] And so on, determine the permission set of all users;

[0067] Step B5: Dynamically adjust user permissions:

[0068] Based on the RBAC model, a dynamic permission adjustment mechanism is introduced:

[0069] According to the predefined authority evaluation factors, extract the authority evaluation factor set F={F s}, where s refers to the predefined permission evaluation factor number;

[0070] At the same time, the preset weight βs corresponding to each permission evaluation factor is extracted;

[0071] Then pass , calculate the authority evaluation value G;

[0072] Then the authority evaluation value G is compared with the pre-set authority threshold Gy:

[0073] If G≥Gy, then the operation request that meets the user's corresponding permission set is allowed to execute, while the operation request that does not meet the user's corresponding permission set is restricted;

[0074] If G<Gy, then the execution of the operation request corresponding to the user is restricted, which includes: restricting the execution of the operation request that meets the corresponding permission set of the user.

[0075] As a further solution of the present invention: wherein, the authority evaluation factors include the user's operation frequency factor, operation time factor, and operation location factor;

[0076] The operation frequency factor is used to reflect the number of operations performed by the user in a unit of time; the operation time factor is used to evaluate whether the time when the operation occurs is consistent with the normal working hours;

[0077] The operation location factor is used to verify whether the geographical location where the operation is initiated is consistent with the normal working location.

[0078] As a further embodiment of the present invention:

[0079] Operation frequency factor = number of operations in the current time period / preset operation number threshold;

[0080] As a further embodiment of the present invention:

[0081] When the evaluation operation occurs during normal working hours, the operation time factor is 1;

[0082] When the evaluation operation occurs during the overtime working period, the operation time factor is 0.7;

[0083] When the time when the evaluation operation occurs is neither during normal working hours nor during overtime working hours, the operation time factor is 0.2;

[0084] When the time when the evaluation operation occurs is within the restricted working period, the operation time factor is 0;

[0085] As a further embodiment of the present invention:

[0086] ;

[0087] Where FD refers to the operation location factor, d refers to the distance between the current operation location and the preset normal working position, r is the radius of the allowable range of the normal working position, and the circular area with radius r is the allowable range of the normal working position. λ is a preset attenuation coefficient used to control the degree of influence of distance on authority.

[0088] As a further embodiment of the present invention: , (d x , d y ) refers to the geographical location of the current operation, (d x0 , d y0 ) refers to the normal working position.

[0089] As a further solution of the present invention: in the secondary judgment, if the G values ​​are the same, a user manual selection mechanism is triggered, which retains the user operation through the user's manual selection.

[0090] Beneficial effects of the present invention:

[0091] This invention defines a version number for each data object and incorporates an optimistic locking mechanism to ensure rapid determination of data modifications during concurrent editing by multiple users. When the version numbers match, operations are directly executed and the version is updated, avoiding the performance overhead of traditional locking mechanisms and improving system responsiveness. The version number update rule ensures the sequential and unique nature of operations, reducing the probability of conflicts at the source.

[0092] This invention merges operation logs based on timestamp order, ensuring that operations are executed according to the actual time sequence, which is intuitive for users. Timestamp conflicts are automatically handled based on pre-set logic for the operation type, reducing manual intervention costs. For operations of the same type but data conflicts, the higher-priority operation is automatically retained based on user priority. If the priorities are the same, manual selection is triggered, balancing automation and flexibility.

[0093] The present invention aggregates user permissions into the union of role permissions through a two-layer mapping table of "user-role-authority", realizes hierarchical management and batch allocation of permissions, simplifies the complexity of permission configuration, and is particularly suitable for multi-user scenarios with complex organizational structures. It introduces multi-dimensional evaluation factors such as operation frequency, time, and location, and combines weights to calculate the permission evaluation value to achieve dynamic adjustment of permissions. The comparison result of the permission evaluation value and the threshold directly controls the operation permission, realizing the "least permission principle". Users with high evaluation values ​​have more operation permissions, and users with low evaluation values ​​are restricted or even prohibited from operations within their original permissions, thereby enhancing dynamic defense capabilities.

[0094] The present invention, during the operation log merging process, when user priorities conflict, introduces permission evaluation values ​​for secondary judgment, giving priority to retaining the operations of high-authority users to ensure that data control rights are consistent with responsibility permissions. If the permission evaluation values ​​are the same, a manual selection mechanism is triggered to avoid misjudgments that may be caused by automatic system decisions, thereby ensuring the accuracy of key operations. From conflict prevention, i.e. version control), conflict detection, i.e. optimistic locking, conflict resolution, i.e. log merging, to dynamic calibration of permissions, a complete security control chain is formed, which not only ensures the smoothness of multi-user collaboration, but also prevents unauthorized operations and data abuse through deep intervention in the permission dimension, meeting the needs of data security-sensitive scenarios such as finance and medical care.

[0095] In this invention, the optimistic locking and log merging algorithm reduces lock contention and blocking, is more suitable for high-concurrency scenarios than pessimistic locking, and improves system throughput and response speed. The permission evaluation factor can be customized and extended, and the weight parameters can be dynamically adjusted to meet the security policy requirements of different industries. The role-permission mapping table supports dynamic updates, which makes it convenient for system administrators to quickly adjust permission configurations according to changes in the organizational structure. Automatic conflict resolution reduces user waiting time, and the manual selection mechanism gives users control in complex conflicts, improving operational transparency and trust. The visualization system can provide real-time feedback on operation status based on the permission evaluation results to guide users to comply with regulations.

[0096] Through the three-dimensional solution of "version control + intelligent merging + dynamic permissions", this invention achieves a balance between data consistency, operational security, and collaborative efficiency in multi-user interaction scenarios. It is particularly suitable for scenarios such as data visualization analysis, collaborative office platforms, and supply chain management systems that require real-time collaboration among multiple people, providing reliable technical support for enterprise-level data applications. BRIEF DESCRIPTION OF THE DRAWINGS

[0097] The present invention will be further described below with reference to the accompanying drawings.

[0098] 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

[0099] 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.

[0100] As embodiment 1 of the present invention:

[0101] See also Figure 1 As shown, the present invention is a multi-party interaction method based on data application and visualization system, comprising:

[0102] When multiple users edit the same dataset simultaneously, conflict resolution is performed on their synchronization operations:

[0103] Conflict resolution uses a hybrid conflict resolution strategy that combines an optimistic locking mechanism with an operation log merging algorithm.

[0104] Step A1: define a version number V for each data object and set its initial value to 0;

[0105] When a user operates a data object, the operation request contains the current version number V of the current data object. current ;

[0106] Step A2: Optimistic locking mechanism execution:

[0107] The specific steps are as follows:

[0108] Step A2.1: The user initiates an operation request Q;

[0109] The operation request carries the operation type, operation data, and current version number V current ;

[0110] Among them, the operation types include insert, delete, and modify;

[0111] 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 ;

[0112] Step A2.3: Compare V current With V actual :

[0113] 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;

[0114] After the operation request is completed, the version number V of the data object is updated to V new =V actual +1;

[0115] 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;

[0116] Step A3: Operation log merging algorithm execution:

[0117] The specific steps are as follows:

[0118] Step A3.1: Extract the operation log of each user from the data objects modified by other users and record it as Y i ={Q ij}, and extract the operation log of the current user on the data object and record it as Y0={Q 0j};

[0119] Where i represents the serial number of other users who modified the data object, j represents the serial number of the operation log corresponding to the corresponding user, and both i and j are variables;

[0120] Step A3.2: Extract the timestamp of each operation log from the operation logs of all users in the data object;

[0121] Then Y i ={Q ij} and Y0={Q 0j}The corresponding timestamps are marked as T ij and T 0j ;

[0122] Step A3.3: Based on the time trend of the corresponding timestamps of each operation log, initialize and merge to obtain the operation log Y of all users z ;

[0123] Step A3.4: Real-time traversal of Y0 and Y i ;

[0124] Compare Y0 and Y i The corresponding timestamps T 0j and T ij ;

[0125] If T 0j <T ij, which means that the current user's operation is before other users, then Q 0j Join Y z ;

[0126] If T 0j >T ij , which means that other users' operations are performed before the current user, then Q ij Join Y z ;

[0127] If T 0j =T ij , further processing is performed according to the operation type, as follows:

[0128] When Y0 and Y i If the corresponding operation types are the same and the operation data are consistent, only one operation is retained and added to Y z ;

[0129] When Y0 and Y i For operations of the same type but with different data, the user priority strategy is used;

[0130] First, set a priority for the current user and others, and record them as P0 and P i ;

[0131] If P0<P i , then Q 0j Join Y z ;

[0132] If P0>P i , then Q ij Join Y z ;

[0133] If P0=P i , a conflict prompt is sent to the current user, and the current user manually selects the operation to be retained;

[0134] When Y0 and Y i If the corresponding operation types are different, they will be processed according to the pre-set logical relationship of the operation type;

[0135] in:

[0136] If Y0 and Y i The corresponding operation types are insert and delete:

[0137] If the insert operation is performed before the delete operation, the insert operation is performed first, then the delete operation is performed, and Y z The deletion operation is recorded in the

[0138] If the insert operation is performed after the delete operation, the insert operation is not performed and the delete operation is added to Y z ;

[0139] If Y0 and Y i The corresponding operation types are modification and deletion:

[0140] If the modification operation is performed before the deletion, the modified data is deleted and Y z Only delete operations are recorded;

[0141] If the modification operation is performed after deletion, the data does not exist after deletion and the modification operation is invalid, that is, the modification operation is ignored;

[0142] If Y0 and Y i The corresponding operation types are insert and modify, and the last operation performed will prevail.

[0143] After the traversal is completed, execute Y in sequence z The operation in the data object is updated to V new =V actual +1 + the number of merge operations.

[0144] Example 1 uses a hybrid conflict resolution strategy, namely optimistic locking + operation log merging algorithm, to solve the data consistency problem when multiple users concurrently edit the same data set:

[0145] Version control and optimistic locking mechanism: Define version numbers for data objects and combine them with optimistic locking to avoid the performance loss of traditional locking mechanisms and achieve fast conflict detection: when the version numbers are consistent, directly execute operations and update the version to improve system response speed; when the version numbers are inconsistent, trigger log merging to reduce invalid operation blocking.

[0146] Time-driven intelligent merging algorithm: Merges operation logs based on timestamp sequence to ensure execution according to the actual operation sequence. When timestamp conflicts occur, they are automatically handled according to the preset logic of the operation type, reducing manual intervention and improving conflict resolution efficiency. The user priority strategy is combined with a manual selection mechanism to achieve a balance between automation and flexibility when resolving operation data conflicts.

[0147] Dynamic version number update rules: After the merge operation, the version number is updated according to the "V actual +1+Merge Operation Number" has been updated to clearly record operation history, facilitate data traceability and auditing, and enhance system maintainability.

[0148] As the second embodiment of the present invention:

[0149] See also Figure 1As shown, in the specific implementation of this application, compared with Example 1, the technical solution of this embodiment differs from that of Example 1 only in that in this embodiment, the authority and data security control are:

[0150] Adopting an extended role-based access control model and combining it with a dynamic permission evaluation strategy, we can dynamically manage different user permissions:

[0151] Step B1: Extract user set U={U t}、Role set R={R g}、Permission set E={E k};

[0152] Among them, t represents all user serial numbers, g represents all role serial numbers, and k represents all permission serial numbers;

[0153] Step B2: Assign roles to users based on their job responsibilities and needs, and create a user-role mapping table M(UR) that represents the correspondence between users and roles.

[0154] In this embodiment, if user U t Assigned role R g , then record (U t ,R g );

[0155] Step B3: Assign corresponding permissions to each role based on the user's job responsibilities and needs, and establish a role-permission mapping table M(RE), which represents the correspondence between roles and permissions;

[0156] In this embodiment, if the character R g Granted permission E k , then record (Rg,E k );

[0157] Step B4: User rights allocation:

[0158] Select a user U t ;

[0159] First pass: , determine the user's role set R (U);

[0160] Then through: , determine the user's permission set E (U);

[0161] In this embodiment, it is assumed that the role sets corresponding to user U1 are R2 and R3;

[0162] Among them: the permission set corresponding to R2 is {E5,E7}, and the permission set corresponding to R3 is {E7,E9};

[0163] Then: E(U1)={E5,E7}∪{E7,E9}={E5,E7,E9};

[0164] And so on, determine the permission set of all users;

[0165] Step B5: Dynamically adjust user permissions:

[0166] Based on the RBAC model, a dynamic permission adjustment mechanism is introduced:

[0167] According to the predefined authority evaluation factors, extract the authority evaluation factor set F={F s};

[0168] Where s refers to the predefined permission evaluation factor number;

[0169] In this embodiment, the authority evaluation factors include but are not limited to the user's operation frequency factor, operation time factor, and operation location factor;

[0170] The operation frequency factor is used to reflect the number of operations performed by the user in a unit of time;

[0171] in:

[0172] Operation frequency factor = number of operations in the current time period / preset operation threshold

[0173] The operation time factor is used to assess whether the time when the operation occurs is consistent with the normal working hours;

[0174] in:

[0175] When the evaluation operation occurs during normal working hours, the operation time factor is 1;

[0176] When the evaluation operation occurs during the overtime working period, the operation time factor is 0.7;

[0177] When the time when the evaluation operation occurs is neither during normal working hours nor during overtime working hours, the operation time factor is 0.2;

[0178] When the time when the evaluation operation occurs is within the restricted working period, the operation time factor is 0;

[0179] The operation location factor is used to verify whether the geographical location where the operation is initiated is consistent with the normal working location;

[0180] in:

[0181]

[0182] Where FD refers to the operation location factor, d refers to the distance between the current operation location and the preset normal working location, r is the radius of the allowable range of the normal working location, and the circular area with radius r is the allowable range of the normal working location. λ is a preset attenuation coefficient used to control the degree of influence of distance on authority.

[0183] in: , (d x , d y ) refers to the geographical location of the current operation, (d x0 , d y0 ) refers to the normal working position; λ = 0.1 / m, which means that for every 1 meter increase in distance, the authority decreases exponentially by 0.1 times;

[0184] At the same time, the preset weight βs corresponding to each permission evaluation factor is extracted;

[0185] Then pass , calculate the authority evaluation value G;

[0186] Then the authority evaluation value G is compared with the pre-set authority threshold Gy:

[0187] If G≥Gy, then the operation request that meets the user's corresponding permission set is allowed to execute, while the operation request that does not meet the user's corresponding permission set is restricted;

[0188] If G<Gy, then the execution of the operation request corresponding to the user is restricted, which includes: restricting the execution of the operation request that meets the corresponding permission set of the user.

[0189] Example 2 implements refined data security control based on the role-based access control (RBAC) extended model and dynamic permission evaluation strategy:

[0190] Hierarchical permission management architecture: Through the "user-role-permission" two-layer mapping table, user permissions are aggregated into the union of role permissions, simplifying the complexity of permission configuration. It is suitable for enterprise scenarios with changing organizational structures and supports batch permission allocation and dynamic adjustment.

[0191] Multi-dimensional dynamic permission evaluation: Introducing evaluation factors such as operation frequency, time, and location, and combining weights to calculate the permission evaluation value:

[0192] The operation frequency factor quantifies the risk of abnormal operations and promptly identifies suspicious behavior through "current operation count / preset threshold";

[0193] The operation time factor distinguishes between working hours, overtime hours, non-working hours and restricted hours, restricting operations during unauthorized hours and reducing the risk of data leakage;

[0194] The operation location factor dynamically calculates permissions based on geographic distance and attenuation coefficient, prohibits unauthorized access from other locations, and complies with data security compliance requirements.

[0195] Dynamic permission calibration mechanism: By comparing permission evaluation values ​​with thresholds, 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 operations within their original permissions, thereby enhancing the system's defense capabilities against dynamic risks.

[0196] As the third embodiment of the present invention:

[0197] See also Figure 1 As shown, in the specific implementation of this application, compared with Example 1 and Example 2, the technical solution of this embodiment is to combine the solutions of Example 1 and Example 2. The difference between the technical solution of this embodiment and Example 1 and Example 2 is that in this embodiment, conflict resolution and permission control are coordinated, and the specific method is as follows:

[0198] When a priority conflict occurs in the operation log merge, that is, P0=P i When the current user's permission evaluation value G0 and other users G i Make a secondary judgment:

[0199]

[0200] In this embodiment, for example, two users modify the same data at the same time, the current user E0=0.7, and the other users E i =0.5, the current user operation is retained.

[0201] Example 3 improves the reliability and security of multi-user interaction through the collaborative mechanism of conflict resolution and permission control:

[0202] Secondary decision-making for priority conflicts: When user priorities conflict during operation log merging, permission evaluation values ​​are introduced for secondary judgment, giving priority to retaining operations of high-privilege users. This ensures that data control rights are consistent with responsibility permissions and avoids decision-making deviations caused by static priority configuration.

[0203] Deep integration of security policies: Embed permission assessment values ​​into the conflict resolution process to form a closed loop of "conflict detection → permission verification → operation retention": This not only uses the permission dimension to strengthen the legitimacy of data operations, but also adapts to the changes in permissions of different users in different scenarios through real-time calculation of dynamic permission values, thereby improving the rationality of system decisions.

[0204] Manual selection fallback mechanism: If the permission evaluation values ​​are the same, the user is triggered to manually select, avoiding possible misjudgments in the system's automatic decision-making, ensuring the accuracy of key operations, and balancing automation efficiency and manual controllability.

[0205] As the fourth embodiment of the present invention:

[0206] See also Figure 1 As shown, when the present application is implemented, compared with Example 1, Example 2 and Example 3, the technical solution of this embodiment is to combine and implement the solutions of the above-mentioned Example 1, Example 2, Example 3 and Example 4.

[0207] The fourth embodiment implements a comprehensive combination of solutions to achieve comprehensive optimization of data consistency, operational security, and collaborative efficiency in multi-user interaction scenarios:

[0208] A three-dimensional conflict management system: Integrating version control, timestamp sorting, operation type logic processing, and permission-driven priority decision-making, it forms a multi-level conflict resolution chain: from optimistic locking to quickly filter conflict-free operations, to log merging to handle version inconsistencies, to permission collaboration to resolve complex priority conflicts, covering all types of concurrency issues from simple to complex.

[0209] Global penetration of dynamic permissions: Permission assessment factors are not only used to control operational permissions, but also deeply intervene in the conflict resolution process, upgrading the permission system from "static access control" to "dynamic behavior supervision."

[0210] Balance of system-level performance and security: Optimistic locking reduces lock contention, log merging algorithms reduce manual intervention, dynamic permissions reduce the risk of unauthorized access, and collaborative mechanisms avoid 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, demonstrating broad applicability and technological leadership.

[0211] It should be stated that all user data collected in this application is collected with the user's consent and authorization, and the use of user data is legal and compliant, and the use and processing of user data complies with the relevant laws, regulations and standards of the relevant regions.

[0212] The above formulas are all dimensionless and numerical calculations. The formulas are obtained by collecting a large amount of data and performing software simulation to obtain the most recent real situation. The preset parameters and thresholds in the formulas are set by technicians in this field according to actual conditions.

[0213] The above description is merely a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in this application should be included in the scope of protection of this application. Therefore, the scope of protection of this application should be based on the scope of protection of the claims.

Claims

1. A multi-party interaction method based on data application and visualization system, characterized in that: The following steps are involved: Synchronous operation conflict resolution: When multiple users edit the same dataset simultaneously, an optimistic locking mechanism is used to determine whether the data has been modified by other users by defining a version number for each data object. If the version numbers are consistent, the operation is allowed and the version number is updated; If there is any inconsistency, the operation log merge algorithm is triggered. It merges operations based on the timestamp order of the operation logs. In the case of timestamp conflicts, it handles them separately according to 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.

2. A multi-party interaction method based on a data application and visualization system according to claim 1, characterized in that: The specific methods for resolving synchronization operation conflicts are 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: In the data objects modified by other users, extract the operation logs of each user and record them as Y i ={Q ij }, and extract the operation log of the current user on the data object and record it as Y0={Q 0j }; Where i represents the serial number of other users who modified the data object, j represents the serial number of the operation log corresponding to the corresponding user, and both i and j are variables; Extract the timestamp of each operation log from the operation logs of all users in the data object; Then Y i ={Q ij } and Y0={Q 0j }The corresponding timestamps are marked as T ij and T 0j ; Based on the time trend of the corresponding timestamps of each operation log, initialize and merge to obtain the operation log Y of all users z ; Real-time traversal of Y0 and Y i ; Compare Y0 and Y i The corresponding timestamps T 0j and T ij ; If T 0j <T ij , then Q 0j Join Y z ; If T 0j >T ij , then Q ij Join Y z ; If T 0j =T ij , further processing is performed according to the operation type, as follows: When Y0 and Y i If the corresponding operation types are the same and the operation data are consistent, only one operation is retained and added to Y z ; When Y0 and Y i For operations of the same type but with different data, the user priority strategy is used; First, set a priority for the current user and others, and record them as P0 and P i ; If P0<P i , then Q 0j Join Y z ; If P0>P i , then Q ij Join Y z ; If P0=P i , a conflict prompt is sent to the current user, and the current user manually selects the operation to be retained; When Y0 and Y i If the corresponding operation types are different, they will be processed according to the pre-set logical relationship of the operation type; After the traversal is completed, execute Y in sequence z The operation in the data object is updated to V new =V actual +1 + the number of merge operations.

3. The multi-party interaction method based on the data application and visualization system according to claim 2, characterized in that: in, Operation types include insert, delete, and modify; The preset logical relationships are as follows: If Y0 and Y i The corresponding operation types are insert and delete: If the insert operation is performed before the delete operation, the insert operation is performed first, then the delete operation is performed, and Y z The deletion operation is recorded in the If the insert operation is performed after the delete operation, the insert operation is not performed and the delete operation is added to Y z ; If Y0 and Y i The corresponding operation types are modification and deletion: If the modification operation is performed before the deletion, the modified data is deleted and Y z Only delete operations are recorded; If the modification operation is performed after deletion, the data does not exist after deletion and the modification operation is invalid, that is, the modification operation is ignored; If Y0 and Y i The corresponding operation types are insert and modify, and the last operation performed will take precedence.

4. The multi-party interaction method based on the data application and visualization system according to claim 1, characterized in that: The specific methods of permission and data security control are as follows: Step B1: Extract user set U={U t }、Role set R={R g }、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: Assign roles to users based on their job responsibilities and needs, and create a user-role mapping table M(UR) that represents the correspondence between users and roles. Among them, if user U t Assigned role R g , then record (U t ,R g ); Step B3: Assign corresponding permissions to each role based on the user's job responsibilities and needs, and establish a role-permission mapping table M(RE), which represents the correspondence between roles and permissions; Among them, if the character R g Granted permission E k , then record (R g ,E k ); Step B4: User rights allocation: Select a user U t ; First pass: , determine the user's role set R (U); Then through: , determine the user's permission set E (U); And so on, determine the permission set of all users; Step B5: Dynamically adjust user permissions: Based on the RBAC model, a dynamic permission adjustment mechanism is introduced: According to the predefined authority evaluation factors, extract the authority evaluation factor set F={F s }, where s refers to the predefined permission evaluation factor number; At the same time, the preset weight βs corresponding to each permission evaluation factor is extracted; Then pass , calculate the authority evaluation value G; Then the authority evaluation value G is compared with the pre-set authority threshold Gy: If G≥Gy, then the operation request that meets the user's corresponding permission set is allowed to execute, while the operation request that does not meet the user's corresponding permission set is restricted; If G<Gy, then the execution of the operation request corresponding to the user is restricted, which includes: restricting the execution of the operation request that meets the corresponding permission set of the user.

5. The multi-party interaction method based on the data application and visualization system according to claim 4, characterized in that: in, Permission evaluation factors include user 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 in a unit of time; the operation time factor is used to evaluate whether the time when the operation occurs is consistent with the normal working hours; The operation location factor is used to verify whether the geographical location where the operation is initiated is consistent with the normal working location.

6. The multi-party interaction method based on the data application and visualization system according to claim 5, characterized in that: in: Operation frequency factor = number of operations in the current time period / preset operation number threshold.

7. The multi-party interaction method based on data application and visualization system according to claim 5, characterized in that: in: When the evaluation operation occurs during normal working hours, the operation time factor is 1; When the evaluation operation occurs during the overtime working period, the operation time factor is 0.7; When the time when the evaluation operation occurs is neither during normal working hours nor during overtime working hours, the operation time factor is 0.2; When the evaluation operation occurs during the restricted working period, the operation time factor is 0.

8. The multi-party interaction method based on data application and visualization system according to claim 5, characterized in that: in: ； Where FD refers to the operation location factor, d refers to the distance between the current operation location and the preset normal working position, r is the radius of the allowable range of the normal working position, and the circular area with radius r is the allowable range of the normal working position. λ is a preset attenuation coefficient used to control the degree of influence of distance on authority.

9. The multi-party interaction method based on the data application and visualization system according to claim 8, characterized in that: in, , (d x , d y ) refers to the geographical location of the current operation, (d x0 , d y0 ) refers to the normal working position.

10. The multi-party interaction method based on data application and visualization system according to claim 4, characterized in that: In the secondary judgment, if the G values ​​are the same, the user manual selection mechanism is triggered, which retains the user operation through the user's manual selection.

Images