Data limited sharing method based on user permissions

Abstract

The application discloses a data limited sharing method based on user authority, relates to the technical field of resource sharing, and comprises the following steps: establishing a sharing node tree for each target file, wherein the sharing node tree comprises a plurality of authority nodes and transition nodes, and each node corresponds to a user; acquiring transition nodes in all sharing node trees in a database; acquiring the grade of the transition nodes in combination with the participation rate of the transition nodes; re-dividing the transition nodes whose grades satisfy a threshold into authority nodes; the authority nodes have sharing access authority for the target files; and dynamically dividing the node attributes of the users according to the target files, so that different authority users are allocated to each target file, the users can view the corresponding file content according to the different authorities, the calculation and communication in the information sharing process are more lightweight, the information resource sharing in each field is more flexible, efficient and practical, and the application has important field research significance and commercial application value.

Description

Technical Field

[0001] This invention belongs to the field of resource sharing technology, specifically a method for limited data sharing based on user permissions. Background Technology

[0002] With the development of internet data and the increasing maturity of big data technology, resource sharing has been gradually applied to cloud business processing. For example, Chinese patent CN103812904A provides a resource sharing method, as well as an electronic device and mobile terminal utilizing this method. The resource sharing method includes: receiving a resource sharing request from the mobile terminal; parsing the resource sharing request to obtain resource sharing feature quantities included in the request; setting predetermined completion conditions for the shared resource based on the resource sharing feature quantities, and treating the response to the resource sharing request as a task to be executed; when executing the task to be executed, providing the shared resource to the mobile terminal, allowing the mobile terminal to possess and use the shared resource; and releasing the mobile terminal from possessing the shared resource when the resource sharing completion conditions are met.

[0003] However, in achieving resource sharing, it is also necessary to establish access permissions for resources. For example, Chinese patent CN105610949B discloses a method, device, and system for sharing resource data usage permissions. It determines whether a first system account and a second system account are registered on the same type of operating system and have a friend relationship. If the first system account and the second system account are registered on the same type of operating system and have a friend relationship, then the access permission for the resource data to be shared is granted to the second system account. Based on the second system account, the description information of the resource data to be shared is pushed to the second mobile terminal, allowing the second mobile terminal to use the resource data according to the description information. Similarly, Chinese patent CN113691555A provides a technology for sharing information resources through a sharing code, and Chinese patent CN104299069A provides a method for cloud-based human resource data processing and sharing. The publishing device can only input information within its permissions, while the sharing device can only perform queries, ensuring data accuracy. Furthermore, both the publishing and sharing devices require identity verification upon login, ensuring data security.

[0004] The existing technologies mentioned above either use dynamic codes or device changes to limit resource sharing permissions, which are too simplistic. Therefore, a method for limited data sharing based on user permissions is provided. Summary of the Invention

[0005] This invention aims to solve at least one of the technical problems existing in the prior art; to this end, this invention proposes a data limited sharing method based on user permissions to solve the technical problem of permission setting when sharing resources. This invention solves the above-mentioned problem by dynamically changing the role of each user and corresponding to different node attributes.

[0006] To achieve the above objectives, an embodiment of the first aspect of the present invention provides a method for limited data sharing based on user permissions, comprising the following steps:

[0007] For each target file, a shared node tree is established, which includes several permission nodes and transition nodes, and each node corresponds to a user;

[0008] Retrieve all transition nodes in the shared node tree within the database, and determine the transition node level based on the participation rate of the transition nodes;

[0009] Transition nodes whose transition node levels meet the threshold will be reclassified as permission nodes.

[0010] The permission node has shared access permissions to the corresponding target file.

[0011] Furthermore, the method for establishing the shared node tree is as follows:

[0012] Choose any file and mark it as the target file;

[0013] Obtain the creation source of the target file and mark the user corresponding to the creation source as the original node; the creation source is the device corresponding to the upload of the target file.

[0014] The target file is split into N types of data information and M groups of sequentially arranged data source information according to different partitioning methods;

[0015] Department information is formed by acquiring N types of data and M groups of data sources arranged in order;

[0016] Based on N types of data information, obtain information about the data creators from the corresponding departments, and mark the obtained data creators as the first set of nodes to be shared;

[0017] Based on the data source information of group M, obtain all personnel information within the corresponding department and mark all personnel as the second set of nodes to be shared;

[0018] The same nodes to be shared in the first set of nodes to be shared and the second set of nodes to be shared are used as the upper-level nodes of the original node. The nodes to be shared in the first set of nodes to be shared and the second set of nodes to be shared, excluding the upper-level nodes, are used as the transition nodes of the original node. The original node and the corresponding upper-level node constitute the permission node of the target file.

[0019] Further, the method for splitting the target file is:

[0020] According to the types of information in the target file, the target file is divided into N types of data information, and the N types of data information include numerical data, text data and graphic data;

[0021] According to the departments that formed the data in the target file, the target file is divided into M groups of sequentially arranged data source information, and the M groups of data source information include information of each department that formed the data in the target file.

[0022] Further, the method for obtaining the transition node level is:

[0023] Obtain the total number P of all target files in the database and transition nodes in all shared node trees;

[0024] Randomly select a target file, obtain the total number of transition nodes corresponding to the target file, and mark it as G;

[0025] Randomly select a transition node from the shared node tree corresponding to the target file, and mark it as a sorting node;

[0026] Obtain the total number of occurrences of the sorting node in the database, and mark it as participation number J;

[0027] Obtain the total number of nodes in all shared node trees in the database, and mark it as total number of nodes Z;

[0028] The participation rate Cy of the transition node is:

[0029] wherein α and β are both preset values, α+β=1, and α≥β.

[0030] Further, the method for obtaining the transition node level in combination with the participation rate of the transition node is:

[0031] Randomly select a target file, and obtain the total number G of transition nodes corresponding to the target file;

[0032] Randomly select a transition node corresponding to the target file, and obtain the total number J of occurrences of the transition node in the database;

[0033] Level value

[0034] when DJ≥D11, mark the corresponding transition node as a first-level node;

[0035] when D12≤DJ<D11, mark the corresponding transition node as a second-level node;

[0036] when DJ<D12, mark the corresponding transition node as a third-level node;

[0037] Among them, D11 and D12 are preset values.

[0038] Furthermore, the method for re-dividing the transition nodes is as follows:

[0039] Obtain the number of first-level nodes corresponding to the target file and mark it as YJ;

[0040] Extract the transition nodes whose level values ​​are ranked in the top 30% from the first-level nodes of the target file and mark them as dynamic nodes;

[0041] Get the active time period corresponding to each dynamic node. The active time period is the time period when users access the database most frequently. The time period can be divided into 24 equal parts, and the access frequency is determined according to the number of accesses within the time period.

[0042] Select any dynamic node and label its corresponding level value as DDJ;

[0043] If the time when the dynamic node wants to view the target file during this database access is within the active time period, then the dynamic node's...

[0044] Otherwise, the boundary value of the dynamic node = DDJ;

[0045] The dynamic node with the largest threshold value is reclassified as a permission node;

[0046] Among them, QDJ max The maximum level value of dynamic nodes, excluding DDJ, and QDJ. min This is the minimum level value for dynamic nodes, excluding DDJ.

[0047] Compared with the prior art, the beneficial effects of the present invention are:

[0048] This invention establishes a shared node tree for each target file, comprising several permission nodes and transition nodes, with each node corresponding to a user. It retrieves all transition nodes from the shared node trees in the database and determines their levels based on their participation rates. Transition nodes whose levels meet a threshold are then reclassified as permission nodes. Permission nodes possess shared access permissions for the corresponding target files. The invention dynamically assigns user node attributes based on the target files, thus allocating different permission users to each target file. Users can view the corresponding file content according to their respective permissions, making computation and communication during information sharing more lightweight. This makes information resource sharing in various fields more flexible, efficient, and practical, possessing significant research value and commercial application potential. Attached Figure Description

[0049] Figure 1This is a flowchart of the data limited sharing method based on user permissions according to the present invention. Detailed Implementation

[0050] The technical solution of the present invention will be clearly and completely described below with reference to the embodiments. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0051] Please see Figure 1 This application provides a method for limited data sharing based on user permissions, including the following steps:

[0052] For each target file, a shared node tree is established, which includes several permission nodes and transition nodes, with each node corresponding to a user; as an embodiment of the present invention, preferably, the method for establishing the shared node tree is as follows:

[0053] Choose any file and mark it as the target file. The target file is any file in the database.

[0054] Obtain the creation source of the target file and mark the user corresponding to the creation source as the original node; the creation source is the device corresponding to the upload of the target file, such as mobile phone, computer, PAD, etc., one creation source corresponds to one user, which can be identified by the device's IP address and associated with the user's identity based on the IP address;

[0055] The target file is split into N types of data information and M groups of sequentially arranged data source information according to different division methods. As an embodiment of the present invention, preferably, the target file is divided into N types of data information according to the type of information in the target file, including numerical data, textual data, and chart data; and the target file is divided into M groups of sequentially arranged data source information according to the department from which the data in the target file is generated, including information about each department that generated the data in the target file.

[0056] Department information is formed by acquiring N types of data and M groups of data sources arranged in order;

[0057] Based on N types of data information, obtain information about the data creators from the corresponding departments, and mark the obtained data creators as the first set of nodes to be shared;

[0058] As an embodiment of the present invention, preferably, if the numeric data in the target file all come from user 0005, the text data comes from user 0031, user 0086, and user 0022, and the chart data comes from user 0162, then the nodes in the node set to be shared are the node set composed of user 0005, user 0031, user 0086, user 0022, and user 0162;

[0059] Based on the data source information of group M, obtain all personnel information within the corresponding department and mark all personnel as the second set of nodes to be shared; as an embodiment of the present invention, preferably, if the front-end data in the target file comes from the data acquisition department, the middle data comes from the data processing department, and the terminal data comes from the data analysis department, then the second set of nodes to be shared is the node set composed of all users in the data acquisition department, the data processing department, and the data analysis department. In addition, users can divide different sets of nodes to be shared according to the nature of their work and the nature of the file. The division method provided in this embodiment is only a representative example, and it is not limited to this in actual application.

[0060] The same nodes to be shared in the first set of nodes to be shared and the second set of nodes to be shared are used as the upper-level nodes of the original node. The nodes to be shared in the first set of nodes to be shared and the second set of nodes to be shared, excluding the upper-level nodes, are used as the transition nodes of the original node. The original node and the corresponding upper-level node constitute the permission node of the target file.

[0061] Retrieve all transition nodes in the shared node tree within the database, and determine the transition node level based on the participation rate of the transition nodes;

[0062] Transition nodes whose transition node levels meet the threshold will be reclassified as permission nodes.

[0063] Permission nodes have shared access permissions to the corresponding target files, dynamically classify user node attributes, and avoid problems with large communication and computation volumes, greatly simplifying access management.

[0064] As an embodiment of the present invention, preferably, the transition node level is obtained in the following way:

[0065] Get the total number P of all target files in the database, and the transition nodes in all shared node trees;

[0066] Choose any target file, obtain the total number of transition nodes corresponding to the target file, and mark it as G;

[0067] Select any transition node from the shared node tree corresponding to the target file and mark it as the unification node;

[0068] Obtain the total number of times the score-collecting node appears in the database, and mark it as the participation number J;

[0069] Obtain the total number of nodes in all shared node trees in the database, and mark it as the total number of nodes Z;

[0070] The participation rate Cy of a transition node is:

[0071] wherein α and β are both preset values, α+β=1, and α≥β.

[0072] As a preferred embodiment provided by the present invention, the method for obtaining the transition node level in combination with the participation rate of the transition node is:

[0073] Arbitrarily select a target file, and obtain the total number of transition nodes G corresponding to the target file;

[0074] Arbitrarily select a transition node corresponding to the target file, and obtain the total number of times J that the transition node appears in the database;

[0075] Level value

[0076] when DJ≥D11, mark the corresponding transition node as a first-level node;

[0077] when D12≤DJ<D11, mark the corresponding transition node as a second-level node;

[0078] when DJ<D12, mark the corresponding transition node as a third-level node;

[0079] wherein D11 and D12 are preset values.

[0080] As a preferred embodiment provided by the present invention, the method for re-dividing transition nodes is:

[0081] Obtain the number of first-level nodes corresponding to the target file, and mark it as YJ;

[0082] Obtain transition nodes whose level values rank in the top 30% from the first-level nodes corresponding to the target file, and mark them as dynamic nodes;

[0083] Obtain an active time period corresponding to each dynamic node, where the active time period is a time period with the highest frequency of users accessing the database, the time period can be equally divided into 24 parts, and the access frequency is determined according to the number of visits within the time period;

[0084] As a preferred embodiment provided by the present invention, mark the corresponding level value as DDJ;

[0085] if the time when the dynamic node wants to view the target file by accessing the database this time is within the active time period, the dynamic node's

[0086] Otherwise, the boundary value of the dynamic node = DDJ;

[0087] The dynamic node with the largest threshold value is reclassified as a permission node;

[0088] Among them, QDJ max The maximum level value of dynamic nodes, excluding DDJ, and QDJ. min This is the minimum level value for dynamic nodes, excluding DDJ.

[0089] The user-permission-based limited data sharing method establishes a shared node tree for each target file, including several permission nodes and transition nodes, with each node corresponding to a user. It retrieves all transition nodes from the shared node trees in the database and determines their levels based on their participation rates. Transition nodes whose levels meet a threshold are then reclassified as permission nodes. Permission nodes have shared access permissions for the corresponding target files. The method dynamically assigns different permission users to each target file based on the node attributes of the user.

[0090] The data in the above formula are all calculated by removing the dimensions and taking the numerical values. The formula is the closest to the real situation obtained by software simulation of a large amount of collected data. The preset parameters and preset thresholds in the formula are set by those skilled in the art according to the actual situation or obtained through simulation of a large amount of data.

[0091] The above embodiments are only used to illustrate the technical methods of the present invention and are not intended to limit it. Although the present invention has been described in detail with reference to preferred embodiments, those skilled in the art should understand that modifications or equivalent substitutions can be made to the technical methods of the present invention without departing from the spirit and scope of the technical methods of the present invention.

Claims

1. A method for limited data sharing based on user permissions, characterized in that: comprising the following steps: establishing a shared node tree for each target file, wherein the shared node tree comprises a plurality of permission nodes and transition nodes, and each node corresponds to one user; acquiring transition nodes in all shared node trees in a database, and acquiring transition node levels in combination with participation rates of the transition nodes; reclassifying transition nodes whose transition node levels meet a threshold as permission nodes; permission nodes have shared access rights to corresponding target files; the acquisition method of the transition node levels is: acquiring the total number P of all target files in the database and transition nodes in all shared node trees; selecting any target file, acquiring the total number of transition nodes corresponding to the target file, and marking the number as G; selecting any transition node from the shared node tree corresponding to the target file, and marking the transition node as a uniformly scored node; acquiring the total occurrence times of the uniformly scored node in the database, and marking the times as participation number J; acquiring the total number of nodes in all shared node trees in the database, and marking the number as total node number Z; The participation rate Cy of the transition node is: Cy = ; in, All are preset values, and , .

2. The data limited sharing method based on user permissions according to claim 1, characterized in that, the establishment method of the shared node tree is: selecting any file and marking the file as a target file; acquiring a creation source of the target file, and marking a user corresponding to the creation source as an original node; the creation source is a device corresponding to an uploaded target file; splitting the target file, and dividing the target file into N types of data information and M groups of sequentially arranged data source information according to different division manners; acquiring the N types of data information and the M groups of sequentially arranged data source information to form department information; acquiring information of data formers from corresponding departments according to the N types of data information, and marking the acquired data formers as a first to-be-shared node set; acquiring all personnel information in corresponding departments according to the M groups of data source information, and marking all personnel as a second to-be-shared node set; taking same to-be-shared nodes in the first to-be-shared node set and the second to-be-shared node set as upper-layer nodes of the original node, taking to-be-shared nodes except the upper-layer nodes in the first to-be-shared node set and the second to-be-shared node set as transition nodes of the original node, wherein the original node and corresponding upper-layer nodes constitute permission nodes of the target file.

3. The data limited sharing method based on user permissions according to claim 2, characterized in that, the splitting manner for the target file is: dividing the target file into N types of data information according to types of information in the target file, wherein the N types of data information comprise numerical data, text data and chart data; dividing the target file into M groups of sequentially arranged data source information according to departments where data of the target file is formed, wherein the M groups of data source information comprise information of various departments that form data in the target file.

4. The data limited sharing method based on user permissions according to claim 1, characterized in that, the method for acquiring transition node levels in combination with participation rates of transition nodes is: selecting any target file, acquiring the total number G of transition nodes corresponding to the target file; selecting any transition node corresponding to the target file, acquiring the total occurrence times J of the transition node in the database; Level value DJ = 0.683 * Cy + ; when DJ≥D11, marking the corresponding transition node as a first-level node; when D12≤DJ<D11, marking the corresponding transition node as a second-level node; when DJ<D12, marking the corresponding transition node as a third-level node; wherein D11 and D12 are preset values.

5. The data limited sharing method based on user permissions according to claim 4, characterized in that, the reclassification method for transition nodes is: Obtain the number of first-level nodes corresponding to the target file and mark it as YJ; Extract the transition nodes whose level values ​​are ranked in the top 30% from the first-level nodes of the target file and mark them as dynamic nodes; Get the active time period corresponding to each dynamic node. The active time period is the time period when users access the database most frequently. Select any dynamic node and label its corresponding level value as DDJ; If the time when a dynamic node accesses the database and wants to view the target file falls within an active time period, then the dynamic node's threshold value = DDJ* ; Otherwise, the boundary value of the dynamic node is DDJ; The dynamic node with the largest threshold value is reclassified as a permission node; in, This represents the maximum level value for dynamic nodes, excluding DDJ. This is the minimum level value for dynamic nodes other than DDJ.

Images