A method and apparatus for deriving a full graph based on a knowledge graph

Abstract

This invention relates to the field of knowledge graph visualization technology, and provides a method and apparatus for exporting a full knowledge graph. After receiving an access request for data generated from a first knowledge graph and responding with the content of the generated data, the database server records the account A that initiated the access request. Upon receiving other access requests for data generated from the first knowledge graph, the database server confirms the account B that originated from those other access requests. The database server then triggers the local terminal application of account A to send the first knowledge graph it generated to the terminal where account B resides. This invention comprehensively analyzes whether the interaction between the database server and the visitor is more efficient, or whether directly obtaining the generated knowledge graph from the online terminal is more efficient, and selects the optimal method. This allows terminals with insufficient computing power to skip the computation process and achieve efficient knowledge graph response.

Description

Technical Field

[0001] This invention relates to the field of knowledge graph visualization technology, and in particular to a method and apparatus for deriving a full graph based on a knowledge graph. Background Technology

[0002] Knowledge graphs are structured semantic networks that logically abstract and connect concepts from the objective world. Based on powerful data linking capabilities, knowledge graphs facilitate computational processing while also conforming to human thought processes. To enhance human understanding, graph visualization plays a crucial role in knowledge graphs, leading to the emergence of increasingly sophisticated graph visualization frameworks.

[0003] However, in practical applications, the generation of knowledge graphs requires a comprehensive analysis of existing data. Steps are not only attributes of a single data point, but also involve its relationships with other data to generate corresponding edge attributes. As a result, the response efficiency of the knowledge graph will be greatly affected when the computing power is insufficient or when there is a large amount of data.

[0004] Therefore, overcoming the shortcomings of the existing technology is an urgent problem to be solved in this technical field. Summary of the Invention

[0005] The technical problem this invention aims to solve is that in practical applications, the generation of knowledge graphs requires a comprehensive analysis of existing data. The step is not only the attribute of a single data point, but also its relationship with other data in order to generate corresponding edge attributes. As a result, when the computing power is insufficient or the data content is large, the response efficiency of the knowledge graph will be greatly affected.

[0006] The present invention adopts the following technical solution:

[0007] In a first aspect, the present invention provides a method for deriving a full graph based on a knowledge graph, comprising:

[0008] After receiving an access request for data generated from the first knowledge graph and responding with the content of the data generated from the first knowledge graph, the database server records the account A that initiated the access request.

[0009] After receiving other access requests for data generated related to the first knowledge graph, the database server confirms the account B from which the other access requests originated.

[0010] Based on the IP addresses of account B and account A, the positional relationship between their hardware devices is analyzed. It is confirmed that when the network link between the two accounts completes the local transmission time of the first knowledge graph of account A, which is less than the total time of account B obtaining the data content of the first knowledge graph from the database server and generating the first knowledge graph from the data content, the database server triggers the local terminal application of account A to send the first knowledge graph generated by it to the terminal where account B is located.

[0011] The terminal application containing account B also received the instruction sent by the database server, and after receiving the complete data packet containing the first knowledge graph from account A, returned a message to the database server indicating that the access request had ended normally.

[0012] Preferably, when it is confirmed that the network link between the two accounts completes the local transmission time of the first knowledge graph for account A at a time greater than or equal to the total time for account B to obtain the data content related to the generation of the first knowledge graph from the database server and to generate the first knowledge graph from the data content, the method further includes:

[0013] When the database server retrieves relevant data content related to the first knowledge graph locally, it sends the data content to the terminal where account B is located via the network link between account B and the terminal application on account B. This allows the terminal application on account B to generate the first knowledge graph based on the received data content and then display the first knowledge graph on its terminal display interface.

[0014] Preferably, after receiving a complete data packet containing the first knowledge graph from account A, a message indicating that the access request has been successfully terminated is returned to the database server, specifically including:

[0015] After receiving the complete data packet containing the first knowledge graph from account A, a notification message is sent to the database server to indicate that the first knowledge graph of account A has been successfully synchronized.

[0016] After receiving the notification message, the database server sends the data content associated with the generation of the first knowledge graph from its local database server to account B terminal.

[0017] Preferably, after logging into the corresponding account, the terminal application sends an access request to the database server that includes the computing resource information of the device where the login account is located; thereby enabling the database server to calculate the time required to generate the first knowledge graph for the data content it wants to access.

[0018] The computing resource information includes one or more of the following: processor model, memory capacity, current remaining CPU percentage, and remaining memory percentage.

[0019] Preferably, after the database server has established the generation information of the first knowledge graph under multiple accounts during maintenance, upon receiving other access requests from account C regarding the generation data of the first knowledge graph, the method further includes:

[0020] Analyze the performance relationship between the multiple accounts maintained by the current database server that are related to the generation of the first knowledge graph and the account C;

[0021] Among them, the performance relationship includes the positional relationship between the hardware devices of the two, confirming that the network link between the two completes the local first knowledge graph transmission time of the corresponding maintained account is less than the total time of account C obtaining the data content of the first knowledge graph generation from the database server and generating the first knowledge graph from the data content. The account with the largest difference is selected as the target account to provide the first knowledge graph.

[0022] The database server triggers the local terminal application of the target account to send the first knowledge graph it generates to the terminal where account C is located.

[0023] Preferably, when exporting the entire knowledge graph on account B terminal, the method includes:

[0024] The width and height of the exported image are calculated based on the coordinates of all vertices in the graph. Specifically, the width of the exported image is obtained by subtracting the minimum x-coordinate value from the maximum x-coordinate value and adding a certain width (dist) to the maximum x-coordinate value. The height of the exported image is obtained by subtracting the minimum y-coordinate value from the maximum y-coordinate value and adding a certain width (dist).

[0025] Create a canvas element as the canvas for exporting the image, set its width and height to the width and height of the exported image, and set the background color to white;

[0026] Calculate the number of parts based on the width and height of the exported image; divide the width of the exported image by the width of the viewport, round the result up to get the number of parts in the x-direction; similarly, the number of parts in the y-direction can be calculated.

[0027] Save the current state of the graphic so that it can be restored after translation; continuously translate the graphic according to the calculated number of parts to draw the graphic of the current window onto the canvas until the end, finally piecing together the complete graphic, and then exporting it as an image.

[0028] Preferably, after the image is enlarged, the method further includes:

[0029] The current viewport cannot draw all points and edges. Calculations show that the image needs to be divided into two equal parts in both the x and y directions, resulting in a total of four parts. The image needs to be translated four times: First translation: x-direction: Xmin - 1 / 2dist + width * 0, y-direction: Ymin - 1 / 2dist + height * 0; Second translation: x-direction: Xmin - 1 / 2dist + width * 1, y-direction: Ymin - 1 / 2dist + height * 0; Third translation: x-direction: Xmin - 1 / 2dist + width * 0, y-direction: Xmin - 1 / 2dist + height * 1; Fourth translation: x-direction: Xmin - 1 / 2dist + width * 1, y-direction: Xmin - 1 / 2dist + height * 1. After each translation, the image is copied to the canvas and finally stitched together to form a complete image. Here, width is the viewport width, and height is the viewport height.

[0030] Secondly, the present invention also provides an apparatus for deriving a full graph based on a knowledge graph, used to implement the method for deriving a full graph based on a knowledge graph as described in the first aspect, the apparatus comprising:

[0031] 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 for performing the method for deriving a full graph based on a knowledge graph as described in the first aspect.

[0032] Thirdly, the present invention also provides a non-volatile computer storage medium storing computer-executable instructions that are executed by one or more processors to perform the method for deriving a full graph based on a knowledge graph as described in the first aspect.

[0033] This invention discovers that the same batch of data content in a database may be queried by different accounts (i.e., terminals), and corresponding knowledge graphs may be generated and used on their respective terminal sides. In this case, once an online terminal has already generated a knowledge graph for the same batch of data content, when other terminals access the same data content for the same purpose, it is possible to comprehensively analyze whether the interaction between the database server and the visitor is more efficient or whether it is more efficient to directly obtain the generated knowledge graph from the online terminal side, and to select the optimal one. This allows some terminals with insufficient computing power to skip the calculation process and achieve efficient knowledge graph response. Attached Figure Description

[0034] To more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings used in the embodiments of the present invention will be briefly described below. Obviously, the drawings described below are merely some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without any creative effort.

[0035] Figure 1 This is a schematic diagram of a method for deriving a full graph based on a knowledge graph, provided by an embodiment of the present invention.

[0036] Figure 2 This is a schematic diagram of a method for deriving a full graph based on a knowledge graph, provided by an embodiment of the present invention.

[0037] Figure 3 This is a schematic diagram of a method for deriving a full graph based on a knowledge graph, provided by an embodiment of the present invention.

[0038] Figure 4 This is a schematic diagram illustrating the process of deriving a full graph based on a knowledge graph, as provided in an embodiment of the present invention.

[0039] Figure 5 This is a schematic diagram illustrating the process of deriving a full graph based on a knowledge graph, as provided in an embodiment of the present invention.

[0040] Figure 6 This is a schematic diagram illustrating the process of deriving a full graph based on a knowledge graph, as provided in an embodiment of the present invention.

[0041] Figure 7 This is a schematic diagram of a device structure for deriving a full graph based on a knowledge graph, provided in an embodiment of the present invention. Detailed Implementation

[0042] To make the objectives, technical solutions, and advantages of this invention clearer, the invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the invention.

[0043] In the description of this invention, the terms "inner", "outer", "longitudinal", "lateral", "upper", "lower", "top", "bottom", etc., indicate the orientation or positional relationship based on the orientation or positional relationship shown in the accompanying drawings. They are only for the convenience of describing this invention and do not require that this invention must be constructed and operated in a specific orientation. Therefore, they should not be construed as limiting this invention.

[0044] Furthermore, the technical features involved in the various embodiments of the present invention described below can be combined with each other as long as they do not conflict with each other.

[0045] Example 1:

[0046] Embodiment 1 of this invention provides a method for deriving a full graph based on a knowledge graph. It should be noted beforehand that the character combinations such as "Account A" and "Account B" appearing in this embodiment are merely for easy differentiation of individuals of the same type and should not be interpreted as imposing excessive limitations on the corresponding subject. That is, within the jurisdiction of the database server, any account applied for by any object could be "Account A". Figure 1 As shown, it includes:

[0047] In step 201, after the database server receives an access request for data generated from the first knowledge graph and provides feedback on the data generated from the first knowledge graph, it records the account A that initiated the access request.

[0048] In step 202, after the database server receives other access requests for data generated related to the first knowledge graph, it confirms the account B from which the other access requests originated.

[0049] In step 203, based on the IP addresses of account B and account A, the location relationship between their hardware devices is analyzed. If it is confirmed that the network link between the two accounts completes the local transmission time of the first knowledge graph of account A less than the total time of account B obtaining the data content of the first knowledge graph from the database server and generating the first knowledge graph from the data content, the database server triggers the local terminal application of account A to send the first knowledge graph it generates to the terminal where account B is located.

[0050] In step 204, the terminal application where account B is located also receives the instruction sent by the database server, and after receiving the complete data packet containing the first knowledge graph from account A, returns a message to the database server indicating that the access request has ended normally.

[0051] This invention has discovered that the same batch of data content in a database may be accessed by different accounts (i.e., terminals), and corresponding knowledge graphs may be generated and used on their respective terminal sides. In this case, once an online terminal has already generated a knowledge graph for the same batch of data content, when other terminals access the same data content for the same purpose, it is possible to comprehensively analyze whether the interaction between the database server and the visitor is more efficient or whether it is more efficient to directly obtain the generated knowledge graph from the online terminal side, and to select the optimal method. This allows some terminals with insufficient computing power to skip the calculation process and achieve efficient knowledge graph response.

[0052] In this embodiment of the invention, when it is confirmed that the network link between the two accounts completes the local transmission time of the first knowledge graph for account A at a time greater than or equal to the total time for account B to obtain the data content related to the generation of the first knowledge graph from the database server and to generate the first knowledge graph from the data content, the method further includes:

[0053] When the database server retrieves relevant data content related to the first knowledge graph locally, it sends the data content to the terminal where account B is located via the network link between account B and the terminal application on account B. This allows the terminal application on account B to generate the first knowledge graph based on the received data content and then display the first knowledge graph on its terminal display interface.

[0054] In this embodiment of the invention, after receiving a complete data packet containing the first knowledge graph from account A, a message indicating normal termination of the access request is returned to the database server, specifically including:

[0055] After receiving the complete data packet containing the first knowledge graph from account A, a notification message is sent to the database server to indicate that the first knowledge graph of account A has been successfully synchronized.

[0056] After receiving the notification message, the database server sends the data content associated with the generation of the first knowledge graph from its local database server to account B terminal.

[0057] In this embodiment of the invention, after logging into the corresponding account, the terminal application sends an access request to the database server that includes the computing resource information of the device where the login account is located; thereby enabling the database server to calculate the time required to generate the first knowledge graph for the data content it wants to access.

[0058] The computing resource information includes one or more of the following: processor model, memory capacity, current remaining CPU percentage, and remaining memory percentage.

[0059] In this embodiment of the invention, after the database server establishes the generation information of the first knowledge graph under multiple accounts during the maintenance process, upon receiving other access requests from account C regarding the generation data of the first knowledge graph, such as... Figure 2 As shown, the method also includes:

[0060] In step 301, the performance relationship between the multiple accounts maintained by the current database server related to the generation of the first knowledge graph and the account C is analyzed.

[0061] Among them, the performance relationship includes the positional relationship between the two hardware devices.

[0062] In step 302, it is confirmed that the network link between the two accounts completes the local transmission time of the first knowledge graph of the corresponding maintained account less than the total time of account C obtaining the data content of the first knowledge graph generation from the database server and generating the first knowledge graph from the data content. The account with the largest difference is selected as the target account to provide the first knowledge graph.

[0063] In step 303, the database server triggers the local terminal application of the target account to send the first knowledge graph it generates to the terminal where account C is located.

[0064] The "Export Full Graph" method in this invention embodiment is a technique for exporting graph canvas data as an image. Current graph visualization frameworks use a new canvas for redrawing, which leads to efficiency degradation for G6 based on canvas as the data volume increases. While WebGL-based Sigma only exports the image of the current viewport, data outside the viewport cannot be exported, and efficiency still decreases as the amount of data drawn increases. When account B performs the full graph export, as shown... Figure 3 As shown, for reference Figures 4-6 The methods include:

[0065] In step 401, the width and height of the image are calculated and exported based on the coordinates of all vertices in the image.

[0066] That is, the width of the exported image is calculated by subtracting the minimum x-coordinate from the maximum x-coordinate and adding a certain width (dist) to it; the height of the exported image is calculated by subtracting the minimum y-coordinate from the maximum y-coordinate and adding a certain width (dist) to it. For example... Figure 4 As shown, the width and height of the rectangle are the same as the width and height of the exported image.

[0067] In step 402, a canvas element is created as the canvas for exporting the image, its width and height are set to the width and height of the exported image, and its background color is set to white.

[0068] In step 403, the exported image is divided into several parts based on its width and height. The width of the exported image is divided by the width of the viewport, and the result is rounded up to obtain the number of parts in the x-direction. Similarly, the number of parts in the y-direction can be calculated.

[0069] In step 404, the current state of the graphic is saved so that the graphic state can be restored after the graphic is translated; according to the calculated number of parts, the graphic of the current window is continuously translated and drawn onto the canvas until the end, and finally the complete graphic is assembled and then exported as an image.

[0070] If the width and height of the exported image are both smaller than the width and height of the original canvas, the graphic will be shifted to the center of the canvas, and then the current image will be drawn onto the prepared canvas before exporting the image directly.

[0071] If the width or height of the exported image is larger than the width or height of the original canvas, the image needs to be divided into several equal parts according to the size of the current viewport, such as... Figure 5 As shown. Then, the graphic is continuously translated, and each graphic is drawn separately onto the canvas. Finally, they are pieced together to form a complete graphic, and then the image is exported.

[0072] Among them, the image is enlarged for reference. Figure 6 The methods also include:

[0073] The current viewport cannot draw all points and edges. Calculations show that the image needs to be divided into two equal parts in both the x and y directions, resulting in a total of four parts. The image needs to be translated four times: First translation: x-direction: Xmin - 1 / 2dist + width * 0, y-direction: Ymin - 1 / 2dist + height * 0; Second translation: x-direction: Xmin - 1 / 2dist + width * 1, y-direction: Ymin - 1 / 2dist + height * 0; Third translation: x-direction: Xmin - 1 / 2dist + width * 0, y-direction: Xmin - 1 / 2dist + height * 1; Fourth translation: x-direction: Xmin - 1 / 2dist + width * 1, y-direction: Xmin - 1 / 2dist + height * 1. After each translation, the image is copied to the canvas and finally stitched together to form a complete image. Here, width is the viewport width, and height is the viewport height.

[0074] Example 2:

[0075] like Figure 7 The diagram shown is an architectural schematic of a device for deriving a full graph based on a knowledge graph, according to an embodiment of the present invention. The device for deriving a full graph based on a knowledge graph in this embodiment includes one or more processors 21 and a memory 22. Figure 7 Take a processor 21 as an example.

[0076] Processor 21 and memory 22 can be connected via a bus or other means. Figure 7 Taking the example of a connection between China and Israel via a bus.

[0077] The memory 22, as a non-volatile computer-readable storage medium, can be used to store non-volatile software programs and non-volatile computer-executable programs, such as the method for deriving the entire graph based on the knowledge graph in Embodiment 1. The processor 21 executes the method for deriving the entire graph based on the knowledge graph by running the non-volatile software programs and instructions stored in the memory 22.

[0078] Memory 22 may include high-speed random access memory, and may also include non-volatile memory, such as at least one disk storage device, flash memory device, or other non-volatile solid-state storage device. In some embodiments, memory 22 may optionally include memory remotely located relative to processor 21, which can be connected to processor 21 via a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.

[0079] The program instructions / modules are stored in the memory 22. When executed by one or more processors 21, they perform the method for deriving the full graph based on the knowledge graph in Embodiment 1 above, for example, performing the above-described method. Figures 1-3 The steps shown.

[0080] It is worth noting that the information interaction and execution process between the modules and units in the above-mentioned device and system are based on the same concept as the processing method embodiment of the present invention. For details, please refer to the description in the method embodiment of the present invention, and will not be repeated here.

[0081] Those skilled in the art will understand that all or part of the steps in the various methods of the embodiments can be implemented by a program instructing related hardware. The program can be stored in a computer-readable storage medium, which may include: read-only memory (ROM), random access memory (RAM), magnetic disk or optical disk, etc.

[0082] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of the present invention should be included within the protection scope of the present invention.

Claims

1. A method for deriving a full graph based on a knowledge graph, characterized in that, include: After receiving an access request for data generated from the first knowledge graph and responding with the content of the data generated from the first knowledge graph, the database server records the account A that initiated the access request. After receiving other access requests for data generated related to the first knowledge graph, the database server confirms the account B from which the other access requests originated. Based on the IP addresses of account B and account A, the positional relationship between their hardware devices is analyzed. It is confirmed that when the network link between the two accounts completes the local transmission time of the first knowledge graph of account A, which is less than the total time of account B obtaining the data content of the first knowledge graph from the database server and generating the first knowledge graph from the data content, the database server triggers the local terminal application of account A to send the first knowledge graph generated by it to the terminal where account B is located. The terminal application containing account B also received the instruction sent by the database server, and after receiving the complete data packet containing the first knowledge graph from account A, returned a message to the database server indicating that the access request had ended normally.

2. The method for deriving a full graph based on a knowledge graph according to claim 1, characterized in that, When it is confirmed that the network link between the two accounts completes the local transmission time of the first knowledge graph for account A at a time greater than or equal to the total time for account B to obtain the data content related to the generation of the first knowledge graph from the database server and to generate the first knowledge graph from the data content, the method further includes: When the database server retrieves relevant data content related to the first knowledge graph locally, it sends the data content to the terminal where account B is located via the network link between account B and the terminal application on account B. This allows the terminal application on account B to generate the first knowledge graph based on the received data content and then display the first knowledge graph on its terminal display interface.

3. The method for deriving a full graph based on a knowledge graph according to claim 1, characterized in that, After receiving the complete data packet containing the first knowledge graph from account A, the system returns a message to the database server indicating that the access request has been successfully completed. This message includes the following: After receiving the complete data packet containing the first knowledge graph from account A, a notification message is sent to the database server to indicate that the first knowledge graph of account A has been successfully synchronized. After receiving the notification message, the database server sends the data content associated with the generation of the first knowledge graph from its local database server to account B terminal.

4. The method for deriving a full graph based on a knowledge graph according to claim 1, characterized in that, In the terminal application, after logging into the corresponding account, the access request sent to the database server includes the computing resource information of the device where the corresponding login account is located; thereby enabling the database server to calculate the time for generating the first knowledge graph based on the data content it wants to access. The computing resource information includes one or more of the following: processor model, memory capacity, current remaining CPU percentage, and remaining memory percentage.

5. The method for deriving a full graph based on a knowledge graph according to claim 1, characterized in that, During database server maintenance, after establishing generation information for the first knowledge graph under multiple accounts, upon receiving another access request from account C regarding the generation data of the first knowledge graph, the method further includes: Analyze the performance relationship between the multiple accounts maintained by the current database server that are related to the generation of the first knowledge graph and the account C; Among them, the performance relationship includes the positional relationship between the hardware devices of the two, confirming that the network link between the two completes the local first knowledge graph transmission time of the corresponding maintained account is less than the total time of account C obtaining the data content of the first knowledge graph generation from the database server and generating the first knowledge graph from the data content. The account with the largest difference is selected as the target account to provide the first knowledge graph. The database server triggers the local terminal application of the target account to send the first knowledge graph it generates to the terminal where account C is located.

6. The method for deriving a full graph based on a knowledge graph according to any one of claims 1-5, characterized in that, When exporting the full knowledge graph from account B, the methods include: The width and height of the exported image are calculated based on the coordinates of all vertices in the graph. Specifically, the width of the exported image is obtained by subtracting the minimum x-coordinate value from the maximum x-coordinate value and adding a certain width (dist) to the maximum x-coordinate value. The height of the exported image is obtained by subtracting the minimum y-coordinate value from the maximum y-coordinate value and adding a certain width (dist). Create a canvas element as the canvas for exporting the image, set its width and height to the width and height of the exported image, and set the background color to white; Calculate the number of parts based on the width and height of the exported image; divide the width of the exported image by the width of the viewport, round the result up to get the number of parts in the x-direction; similarly, the number of parts in the y-direction can be calculated. Save the current state of the graphic so that it can be restored after translation; continuously translate the graphic according to the calculated number of parts to draw the graphic of the current window onto the canvas until the end, finally piecing together the complete graphic, and then exporting it as an image.

7. The method for deriving a full graph based on a knowledge graph according to claim 6, characterized in that, After enlarging the image, the method also includes: The current viewport cannot draw all points and edges. Calculations show that the image needs to be divided into two equal parts in both the x and y directions, resulting in a total of four parts. The image needs to be translated four times: First translation: x-direction: Xmin - 1 / 2dist + width * 0, y-direction: Ymin - 1 / 2dist + height * 0; Second translation: x-direction: Xmin - 1 / 2dist + width * 1, y-direction: Ymin - 1 / 2dist + height * 0; Third translation: x-direction: Xmin - 1 / 2dist + width * 0, y-direction: Xmin - 1 / 2dist + height * 1; Fourth translation: x-direction: Xmin - 1 / 2dist + width * 1, y-direction: Xmin - 1 / 2dist + height * 1. After each translation, the image is copied to the canvas and finally stitched together to form a complete image. Here, width is the viewport width, and height is the viewport height.

8. A device for deriving a full graph based on a knowledge graph, characterized in that, The device includes: 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 for performing the method for deriving a full graph based on a knowledge graph as described in any one of claims 1-7.

Images