A Permission Control Propagation Method and System for a Knowledge Graph Based on Tree Tags

Abstract

The present invention discloses a permission control propagation method and system for a knowledge graph based on tree-shaped tags. A tag mapping relationship between symbol tags and logical tags in a preset industry is constructed to form at least one tag tree as the original knowledge graph, and the original knowledge graph is propagated for multi-user use; when the propagation mode is read-only, the user can only use the original knowledge graph; when the propagation mode is editable, the user edits the tag mapping relationship based on a copy of the original knowledge graph to upgrade the knowledge graph, and the upgraded knowledge graph and the original knowledge graph cannot be merged; user interaction operations are obtained, and the tag mapping relationship of the original knowledge graph is upgraded according to the user interaction operations. The present invention realizes the control of multiple propagations of the knowledge graph from the creator to the user by granting different usage permissions to the users, and protects the core logic of the creator by using the multiple mapping method of symbol tags and logical tags, which can simplify the underlying calculation logic and reduce the amount of calculation.

Description

Technical Field

[0001] The present invention relates to the field of data processing technology, and in particular to a method and system for propagating authority control based on a knowledge graph of tree tags. Background Art

[0002] The industry knowledge graph is based on the organization of industry knowledge. In the process of its continuous dissemination, people of various roles need to participate. The problem that follows is how to protect the underlying logic of the creators during the creation process. At the same time, it is also necessary to consider that users need to fine-tune or update the underlying logic in actual scenarios. Summary of the invention

[0003] Therefore, the permission control propagation method and system for the knowledge graph based on tree tags provided in the embodiments of the present invention prevents the leakage and tampering of the underlying logic of the knowledge graph by granting users read-only permissions; by granting users editing permissions, users can upgrade the original knowledge graph by obtaining user interaction operations, that is, the underlying logic can be fine-tuned.

[0004] In order to achieve the above object, the present invention provides the following technical solutions:

[0005] In a first aspect, an embodiment of the present invention provides a permission control propagation method based on a knowledge graph of tree tags, comprising:

[0006] Constructing a label mapping relationship between symbolic labels and logical labels of a preset industry to form at least one label tree as an original knowledge graph of the preset industry;

[0007] Propagate the original knowledge graph for multi-user use, in the following modes: read-only and editable;

[0008] When the propagation mode is read-only, users can only use the original knowledge graph; when the propagation mode is editable, users edit the label mapping relationship based on the copy of the original knowledge graph to upgrade the knowledge graph. The upgraded knowledge graph and the corresponding original knowledge graph cannot be merged;

[0009] Obtain user interaction operations and upgrade the label mapping relationship of the original knowledge graph based on the user interaction operations.

[0010] In one embodiment, the process of upgrading the knowledge graph includes: performing logical deduplication processing on the label mapping relationship, and the logical deduplication processing process includes: converting the matching conditions of all preset symbol labels into a string, calculating the hash value thereof as the fingerprint of the matching condition, and performing deduplication processing on the label mapping relationship.

[0011] In one embodiment, the label mapping relationship between the symbol label and the logical label is stored in a label mapping relationship table. The ways for a user to edit the label mapping relationship table of the original knowledge graph copy include: symbol editing processing, adding label processing, and deleting label processing.

[0012] In one embodiment, the process of adding label processing includes: if the Hash value after deduplication calculation does not exist in the label mapping relationship table, new logic is added to the label mapping relationship table; if the Hash value after deduplication calculation exists in the label mapping relationship table, only the symbol label is added, and the corresponding relationship between the symbol label and the logical label is recorded.

[0013] In one embodiment, the process of symbol editing processing includes: if only the name of the symbol label is modified, only the corresponding name field content in the label mapping relationship table is modified; if the logic of the logical label mapped by the symbol label is modified, a new logical label is added, and the mapping relationship between the symbol label and the new logical label is recorded in the label mapping relationship table.

[0014] In one embodiment, the process of deleting label processing includes: when the symbol label is deleted, whether it is the parent node or the child node of the tree, it is deleted from the label mapping relationship table; when no symbol label is mapped to the logical label, the logical label is deleted from the label mapping relationship table.

[0015] In one embodiment, the permission control propagation method for the knowledge graph based on tree-shaped labels further includes: reversely restoring the mapping relationship of the logical label according to the label mapping relationship, and displaying the attributes of the corresponding symbol label according to the user's requirements.

[0016] In a second aspect, an embodiment of the present invention provides a permission control propagation system for a knowledge graph based on tree-shaped labels, including: a knowledge graph construction module for constructing a label mapping relationship between symbol labels and logical labels in a preset industry to form at least one label tree as the original knowledge graph of the preset industry;

[0017] A knowledge graph processing module for propagating the original knowledge graph for multi-user use, and the propagation methods include: read-only and editable;

[0018] A knowledge graph propagation module for when the propagation method is read-only, the user can only use the original knowledge graph; when the propagation method is editable, the user edits the label mapping relationship based on the original knowledge graph copy to upgrade the knowledge graph, and the upgraded knowledge graph and the corresponding original knowledge graph cannot be merged;

[0019] A knowledge graph upgrade module for obtaining user interaction operations and upgrading the label mapping relationship of the original knowledge graph according to the user interaction operations.

[0020] In a third aspect, an embodiment of the present invention provides a computer device, including: at least one processor, and a memory communicatively connected to the at least one processor, wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to execute the permission control propagation method of the knowledge graph based on tree-shaped tags in the first aspect of the embodiments of the present invention.

[0021] In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium, which stores computer instructions for causing a computer to execute the permission control propagation method of the knowledge graph based on tree-shaped tags in the first aspect of the embodiments of the present invention.

[0022] The technical solution of the present invention has the following advantages:

[0023] The permission control propagation method and system of the knowledge graph based on tree-shaped tags provided by the present invention realize the control of various propagations of the knowledge graph from the creator to the user by granting different usage permissions to the user, and adopt a multiple mapping method of symbolic tags and logical tags to protect the core logic of the creator; adopt the reverse mapping method to restore the user's custom settings in a multi-user scenario; and can simplify the underlying calculation logic and reduce the amount of calculation. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] In order to more clearly illustrate the specific embodiments of the present invention or the technical solutions in the prior art, the following will briefly introduce the drawings required for use in the description of the specific embodiments or the prior art. Obviously, the drawings in the following description are some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0025] Figure 1 It is a flowchart of a specific example of the permission control propagation method of the knowledge graph based on tree-shaped tags provided in the embodiments of the present invention;

[0026] Figure 2 It is a demonstration diagram of the editing of the label mapping relationship table in the permission control propagation of the knowledge graph based on tree-shaped tags provided in the embodiments of the present invention;

[0027] Figure 3 It is a schematic diagram of a specific example of the logic table of the underlying logic and logical tags in the embodiments of the present invention;

[0028] Figure 4 It is a schematic diagram of a specific example of the label mapping relationship table between symbolic tags and logical tags in the embodiments of the present invention;

[0029] Figure 5 A module composition diagram of an example of a permission control propagation system based on a knowledge graph of tree tags provided in an embodiment of the present invention;

[0030] Figure 6 A composition diagram of a specific example of a computer device provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0031] The technical solution of the present invention will be described clearly and completely below 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 creative work are within the scope of protection of the present invention.

[0032] In addition, the technical features involved in the different embodiments of the present invention described below can be combined with each other as long as they do not conflict with each other.

[0033] Example 1

[0034] The embodiment of the present invention provides a permission control propagation method based on a knowledge graph of tree tags, such as Figure 1 As shown, the method comprises the following steps:

[0035] Step S1: construct a label mapping relationship between symbolic labels and logical labels of a preset industry to form at least one label tree as the original knowledge graph of the preset industry.

[0036] It should be noted that, generally based on industry knowledge, one or more tag trees are combined together to form a knowledge graph. Tags are atomic concepts in the knowledge graph. After the data is collected and the fields are standardized, the algorithm will add information such as entities, locations, positive and negative emotions to form standard data. By matching and filtering the title, content, author, entity, location, positive and negative fields of the standard data, qualified data can be screened out. As a preprocessing, a unique tag (tag ID) is further attached to it to facilitate user understanding and use, and to improve the real-time response speed of the search. A single tag can be regarded as a combination of some filtering conditions. Furthermore, tags with subordinate relationships are organized in a tree structure called a tag tree.

[0037] Step S2: disseminating the original knowledge graph for multi-user use, and the dissemination modes include: read-only and editable.

[0038] Step S3: When the propagation mode is read-only, the user can only use the original knowledge graph; when the propagation mode is editable, the user edits the label mapping relationship based on the copy of the original knowledge graph to upgrade the knowledge graph. The upgraded knowledge graph and the corresponding original knowledge graph cannot be merged.

[0039] In the embodiment of the present invention, the knowledge graph (Graph) produced by the creator (Owner) is only visible to himself without authorization; the creator can authorize the user to use it only (read-only, not editable) or allow the user to edit it based on the original label mapping relationship (further create a new knowledge graph Graph'), at which time the user also becomes a new creator (Owner').

[0040] It should be noted that propagation is authorized by the creator to the user (new creator), and the new creator can edit based on the copy of the original knowledge graph to further upgrade the knowledge graph (Graph>Graph'), and this process can be repeated to achieve the propagation of the knowledge graph (Graph>Graph'>Graph"). In the embodiment of the present invention, even if the knowledge graphs come from the same ancestor, they cannot be merged due to different experiences.

[0041] There are two situations in which the propagation of the original knowledge graph copy in the embodiment of the present invention is editable. One is that only the symbolic label can be modified, and the other is that both the symbolic label and the logical label can be modified at the same time. It can be set according to the actual situation.

[0042] Step S4: Obtain user interaction operations and upgrade the label mapping relationship of the original knowledge graph according to the user interaction operations.

[0043] In an embodiment of the present invention, the label mapping relationship of the original knowledge graph is upgraded by obtaining the user's front-end browser operation through the back-end. The upgrading process includes: performing logical deduplication processing on the label mapping relationship. The logical deduplication processing process includes: converting the matching conditions of all preset symbol labels into a string, calculating the hash value thereof as the fingerprint of the matching condition, and performing deduplication processing on the label mapping relationship.

[0044] In a specific implementation, during the data matching calculation process, the logical tag ID of all data that can match the conditions of title containing 'place a', content containing 'scenic spots', author being from place b, and number of comments greater than 10,000 is marked as 't1'; for the same matching conditions, user A customizes the symbol tag Symbol Tag ID's1', whose name is 'people from place b who travel to place a', while user B customizes the symbol tag Symbol Tag ID's2', whose name is 'attractions in place a that people from place b pay attention to'.

[0045] Among them, matching conditions such as title, content, author's location, number of comments, etc.

[0046]

[0047] After being converted into a string as a JSON, the MD5 algorithm is used to calculate the hash value, which serves as the fingerprint of the matching condition.

[0048] In the embodiment of the present invention, the above matching condition is used as the underlying logic, and the converted hash value is the logic tag. The underlying logic and the logic tag are stored in the logic table, that is, the corresponding relationship between the underlying logic and the logic tag is stored in the logic table, as shown in the following example: Figure 3 shown.

[0049] In an embodiment of the present invention, the label mapping relationship between symbolic labels and logical labels is stored in a label mapping relationship table, and the user's editing methods for the label mapping relationship table of the original knowledge graph copy include: symbol editing processing, label adding processing, and label deleting processing.

[0050] In the embodiment of the present invention, the label mapping relationship table includes a symbolic label child node (child), a symbolic label parent node (parent) and a logical label, as shown in the following example: Figure 4 shown.

[0051] In the embodiment of the present invention, the symbol editing process includes: if only the name of the symbol label is modified, only the corresponding name field content in the label mapping relationship table is modified; if the logic of the logical label mapped by the symbol label is modified, a new logical label is added, and the symbol label (such as Figure 2 For example, if only the symbol label S is modified 21 If the name of S2 is changed, only the content of the 'name' field of the corresponding S2 in the label mapping table is modified; 21 The internal logic of t 21 (v1) logic, then after the logic is deduplicated, because there is still S' 21 The mapping points to t 21 , so the t in the label mapping table cannot be replaced 21 (v1) record, but add a new record logic tag Logic Tag ID t 21 (v2) to the label mapping relationship table.

[0052] In the embodiments of the present invention, the process of adding tags includes: if the Hash value after deduplication calculation does not exist in the tag mapping relationship table, new logic (new symbol tag S and logical tag T) is added to the tag mapping relationship table; if the Hash value after deduplication calculation exists in the tag mapping relationship table, only the symbol tag (new symbol tag S) is added, and the correspondence between the symbol tag (the newly added symbol tag S) and the logical tag (the originally existing symbol tag T) is recorded. For example, a logic is as follows:

[0053]

[0054] After calculating the Hash value through deduplication, it is found that this logic is not found in the tag mapping relationship table, and a new record with ID t is added to the tag mapping relationship table. 31 , and then S 31 is mapped to t 31 . At the same time, a new record S3>S 31 >t 31 is added to the symbol-logic mapping relationship table, as shown in Figure 2 ②.

[0055] The process of deleting tags in the embodiments of the present invention includes: when the symbol tag is deleted, whether it is the parent node or the child node of the tree, it is deleted from the tag mapping relationship table; when no symbol tag is mapped to the logical tag, the logical tag is deleted from the tag mapping relationship table. For example Figure 2 in ③, when the symbol tag S1 is deleted, whether it is the parent node or the child node, it is deleted from the tag mapping relationship table; however, when at the same time the symbol tags S 22 and S' 22 exist, there is no symbol tag mapped to the logical tag t 22 , so t 22 will be deleted from the tag mapping relationship table.

[0056] In a specific embodiment, in order to reduce redundant data, if the data does not carry symbol tags but only logical tags, the mapping relationship of the logical tags can be reversely restored according to the tag mapping relationship, and the attributes of the corresponding symbol tags (such as the name, color, etc. of the symbol tags) can be displayed according to the user's needs. In a multi-tenant model (tenant technology or multi-tenancy technology, which is a software architecture technology that explores and implements how to share the same system or program components in a multi-user environment and still ensure data isolation among users. Knowledge graphs can be traded, so the roles of tenants are divided into creators or users of knowledge graphs), the mapping relationship needs to be reversely restored during display. That is, user A sees the symbol tag name as "people from place b traveling to place a", while user B sees it as "scenic spots in place a that people from place b are interested in".

[0057] The permission control propagation method of the knowledge graph based on tree - shaped tags provided by the embodiments of the present invention realizes the control of various propagations of the knowledge graph from the creator to the user by granting different usage permissions to the users. By granting the users read - only permissions, it prevents the leakage and tampering of the underlying logic of the knowledge graph; when granting the users edit permissions, the users upgrade the original knowledge graph by obtaining user interaction operations, that is, the underlying logic can be fine - tuned. By using the reverse mapping method, the user's custom settings can be restored in a multi - user scenario; moreover, it can simplify the underlying calculation logic and reduce the amount of calculation.

[0058] Embodiment 2

[0059] The embodiments of the present invention provide a permission control propagation system for a knowledge graph based on tree - shaped tags, as Figure 5 shown, including:

[0060] A knowledge graph construction module 1, which is used to construct the tag mapping relationship between the symbol tags and the logical tags in a preset industry to form at least one tag tree as the original knowledge graph of the preset industry; this module executes the method described in step S1 of Embodiment 1, which will not be elaborated here.

[0061] A knowledge graph processing module 2, which is used to propagate the original knowledge graph for multi - user use, and the propagation methods include: read - only and editable; this module executes the method described in step S2 of Embodiment 1, which will not be elaborated here.

[0062] A knowledge graph propagation module 3, which is used to enable the user to only use the original knowledge graph when the propagation method is read - only; when the propagation method is editable, the user edits the tag mapping relationship based on the copy of the original knowledge graph to upgrade the knowledge graph, and the upgraded knowledge graph and the corresponding original knowledge graph cannot be merged; this module executes the method described in step S3 of Embodiment 1, which will not be elaborated here.

[0063] A knowledge graph upgrade module 4, which is used to obtain user interaction operations and upgrade the tag mapping relationship of the original knowledge graph according to the user interaction operations. This module executes the method described in step S4 of Embodiment 1, which will not be elaborated here.

[0064] The permission control propagation system of the knowledge graph based on tree-shaped tags provided by the embodiments of the present invention realizes the control of various propagations of the knowledge graph from the creator to the user by granting different usage permissions to the user, and prevents the leakage and tampering of the underlying logic of the knowledge graph by granting the user read-only permissions; when the user is granted editing permissions, the user upgrades the original knowledge graph by obtaining user interaction operations, that is, the underlying logic can be fine-tuned; the reverse mapping method is adopted to restore the user's custom settings in a multi-user scenario; moreover, it can simplify the underlying calculation logic and reduce the amount of calculation.

[0065] Embodiment 3

[0066] The embodiments of the present invention provide a computer device, as Figure 6 shown, including: at least one processor 401, such as a CPU (Central Processing Unit, central processor), at least one communication interface 403, a memory 404, and at least one communication bus 402. Among them, the communication bus 402 is used to realize the connection and communication between these components. Among them, the communication interface 403 may include a display screen (Display) and a keyboard (Keyboard), and optionally the communication interface 403 may further include a standard wired interface and a wireless interface. The memory 404 may be a high-speed RAM memory (Random Access Memory, volatile random access memory), or a non-volatile memory, such as at least one disk memory. Optionally, the memory 404 may further be at least one storage device located far from the aforementioned processor 401. Among them, the processor 401 may execute the permission control propagation method of the knowledge graph based on tree-shaped tags in Embodiment 1. A set of program codes are stored in the memory 404, and the processor 401 calls the program codes stored in the memory 404 to execute the permission control propagation method of the knowledge graph based on tree-shaped tags in Embodiment 1.

[0067] Among them, the communication bus 402 may be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (EISA) bus, etc. The communication bus 402 may be divided into an address bus, a data bus, a control bus, etc. For the sake of simplicity of representation, Figure 6 only one line is shown in the figure, but it does not mean that there is only one bus or one type of bus.

[0068] Among them, the memory 404 may include volatile memory, such as random-access memory (RAM); the memory may also include non-volatile memory, such as flash memory, hard disk drive (HDD) or solid-state drive (SSD); the memory 404 may further include a combination of the above types of memories.

[0069] Among them, the processor 401 may be a central processing unit (CPU), a network processor (NP), or a combination of a CPU and an NP.

[0070] Among them, the processor 401 may further include a hardware chip. The above hardware chip may be an application-specific integrated circuit (ASIC), a programmable logic device (PLD), or a combination thereof. The above PLD may be a complex programmable logic device (CPLD), a field-programmable gate array (FPGA), a generic array logic (GAL), or any combination thereof.

[0071] Optionally, the memory 404 is further configured to store program instructions. The processor 401 may call the program instructions to implement the permission control propagation method of the knowledge graph based on tree-shaped tags in Embodiment 1 of the present application.

[0072] The embodiment of the present invention further provides a computer-readable storage medium, on which computer-executable instructions are stored. The computer-executable instructions can execute the permission control propagation method of the knowledge graph based on tree-shaped tags in Embodiment 1. Among them, the storage medium can be a magnetic disk, an optical disk, a read-only memory (ROM), a random access memory (RAM), a flash memory, a hard disk drive (HDD), or a solid-state drive (SSD), etc.; the storage medium can also include a combination of the above-mentioned types of memories.

[0073] Obviously, the above embodiments are merely examples for clear illustration and not limitations on the implementation manners. For those of ordinary skill in the art, other different forms of changes or modifications can be made based on the above description. It is not necessary and impossible to enumerate all the implementation manners here. And the obvious changes or modifications derived therefrom are still within the protection scope of the present invention.

Claims

1. A permission control propagation method for a knowledge graph based on tree - shaped tags, including: Constructing a tag mapping relationship between symbol tags and logical tags in a preset industry to form at least one tag tree, serving as the original knowledge graph of the preset industry; Propagating the original knowledge graph for multi - user use, and the propagation methods include: read - only and editable; When the propagation method is read - only, the user can only use the original knowledge graph; when the propagation method is editable, the user edits the tag mapping relationship based on a copy of the original knowledge graph to upgrade the knowledge graph. After the upgrade, the upgraded knowledge graph and the corresponding original knowledge graph cannot be merged. During the process of upgrading the knowledge graph, it includes: performing logical deduplication processing on the tag mapping relationship. The process of logical deduplication processing includes: converting the matching conditions of all preset symbol tags into a string, then calculating its Hash value as the fingerprint of the matching condition, and performing deduplication processing on the tag mapping relationship; Obtaining user interaction operations and upgrading the tag mapping relationship of the original knowledge graph according to the user interaction operations.

2. The permission control propagation method of the knowledge graph based on tree-shaped tags according to claim 1, wherein The tag mapping relationship between the symbol tags and the logical tags is stored in a tag mapping relationship table. The editing methods of the user for the tag mapping relationship table of the copy of the original knowledge graph include: symbol editing processing, adding tag processing, and deleting tag processing.

3. The permission control propagation method of the knowledge graph based on tree-shaped tags according to claim 2, wherein, The process of adding tag processing includes: If the Hash value after deduplication calculation does not exist in the tag mapping relationship table, add new logic in the tag mapping relationship table. If the Hash value after deduplication calculation exists in the tag mapping relationship table, only add symbol tags and record the corresponding relationship between the symbol tags and the logical tags.

4. The permission control propagation method for the knowledge graph based on tree-shaped tags according to claim 2, wherein, The process of symbol editing processing includes: If only the name of the symbol tag is modified, only modify the corresponding name field content in the tag mapping relationship table; if the logic of the logical tag mapped by the symbol tag is modified, add a new logical tag and record the mapping relationship between the symbol tag and the new logical tag in the tag mapping relationship table.

5. The permission control propagation method of the knowledge graph based on tree-shaped tags according to claim 2, characterized in that The process of deleting tag processing includes: When the symbol tag is deleted, whether it is the parent node or the child node of the tree, it is deleted from the tag mapping relationship table; when no symbol tag maps to the logical tag, delete the logical tag from the tag mapping relationship table.

6. The permission control propagation method for the knowledge graph based on tree-shaped tags according to claim 1, wherein It also includes: Performing reverse restoration on the mapping relationship of the logical tags according to the tag mapping relationship and displaying the attributes of the corresponding symbol tags according to the user's requirements.

7. A permission control propagation system for a knowledge graph based on tree-shaped tags, characterized in that Including: A knowledge graph construction module, used to construct a tag mapping relationship between symbol tags and logical tags in a preset industry to form at least one tag tree, serving as the original knowledge graph of the preset industry; A knowledge graph processing module, used to propagate the original knowledge graph for multi - user use, and the propagation methods include: read - only and editable; A knowledge graph propagation module, which is used to enable the user to only use the original knowledge graph when the propagation method is read-only; when the propagation method is editable, the user edits the label mapping relationship based on a copy of the original knowledge graph to upgrade the knowledge graph, and the upgraded knowledge graph and the corresponding original knowledge graph cannot be merged; during the process of upgrading the knowledge graph, it includes: performing logical duplicate removal processing on the label mapping relationship, and the process of the logical duplicate removal processing includes: converting the matching conditions of all preset symbol tags into a string, calculating the Hash value of it as the fingerprint of the matching conditions, and performing duplicate removal processing on the label mapping relationship; A knowledge graph upgrade module, which is used to obtain user interaction operations and upgrade the label mapping relationship of the original knowledge graph according to the user interaction operations.

8. A computer device, characterized in that, including: at least one processor, and a memory communicatively connected to the at least one processor, wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to execute the permission control propagation method of the knowledge graph based on tree-shaped tags as described in any one of claims 1-6.

9. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable the computer to execute the permission control propagation method of the knowledge graph based on tree-shaped tags as described in any one of 1-6.

Images