Product data map dynamic updating method and system based on ontology dependency relationship

Abstract

The invention discloses a product data graph dynamic updating method and system based on an ontology dependency relationship, and the method comprises the steps: defining a dependency entity and a dependency relationship, and building a product data dependency relationship graph; on the basis of the product data dependency graph, the relationship between the added entity and other entities is connected according to the attribute key of the dependency relationship, the attribute key and the dependency entity thereof are added according to the dependency relationship, and the relationship between the entities and the dependency entity is connected; searching the relationship between the dependent entity and other entities, and finding out the associated dependent entity; finishing automatic adding of the product data atlas; on the basis of the product data dependency graph, entities to be deleted are put into a queue, adjacent dependent entities are sent into the queue every time, and whether the corresponding entities need to be deleted or not is determined according to edge in-degree; and completing automatic deletion of the product data atlas. According to the method, the workload of operation and maintenance personnel on map update logic maintenance is reduced, the method can adapt to map scale change, and modification on each entity update logic caused by ontology increase and decrease is reduced as much as possible.

Description

Technical Field

[0001] The present invention relates to the field of computer technology, and in particular to a method and system for dynamically updating a product data graph based on ontology dependency. Background Art

[0002] See also Figure 1 In the product data graph ontology shown, the entities updated in the graph involve product data entities, asset equipment entities, manufacturer entities, and substation entities. These entities all involve the maintenance of relationships with attribute entities. The update of asset equipment entities requires the update of entities and relationships of associated substations, manufacturer equipment, and manufacturers. The update of substation entities requires the update of entities and relationships of associated asset equipment. The update of manufacturer entities requires the update of entities and relationships of associated asset equipment and manufacturer equipment. The update of product data entities is relatively complex. The following is a detailed summary of the product data entity update process.

[0003] like Figure 2 As shown, the process of adding product information includes:

[0004] (1) Insert product information entity; (2) Determine whether the model, manufacturer, voltage level, and equipment type attribute combination exists in the manufacturer's equipment. If not, add it; (3) Determine whether the manufacturer's equipment has a relationship with the asset equipment. If not, add it; (4) Determine whether the manufacturer's equipment has a relationship with the manufacturer entity. If not, add it; (5) Determine whether the attribute entity between model, manufacturer, voltage level, and equipment type exists. If not, add it; (6) Add the relationship between manufacturer equipment, product information, and attribute entities; (7) Determine whether the relationship between the attribute entities between model, manufacturer, voltage level, and equipment type exists. If not, add it.

[0005] like Figure 3 As shown in the figure, the process of deleting product information includes:

[0006] (1) Delete the product data entity; (2) Determine whether the manufacturer equipment of the model, manufacturer, voltage level, and equipment type exists in the equipment data. If not, delete the corresponding manufacturer equipment; (3) Determine whether the relationship between the attribute entities of the model, manufacturer, voltage level, and equipment type exists in the manufacturer equipment. If not, delete the relevant relationship; (4) Determine whether the attributes of the model, manufacturer, voltage level, and equipment type exist in the manufacturer equipment. If not, delete the relevant attribute entity. It should be noted that after deleting the attribute entity, the relationship with the manufacturer equipment and product data becomes a hanging edge and will be automatically deleted. After deleting the manufacturer equipment, the relationship with the manufacturer and asset equipment becomes a hanging edge and will be automatically deleted.

[0007] As can be seen from the above process, the graph update process becomes increasingly complex as the scale of the graph increases. When it comes to adding or deleting ontologies, all ontology update logic may need to be modified, which requires huge maintenance workload and is prone to errors. Summary of the invention

[0008] The purpose of the present invention is to address the above-mentioned problems in the prior art and to provide a method and system for dynamically updating a product data map based on ontology dependencies, which can realize automated map updating and reduce the maintenance workload of personnel.

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

[0010] In a first aspect, the present disclosure provides a method for dynamically updating a product data graph based on ontology dependencies, comprising:

[0011] Define dependent entities and dependency relationships, and create a product data dependency diagram;

[0012] Based on the product data dependency graph, add the relationship between the entity and other entities according to the attribute key of the dependency, add the attribute key and its dependent entity according to the dependency, and connect the relationship between the entity and the dependent entity; search the relationship between the dependent entity and other entities, and find the associated dependent entity; complete the automatic addition of the product data graph;

[0013] Based on the product data dependency graph, the entities to be deleted are placed in a queue. Each time, the adjacent dependent entities are sent to the queue, and the edge in-degree is used to determine whether the corresponding entity needs to be deleted; the product data graph is automatically deleted.

[0014] As an optional implementation, in the step of defining dependent entities and dependency relationships, and establishing a product data dependency graph, a dependent entity refers to an entity generated by other entities on which it depends, including attribute entities and manufacturer equipment entities; the relationship connecting a dependent entity and a dependent entity is a dependency relationship, and the dependency relationship is directed from the dependent entity to the dependent entity.

[0015] As an optional implementation, in the step of defining dependent entities and dependent relationships, and establishing a product data dependency graph, in the product data dependency graph, "[attribute 1 & attribute 2]" represents the attribute key required for the relationship connection, that is, which attributes are used to connect the two entities; "attribute 1 & attribute 2" means that attribute 1 and attribute 2 must exist in both entities to be connected, and "attribute 1 | attribute 2" means that an entity is associated with one entity by attribute 1, and can also be associated with another entity by attribute 2.

[0016] As an optional implementation, the attribute key for product information and manufacturer equipment entity is "voltage level & model & equipment type & manufacturer", then the product information and manufacturer equipment entity have a corresponding relationship only when they have the same voltage level, model, equipment type, and manufacturer at the same time; for the attribute key for product information and attribute entity is "voltage level | model | equipment type | manufacturer", then the product information and attribute entity can have a corresponding relationship as long as they have any of the above-mentioned identical attributes.

[0017] As an optional implementation method, based on the product information dependency graph, when adding a product information, add a dependency entity of the manufacturer equipment to connect the relationship between the manufacturer equipment and the product information; add an attribute entity to connect the relationship between the attribute entity and the manufacturer equipment and product information; if the corresponding asset equipment and manufacturer exist, connect the relationship between the manufacturer equipment and the asset equipment and manufacturer.

[0018] As an optional implementation, the step of automatically adding the product information map includes:

[0019] Put the initial entities to be added into the queue;

[0020] When the queue is not empty, take out entity v from the head of the queue;

[0021] Find the ontology a corresponding to entity v, find all the relationships of ontology a in the product data dependency graph, and obtain the associated ontology, associated edges, and attribute keys of each relationship;

[0022] When the associated entity is a dependent entity and the associated edge is an outgoing edge of the entity v ontology dependency relationship, the following process is executed: if the entity under the associated entity obtained according to the attribute key does not exist, then add the entity under the associated entity obtained according to the attribute key and add it to the end of the queue; in addition, add the relationship between the current entity v and the associated entity;

[0023] If the entity under the associated ontology exists according to the attribute key, add the relationship between the current entity v and the associated entity;

[0024] Iterate the above process until the queue is empty and return the graph after adding entities and relationships.

[0025] As an optional implementation, based on the product information dependency graph, when deleting a product information, traverse the manufacturer equipment and attribute entities. When no product information depends on the manufacturer equipment entity, delete the manufacturer equipment; at the same time, traverse the attribute entities again and delete the attribute entities without dependencies.

[0026] As an optional implementation, the step of automatically deleting the product information map includes:

[0027] Put the initial entity to be deleted into the queue;

[0028] When the queue is not empty, take out entity v from the head of the queue;

[0029] If entity v has been deleted, then take entity v out from the head of the queue again;

[0030] If entity v is not the initial entity to be deleted and the dependent edge in-degree is greater than 0, then entity v is taken out from the head of the queue again;

[0031] Traverse all relationships of entity v, extract related entities and related edges, and if the related entity is a dependent entity, put the related entity into the queue;

[0032] Delete entity v, and the edges connected to entity v are also deleted accordingly;

[0033] Iterate the above process until the queue is empty and return the graph after deleting entities and relationships.

[0034] In a second aspect, the present disclosure provides a product data graph dynamic update system based on ontology dependency, comprising:

[0035] Product data dependency graph building module, used to define dependent entities and dependency relationships, and build a product data dependency graph;

[0036] The module for automatically adding product information graphs is used to connect and add the relationship between entities and other entities based on the dependency graph of product information according to the attribute key of the dependency relationship, add the attribute key and its dependent entity according to the dependency relationship, and connect the relationship between entities and dependent entities; search for the relationship between dependent entities and other entities, and find the associated dependent entities; complete the automatic addition of product information graphs;

[0037] The product information graph automatic deletion module is used to put the entities to be deleted into the queue based on the product information dependency graph, send the adjacent dependent entities into the queue each time, and determine whether the corresponding entity needs to be deleted based on the edge in-degree; complete the automatic deletion of the product information graph.

[0038] In a third aspect, the present disclosure provides a computer-readable storage medium, wherein the computer-readable storage medium stores at least one instruction, and when the at least one instruction is executed by a processor, the method for dynamically updating a product information graph based on ontology dependencies is implemented.

[0039] Compared with the prior art, the first aspect of the present disclosure has at least the following beneficial effects:

[0040] In view of the problem that the update process of the product information map becomes more and more complicated as the scale of the map expands, in order to reduce the maintenance workload and error rate, the dynamic update method of the product information map based on the ontology dependency relationship of the present invention can reliably realize the automatic update of the map, and complete the automatic addition and deletion of the product information map based on the product information dependency graph. When the product information map is automatically added, the relationship between the added entity and other entities is connected according to the attribute key of the dependency relationship, and the attribute key and its dependent entity are added according to the dependency relationship, and the relationship between the entity and the dependent entity is connected; at the same time, the relationship between the dependent entity and other entities is searched, and the associated dependent entity is further found. When the product information map is automatically deleted, the entity to be deleted is placed in the queue, and the adjacent dependent entities are sent to the queue each time, and the edge in-degree is relied on to determine whether the corresponding entity needs to be deleted. The automatic addition and deletion process of the product information map of the present invention reduces the workload of the operation and maintenance personnel for the maintenance of the map update logic, is flexible, can adapt to the changes in the scale of the map, and minimizes the modification of the update logic of each entity caused by the increase or decrease of the ontology.

[0041] It can be understood that the beneficial effects of the second to third aspects mentioned above can be found in the relevant description of the first aspect mentioned above, and will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS

[0042] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

[0043] Figure 1 Schematic diagram of the product information knowledge graph ontology of an embodiment of the present invention;

[0044] Figure 2 The existing technology adds product information flow diagram;

[0045] Figure 3 Schematic diagram of the process of deleting product information in the prior art;

[0046] Figure 4 A schematic diagram of a product data dependency relationship diagram established in an embodiment of the present invention. DETAILED DESCRIPTION

[0047] In the following description, specific details such as specific system structures, technologies, etc. are provided for the purpose of illustration rather than limitation, so as to provide a thorough understanding of the embodiments of the present application. However, it should be clear to those skilled in the art that the present application may also be implemented in other embodiments without these specific details. In other cases, detailed descriptions of well-known systems, devices, circuits, and methods are omitted to prevent unnecessary details from obstructing the description of the present application.

[0048] The update process of the knowledge graph will become more complicated as the scale of the graph increases, especially when it comes to the addition or deletion of ontologies, the maintenance workload will increase significantly and it is prone to errors. When a new ontology is added to the knowledge graph, it is necessary to ensure that the logical relationship and attribute relationship between it and the existing ontology are correctly defined. Existing data needs to be re-evaluated to ensure the compatibility and consistency of the new ontology with existing data. The query, reasoning and display modules of the knowledge graph need to be updated to support the use of the new ontology. Deleting an ontology involves the cleaning and deletion of a large amount of related data, which may have complex associations with other ontologies. It is necessary to ensure that the deletion operation does not undermine the integrity and accuracy of the knowledge graph and avoid introducing data inconsistencies or errors. The index, cache and statistics of the knowledge graph need to be updated to reflect the new state after the ontology is deleted.

[0049] As the scale of knowledge graphs expands, the number and complexity of ontologies increase, making update and maintenance more cumbersome and time-consuming. During the update process, data inconsistencies, omissions, or errors may occur due to human or system errors.

[0050] In this regard, an embodiment of the present invention proposes a method for dynamically updating a product data graph based on ontology dependencies, comprising:

[0051] S1. Define dependent entities and dependency relationships, and establish a product data dependency graph;

[0052] S2. Based on the product data dependency graph, add the relationship between the entity and other entities according to the attribute key of the dependency relationship, add the attribute key and its dependent entity according to the dependency relationship, and connect the relationship between the entity and the dependent entity; search for the relationship between the dependent entity and other entities, and find the associated dependent entity; complete the automatic addition of the product data graph;

[0053] S3. Based on the product data dependency graph, the entities to be deleted are placed in a queue. Each time, the adjacent dependent entities are placed in the queue, and the edge in-degree is used to determine whether the corresponding entity needs to be deleted; the automated deletion of the product data graph is completed.

[0054] In a possible implementation, the dependent entity described in step S1 of the embodiment of the present invention refers to the entity generated by other entities it depends on, mainly including attribute entities and manufacturer equipment entities. The relationship connecting the dependent entity and the dependent entity is a dependency relationship, and the dependency relationship is from the dependent entity to the dependent entity, mainly including the power grid entity pointing to the attribute entity and the product data entity pointing to the manufacturer equipment entity. The actual relationship between the dependency relationship and the dependent entity is one-to-one, and the direction of the relationship between the dependency relationship and the dependent entity can be opposite.

[0055] See also Figure 4 In the power grid main equipment product data dependency diagram established by the embodiment of the present invention, the dotted circle represents the dependent entity, and the dotted arrow represents the dependency relationship. The diagram ensures that there will be no mutual dependence, and the dependency relationships cannot be connected into a loop. In the product data dependency diagram, "[attribute 1 & attribute 2]" represents the attribute key required for the relationship connection, that is, which attributes are used to connect the two entities; "attribute 1 & attribute 2" means that attribute 1 and attribute 2 must exist in both entities to be connected, and "attribute 1 | attribute 2" means that an entity is associated with one entity by attribute 1, and can also be associated with another entity by attribute 2.

[0056] More specifically, for the attribute key of the product information and manufacturer equipment entity is "voltage level & model & equipment type & manufacturer", the product information and manufacturer equipment entity have a corresponding relationship only when they have the same voltage level, model, equipment type, and manufacturer at the same time; for the attribute key of the product information and attribute entity is "voltage level | model | equipment type | manufacturer", the product information and attribute entity can have a corresponding relationship as long as they have any of the above-mentioned identical attributes.

[0057] In the power grid main equipment product data dependency diagram established in the embodiment of the present invention, the attribute key of the manufacturer equipment and the attribute entity is "voltage level|model|equipment type|manufacturer", the attribute key of the manufacturer equipment and the asset equipment is "voltage level&model&equipment type&manufacturer", the attribute key of the asset equipment and the attribute entity is "voltage level|model|equipment type|manufacturer", the attribute key of the substation and the asset equipment is "substation ID", the attribute keys of the manufacturer and the asset equipment, the manufacturer equipment and the attribute entity are all "manufacturer", and the attribute key of the substation and the attribute entity is "voltage level|power station name".

[0058] In a possible implementation manner, the automatic addition of the product information map described in step S2 of the embodiment of the present invention includes:

[0059] (1) Put the initial entity to be added into the queue;

[0060] (2) When the queue is not empty, take entity v from the head of the queue;

[0061] (3) Find the ontology a corresponding to entity v, find all the relationships of ontology a in the product data dependency graph, and obtain the associated ontology, associated edges, and attribute keys of each relationship;

[0062] (4) When the associated entity is a dependent entity and the associated edge is an outgoing edge of the dependency relationship of entity v, the following process is executed: if the entity under the associated entity obtained according to the attribute key does not exist, then the entity under the associated entity obtained according to the attribute key is added and added to the end of the queue; in addition, the relationship between the current entity v and the associated entity is added;

[0063] (5) When the condition of step (4) is not satisfied, if the entity under the associated ontology exists according to the attribute key, add the relationship between the current entity v and the associated entity;

[0064] (6) Iterate the above process until the queue is empty and return the graph after adding entities and relationships.

[0065] Furthermore, the algorithm for automatically adding product information graphs according to the embodiment of the present invention is shown in Table 1:

[0066] Table 1

[0067]

[0068]

[0069] As shown in the algorithm flow in Table 1, when adding a product data, add the dependency entity of the manufacturer equipment to connect the relationship between the manufacturer equipment and the product data; add the attribute entity to connect the relationship between the attribute entity and the manufacturer equipment and product data; if the corresponding asset equipment and manufacturer exist, connect the relationship between the manufacturer equipment and the asset equipment and manufacturer.

[0070] In a possible implementation manner, the automatic deletion of the product information graph described in step S3 of the embodiment of the present invention includes:

[0071] (1) Put the initial entity to be deleted into the queue;

[0072] (2) When the queue is not empty, take entity v from the head of the queue;

[0073] (3) If entity v has been deleted, return to step (2) and retrieve entity v from the head of the queue again;

[0074] (4) If entity v is not the initial entity to be deleted and the dependent edge in-degree is greater than 0, return to step (2) and retrieve entity v from the head of the queue again;

[0075] (5) Traverse all relationships of entity v, extract associated entities and associated edges, and if the associated entity is a dependent entity, put the associated entity into the queue;

[0076] (6) Delete entity v, and the edges connected to entity v are also deleted accordingly;

[0077] (7) Iterate the above process until the queue is empty and return the graph after deleting entities and relationships.

[0078] Edge in-degree is an important concept in graph theory algorithms, and is mainly used in directed graphs. In a directed graph, the in-degree of a vertex refers to the number of edges pointing to the vertex. In other words, the in-degree is the sum of the number of edges that end at the vertex. In a directed graph, the sum of the in-degrees of all vertices is equal to the total number of edges in the graph (if the weights of the edges are considered, it is the sum of the weights of all edges). This is because each edge has a starting point and an end point, so each edge contributes an in-degree to a vertex. In a directed graph, the out-degree of a vertex is the number of edges that start from the vertex. Although in-degree and out-degree are two different properties for the same vertex, they are related to each other in the graph. In particular, the sum of the in-degrees of all vertices is equal to the sum of the out-degrees of all vertices, which reflects that the directedness of the edges in a directed graph does not affect the total number of edges.

[0079] Furthermore, the product data map automatic deletion algorithm described in the embodiment of the present invention is shown in Table 2:

[0080] Table 2

[0081]

[0082] As shown in the algorithm flow in Table 2, when deleting a product data, the manufacturer equipment and attribute entities are traversed. When no product data depends on the manufacturer equipment entity, the manufacturer equipment is deleted; at the same time, the attribute entity is traversed again and the attribute entity without dependency is deleted.

[0083] The method for dynamically updating the product information graph based on the ontology dependency relationship in the embodiment of the present invention realizes the automation of graph updating, brings many conveniences to the operation and maintenance personnel, significantly reduces the workload of the operation and maintenance personnel to manually update the graph, and the operation and maintenance personnel do not need to frequently intervene in the update process, and can focus on other more important operation and maintenance tasks or optimization work. The method for dynamically updating the product information graph based on the ontology dependency relationship in the embodiment of the present invention can be flexibly adjusted according to different update requirements, such as scheduled updates, on-demand updates, etc., and adapt to changes in the scale of the graph. As the scale of the graph expands or shrinks, the update strategy can be automatically adjusted to ensure the accuracy and integrity of the graph data. There is no need to manually adjust the update logic due to changes in the scale of the graph, reducing the update logic modification caused by the increase or decrease of the ontology. When the ontology in the graph changes, the relevant data structures and relationships can be automatically detected and updated. Even if the ontology changes, there is no need to manually modify the update logic for each entity, thereby reducing the risk of errors and the complexity of the update. Through automation, it is easier to maintain the consistency and integrity of the graph data and reduce data errors and redundancy. Compared with manual updates, automated updates can process large amounts of data faster, improve the overall system efficiency, respond quickly to data update needs, and ensure the real-time and accuracy of graph data.

[0084] Another embodiment of the present invention further provides a product data graph dynamic update system based on ontology dependency, comprising:

[0085] Product data dependency graph building module, used to define dependent entities and dependency relationships, and build a product data dependency graph;

[0086] The module for automatically adding product information graphs is used to connect and add the relationship between entities and other entities based on the dependency graph of product information according to the attribute key of the dependency relationship, add the attribute key and its dependent entity according to the dependency relationship, and connect the relationship between entities and dependent entities; search for the relationship between dependent entities and other entities, and find the associated dependent entities; complete the automatic addition of product information graphs;

[0087] The product information graph automatic deletion module is used to put the entities to be deleted into the queue based on the product information dependency graph, send the adjacent dependent entities into the queue each time, and determine whether the corresponding entity needs to be deleted based on the edge in-degree; complete the automatic deletion of the product information graph.

[0088] In one possible implementation, in the product data dependency graph establishing module, "[attribute 1 & attribute 2]" represents the attribute key required for the relationship connection, that is, which attributes are used to connect the two entities; "attribute 1 & attribute 2" means that attribute 1 and attribute 2 must exist in both entities to be connected, and "attribute 1 | attribute 2" means that an entity can be associated with one entity by attribute 1, and can also be associated with another entity by attribute 2.

[0089] In one possible implementation, the product information map automatic addition module is based on the product information dependency graph. When adding a product information, the dependency entity of the manufacturer equipment is added to connect the relationship between the manufacturer equipment and the product information; the attribute entity is added to connect the relationship between the attribute entity and the manufacturer equipment and product information; if the corresponding asset equipment and manufacturer exist, the relationship between the manufacturer equipment and the asset equipment and manufacturer is connected.

[0090] Furthermore, the steps for automatically adding product data maps include:

[0091] Put the initial entities to be added into the queue;

[0092] When the queue is not empty, take out entity v from the head of the queue;

[0093] Find the ontology a corresponding to entity v, find all the relationships of ontology a in the product data dependency graph, and obtain the associated ontology, associated edges, and attribute keys of each relationship;

[0094] When the associated entity is a dependent entity and the associated edge is an outgoing edge of the entity v ontology dependency relationship, the following process is executed: if the entity under the associated entity obtained according to the attribute key does not exist, then add the entity under the associated entity obtained according to the attribute key and add it to the end of the queue; in addition, add the relationship between the current entity v and the associated entity;

[0095] If the entity under the associated ontology exists according to the attribute key, add the relationship between the current entity v and the associated entity;

[0096] Iterate the above process until the queue is empty and return the graph after adding entities and relationships.

[0097] In one possible implementation, the product information graph automatic deletion module is based on the product information dependency graph. When deleting a product information, the manufacturer equipment and attribute entities are traversed. When no product information depends on the manufacturer equipment entity, the manufacturer equipment is deleted; at the same time, the attribute entities are traversed again to delete the attribute entities without dependencies.

[0098] Furthermore, the steps for automatically deleting the product data graph include:

[0099] Put the initial entity to be deleted into the queue;

[0100] When the queue is not empty, take out entity v from the head of the queue;

[0101] If entity v has been deleted, then take entity v out from the head of the queue again;

[0102] If entity v is not the initial entity to be deleted and the dependent edge in-degree is greater than 0, then entity v is taken out from the head of the queue again;

[0103] Traverse all relationships of entity v, extract related entities and related edges, and if the related entity is a dependent entity, put the related entity into the queue;

[0104] Delete entity v, and the edges connected to entity v are also deleted accordingly;

[0105] Iterate the above process until the queue is empty and return the graph after deleting entities and relationships.

[0106] Another embodiment of the present invention further proposes an electronic device, including a processor and a memory, wherein the processor is used to execute a computer program stored in the memory to implement the method for dynamically updating a product information graph based on ontology dependencies.

[0107] Another embodiment of the present invention further proposes a computer-readable storage medium, wherein the computer-readable storage medium stores at least one instruction, and when the at least one instruction is executed by a processor, the method for dynamically updating a product information graph based on ontology dependencies is implemented.

[0108] The computer program includes computer program code, which may be in source code form, object code form, executable file or some intermediate form. The computer-readable storage medium may include: any entity or device, medium, USB flash drive, mobile hard disk, disk, optical disk, computer memory, read-only memory, random access memory, electric carrier signal, telecommunication signal and software distribution medium, etc. that can carry the computer program code. It should be noted that the content contained in the computer-readable medium can be appropriately increased or decreased according to the requirements of legislation and patent practice in the jurisdiction. For example, in some jurisdictions, according to legislation and patent practice, computer-readable media do not include electric carrier signals and telecommunication signals. For ease of explanation, the above content only shows the part related to the embodiment of the present invention. For specific technical details not disclosed, please refer to the method part of the embodiment of the present invention. The computer-readable storage medium is non-temporary and can be stored in a storage device formed by various electronic devices, which can realize the execution process recorded in the method of the embodiment of the present invention.

[0109] It will be appreciated by those skilled in the art that embodiments of the present invention may be provided as methods, systems or computer program products. Therefore, the present invention may take the form of a complete hardware embodiment, a complete software embodiment or an embodiment combining software and hardware. Moreover, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0110] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (systems) and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the process in the flowchart. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0111] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0112] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0113] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the above embodiments, ordinary technicians in the relevant field should understand that the specific implementation methods of the present invention can still be modified or replaced by equivalents. Any modification or equivalent replacement that does not depart from the spirit and scope of the present invention should be covered within the scope of protection of the claims of the present invention.

Claims

1. A method for dynamically updating a product data graph based on ontology dependency, characterized in that: include: Define dependent entities and dependency relationships, and create a product data dependency diagram; Based on the product data dependency graph, add the relationship between the entity and other entities according to the attribute key of the dependency, add the attribute key and its dependent entity according to the dependency, and connect the relationship between the entity and the dependent entity; search the relationship between the dependent entity and other entities, and find the associated dependent entity; complete the automatic addition of the product data graph; Based on the product data dependency graph, the entities to be deleted are placed in a queue. Each time, the adjacent dependent entities are sent to the queue, and the edge in-degree is used to determine whether the corresponding entity needs to be deleted; the product data graph is automatically deleted.

2. The method for dynamically updating a product data graph based on ontology dependency according to claim 1 is characterized in that: In the steps of defining dependent entities and dependency relationships and establishing a product data dependency graph, a dependent entity refers to an entity generated by other entities on which it depends, including attribute entities and manufacturer equipment entities; the relationship connecting a dependent entity and a dependent entity is a dependency relationship, and the dependency relationship is directed from the dependent entity to the dependent entity.

3. The method for dynamically updating a product data graph based on ontology dependency according to claim 1 is characterized in that: In the steps of defining dependent entities and dependent relationships and establishing a product data dependency graph, in the product data dependency graph, "[attribute 1 & attribute 2]" represents the attribute key required for the relationship connection, that is, which attributes are used to connect the two entities; "attribute 1 & attribute 2" means that attribute 1 and attribute 2 must exist in both entities to be connected, and "attribute 1 | attribute 2" means that an entity is associated with one entity by attribute 1, and can also be associated with another entity by attribute 2.

4. The method for dynamically updating a product data map based on ontology dependency according to claim 3 is characterized in that: For the attribute key of product information and manufacturer equipment entity is "voltage level & model & equipment type & manufacturer", the corresponding relationship will be established when the product information and manufacturer equipment entity have the same voltage level, model, equipment type, and manufacturer at the same time; for the attribute key of product information and attribute entity is "voltage level | model | equipment type | manufacturer", the corresponding relationship will be established as long as the product information and attribute entity have any of the above same attributes.

5. The method for dynamically updating a product data graph based on ontology dependency according to claim 1 is characterized in that: Based on the product information dependency graph, when adding a product information, add the dependency entity of the manufacturer equipment to connect the relationship between the manufacturer equipment and the product information; add the attribute entity to connect the relationship between the attribute entity and the manufacturer equipment and product information; if the corresponding asset equipment and manufacturer exist, connect the relationship between the manufacturer equipment and the asset equipment and manufacturer.

6. The method for dynamically updating a product data graph based on ontology dependency according to claim 1 is characterized in that: The steps of automatically adding the product information map include: Put the initial entities to be added into the queue; When the queue is not empty, take out entity v from the head of the queue; Find the ontology a corresponding to entity v, find all the relationships of ontology a in the product data dependency graph, and obtain the associated ontology, associated edges, and attribute keys of each relationship; When the associated entity is a dependent entity and the associated edge is an outgoing edge of the entity v ontology dependency relationship, the following process is executed: if the entity under the associated entity obtained according to the attribute key does not exist, then add the entity under the associated entity obtained according to the attribute key and add it to the end of the queue; in addition, add the relationship between the current entity v and the associated entity; If the entity under the associated ontology exists according to the attribute key, add the relationship between the current entity v and the associated entity; Iterate the above process until the queue is empty and return the graph after adding entities and relationships.

7. The method for dynamically updating a product data graph based on ontology dependency according to claim 1 is characterized in that: Based on the product information dependency graph, when deleting a product information, traverse the manufacturer equipment and attribute entities. When there is no product information dependent on the manufacturer equipment entity, delete the manufacturer equipment; at the same time, traverse the attribute entity again and delete the attribute entity without dependency.

8. The method for dynamically updating a product data graph based on ontology dependency according to claim 1 is characterized in that: The steps of automatically deleting the product information map include: Put the initial entity to be deleted into the queue; When the queue is not empty, take out entity v from the head of the queue; If entity v has been deleted, then take entity v out from the head of the queue again; If entity v is not the initial entity to be deleted and the dependent edge in-degree is greater than 0, then entity v is taken out from the head of the queue again; Traverse all relationships of entity v, extract related entities and related edges, and if the related entity is a dependent entity, put the related entity into the queue; Delete entity v, and the edges connected to entity v are also deleted accordingly; Iterate the above process until the queue is empty and return the graph after deleting entities and relationships.

9. A product data map dynamic update system based on ontology dependency, characterized in that: include: Product data dependency graph building module, used to define dependent entities and dependency relationships, and build a product data dependency graph; The module for automatically adding product information graphs is used to connect and add the relationship between entities and other entities based on the dependency graph of product information according to the attribute key of the dependency relationship, add the attribute key and its dependent entity according to the dependency relationship, and connect the relationship between entities and dependent entities; search for the relationship between dependent entities and other entities, and find the associated dependent entities; complete the automatic addition of product information graphs; The product information graph automatic deletion module is used to put the entities to be deleted into the queue based on the product information dependency graph, send the adjacent dependent entities into the queue each time, and determine whether the corresponding entity needs to be deleted based on the edge in-degree; complete the automatic deletion of the product information graph.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores at least one instruction, and when the at least one instruction is executed by the processor, it implements the method for dynamically updating the product information map based on ontology dependency as described in any one of claims 1 to 8.

Images