Rapid positioning method and system based on knowledge graph

Abstract

The present application relates to a rapid positioning method and system based on a knowledge graph, wherein the method includes: a positioning event triggering step, setting a positioning button based on a relationship graph, triggering a positioning event through the positioning button, and triggering a pop-up window, the pop-up window includes an input box and a search button; a keyword acquisition step, inputting the content to be located through the input box, processing the content to be located to obtain the corresponding keyword; a search step, retrieving the keyword through the search button, obtaining the entity containing the keyword in the relationship graph and the corresponding entity relationship to form a result array and displaying the result array accordingly. It is realized through the interaction between the user and the knowledge graph, which solves the current problem of inaccurate multi-node positioning and realizes rapid and accurate positioning.

Description

Technical Field

[0001] The present application relates to the field of knowledge engineering technology, and in particular to a rapid positioning method and system based on a knowledge graph. Background Art

[0002] In knowledge graph products, users can expand multiple relationships between multiple entities. In actual application scenarios, the relationship graph presented on the page may be very complex, containing many nodes and connections between nodes, which makes it impossible for users to quickly locate the nodes they want to focus on.

[0003] The search and positioning function in the prior art searches based on the input keywords and highlights all the nodes that are fuzzily matched. If there are many nodes that are fuzzily matched, there is no way to quickly locate the node you want to focus on.

[0004] Currently, no effective solution has been proposed for the problem of inaccurate multi-node positioning in related technologies. Summary of the invention

[0005] The embodiments of the present application provide a knowledge graph-based rapid positioning method and system, and provide an interactive implementation of rapid positioning to at least solve the problem of inaccurate multi-node positioning in related technologies.

[0006] In a first aspect, an embodiment of the present application provides a rapid positioning method based on a knowledge graph, comprising the following steps:

[0007] A positioning event triggering step is to set a positioning button based on a relationship diagram, and trigger a pop-up window through the positioning button, wherein the pop-up window includes an input box and a search button;

[0008] A keyword acquisition step, inputting the content to be located through the input box, and processing the content to be located to acquire corresponding keywords;

[0009] In the search step, the keyword is searched through the search button to obtain a result array consisting of entities containing the keyword and corresponding entity relationships in the relationship graph and the result array is displayed accordingly.

[0010] In some embodiments, the searching step specifically includes:

[0011] A keyword expansion step, expanding based on the keywords, wherein the expansion method includes synonyms and / or near-synonyms;

[0012] The relationship graph traversal step traverses all entities and entity relationships in the relationship graph, determines whether the corresponding titles of the entities and entity relationships contain keywords, and if so, stores the entities and entity relationships in the result array.

[0013] In some embodiments, the keyword acquisition step further includes:

[0014] A process array acquisition step, obtaining the content to be located by monitoring the onchange event, expanding the content to be located, and traversing the relationship graph according to the expansion result to obtain the entity and / or entity relationship including the content to be located and store them in a process array;

[0015] The keyword selection step is to display the keyword in the form of a drop-down list document through the input box according to the process array. The entity or entity relationship to be located is selected through the drop-down list to obtain the corresponding keyword, or the keyword is directly input into the box.

[0016] In some embodiments, the searching step further comprises a displaying step:

[0017] The first display step is to call the interface of the relationship graph according to the ID of the index group of the result array, and use the center method to move the entities or entity relationships corresponding to the first group to the middle of the window, and enlarge and highlight them, wherein the index is initially set to 1;

[0018] The second display step is to update the current index to index+1 when the search button is triggered again or the enter key is pressed, and repeat the first display step. When the updated index exceeds the length of the result array, locate the first group of the result array.

[0019] In a second aspect, an embodiment of the present application provides a rapid positioning system based on a knowledge graph, applying the rapid positioning method based on a knowledge graph of the first aspect, including:

[0020] Triggering a positioning event module, setting a positioning button based on a relationship diagram, triggering a pop-up window through the positioning button, the pop-up window includes an input box and a search button;

[0021] The keyword acquisition module inputs the content to be located through the input box, processes the content to be located and obtains the corresponding keywords;

[0022] The search module searches for keywords through the search button, obtains a result array consisting of entities containing keywords and corresponding entity relationships in the relationship graph, and displays the result array accordingly.

[0023] In some embodiments, the search module specifically includes:

[0024] A keyword expansion unit, which expands based on keywords, and its expansion methods include synonyms and / or near-synonyms;

[0025] The relationship graph traversal unit traverses all entities and entity relationships in the relationship graph, determines whether the corresponding titles of the entities and entity relationships contain keywords, and if so, stores the entities and entity relationships in the result array.

[0026] In some embodiments, the keyword acquisition module further includes:

[0027] A process array acquisition unit obtains the content to be located by monitoring the onchange event, expands the content to be located, and traverses the relationship graph according to the expansion result to obtain the entity and / or entity relationship including the content to be located and store them in a process array;

[0028] The keyword selection unit displays the process array in the form of a drop-down list document through an input box. The entity or entity relationship to be located is selected through the drop-down list to obtain the corresponding keyword, or the keyword is directly input into the box.

[0029] In some of the embodiments, a display module is further included:

[0030] The first display unit calls the interface of the relationship graph according to the ID of the index group of the result array, uses the center method to move the entity or entity relationship corresponding to the first group to the middle of the window, and enlarges and highlights it, wherein the index is initially set to 1;

[0031] The second display unit, when the search button is triggered again or the enter key is pressed on the keyboard, updates the current index to index+1, repeats the first display step, and locates the first group of the result array when the updated index exceeds the length of the result array.

[0032] In a third aspect, an embodiment of the present application provides a computer device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the computer program, the knowledge graph-based rapid positioning method as described in the first aspect above is implemented.

[0033] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the knowledge graph-based rapid positioning method as described in the first aspect above.

[0034] Compared with related technologies, the fast positioning method and system based on knowledge graph provided in the embodiments of the present application can be applied to the field of information retrieval technology and the field of query optimization technology. It is implemented through the interaction between users and knowledge graphs, which solves the current problem of inaccurate multi-node positioning and realizes fast and accurate positioning.

[0035] Details of one or more embodiments of the present application are set forth in the following drawings and description to make other features, objects, and advantages of the present application more readily apparent. BRIEF DESCRIPTION OF THE DRAWINGS

[0036] The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

[0037] Figure 1 is a flow chart of a rapid positioning method based on a knowledge graph according to an embodiment of the present application;

[0038] Figure 2 is a flowchart of a search step according to an embodiment of the present application;

[0039] Figure 3 is a flowchart of a keyword acquisition step according to an embodiment of the present application;

[0040] Figure 4 is a flow chart of display steps according to an embodiment of the present application;

[0041] Figure 5 is a flowchart of a rapid positioning method based on a knowledge graph according to a preferred embodiment of the present application;

[0042] Figure 6 It is a structural block diagram of a rapid positioning system based on a knowledge graph according to an embodiment of the present application;

[0043] Figure 7 Schematic diagram of the hardware structure of a computer device according to an embodiment of the present application. Description of the drawings:

[0045] Triggering positioning event module 1; keyword acquisition module 2;

[0046] Search module 3; keyword expansion unit 31;

[0047] Relationship graph traversal unit 32; process array acquisition unit 21;

[0048] Keyword selection unit 22; display module 4;

[0049] A first display unit 41; a second display unit 42;

[0050] Processor 81; memory 82; communication interface 83; bus 80. DETAILED DESCRIPTION

[0051] In order to make the purpose, technical solutions and advantages of the present application clearer, the present application is described and illustrated below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not intended to limit the present application. Based on the embodiments provided in the present application, all other embodiments obtained by ordinary technicians in the field without making creative work are within the scope of protection of the present application.

[0052] Obviously, the drawings described below are only some examples or embodiments of the present application. For ordinary technicians in this field, the present application can also be applied to other similar scenarios based on these drawings without creative work. In addition, it can also be understood that although the efforts made in this development process may be complicated and lengthy, for ordinary technicians in this field related to the content disclosed in this application, some changes in design, manufacturing or production based on the technical content disclosed in this application are just conventional technical means, and should not be understood as insufficient content disclosed in this application.

[0053] Reference to "embodiments" in this application means that a particular feature, structure, or characteristic described in conjunction with the embodiments may be included in at least one embodiment of the present application. The appearance of the phrase in various locations in the specification does not necessarily refer to the same embodiment, nor is it an independent or alternative embodiment that is mutually exclusive with other embodiments. It is explicitly and implicitly understood by those of ordinary skill in the art that the embodiments described in this application may be combined with other embodiments without conflict.

[0054] Unless otherwise defined, the technical terms or scientific terms involved in this application should be understood by people with ordinary skills in the technical field to which this application belongs. The words "one", "a", "a", "the" and the like involved in this application do not indicate a quantity limitation, and may indicate the singular or plural. The terms "include", "comprise", "have" and any of their variations involved in this application are intended to cover non-exclusive inclusions; for example, a process, method, system, product or device that includes a series of steps or modules (units) is not limited to the listed steps or units, but may also include steps or units that are not listed, or may also include other steps or units inherent to these processes, methods, products or devices. The words "connect", "connected", "coupled" and the like involved in this application are not limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect. The "multiple" involved in this application refers to two or more. "And / or" describes the association relationship of associated objects, indicating that there may be three relationships, for example, "A and / or B" can mean: A exists alone, A and B exist at the same time, and B exists alone. The character " / " generally indicates that the objects before and after are in an "or" relationship. The terms "first", "second", "third", etc. involved in this application are only used to distinguish similar objects and do not represent a specific ordering of the objects.

[0055] This embodiment also provides a rapid positioning method based on a knowledge graph. Figure 1 is a flowchart of a rapid positioning method based on a knowledge graph according to an embodiment of the present application, such as Figure 1 As shown, the process includes the following steps:

[0056] Triggering a positioning event step S1, setting a positioning button based on a relationship diagram, triggering a pop-up window through the positioning button, the pop-up window including an input box and a search button;

[0057] Keyword acquisition step S2, inputting the content to be located through the input box, processing the content to be located to obtain corresponding keywords;

[0058] Search step S3, searching for keywords through the search button, obtaining a result array consisting of entities containing keywords and corresponding entity relationships in the relationship graph, and displaying the result array accordingly.

[0059] The above steps provide a quick positioning method to help users quickly locate specified data, improve user experience, and save users time in finding nodes in a dense relationship graph.

[0060] In some of these embodiments, Figure 2 is a flowchart of the search steps according to an embodiment of the present application, such as Figure 2As shown, the search step S3 specifically includes:

[0061] Keyword expansion step S31, expanding according to the keyword, and the expansion method includes synonyms and / or near synonyms;

[0062] In the relationship graph traversal step S32, all entities and entity relationships in the relationship graph are traversed to determine whether the corresponding titles of the entities and entity relationships contain keywords. If so, the entities and entity relationships are stored in the result array.

[0063] The above steps are used to locate keywords. At the same time, this process can be combined with the selection of related content in the process of expanding the content to be located to increase the positioning speed.

[0064] In some of these embodiments, Figure 3 is a flowchart of the keyword acquisition steps according to an embodiment of the present application, such as Figure 3 As shown, the keyword acquisition step S2 also includes:

[0065] Process array acquisition step S21, obtaining the content to be located by monitoring the onchange event, expanding the content to be located, and traversing the relationship graph according to the expansion result to obtain the entity and / or entity relationship including the content to be located and store them in a process array;

[0066] In the keyword selection step S22, the process array is displayed in a drop-down list document form through an input box, and the entity or entity relationship to be located is selected through the drop-down list to obtain the corresponding keyword, or the keyword is directly input into the box to obtain the keyword.

[0067] Through the above process, the array acquisition step is expanded according to the content to be located, and the corresponding expanded content is displayed to the user for easy selection by the user, so as to achieve accurate and fast positioning when multiple nodes meet the content to be located. At the same time, the positioning speed of the relationship graph can be improved through secondary selection.

[0068] In some of these embodiments, Figure 4 is a flow chart of display steps according to an embodiment of the present application, such as Figure 4 As shown, after the searching step S3, a displaying step S4 is also included:

[0069] The first display step S41, calling the interface of the relationship graph according to the id of the index group of the result array, using the center method to move the entities or entity relationships corresponding to the first group to the middle of the window, and enlarging and highlighting them, wherein the index is initially set to 1;

[0070] The second display step S42, when the search button is triggered again or the enter key is pressed, the current index is updated to index+1, and the first display step is repeated. When the updated index exceeds the length of the result array, the first group of the result array is located.

[0071] The Enter key of the above-mentioned keyboard refers to the Enter key of a built-in or external keyboard of a computer device, and the computer device may refer to a desktop computer or a laptop computer, etc.

[0072] Through the above steps, the positioning results can be displayed and highlighted one by one, which is convenient for users to query and improves the user experience.

[0073] The embodiments of the present application are described and illustrated below through preferred embodiments.

[0074] Figure 5 It is a flowchart of a rapid positioning method based on a knowledge graph according to a preferred embodiment of the present application.

[0075] S501: Define a quick positioning button. There is already a relationship diagram, and the data of the relationship diagram is already in the front-end variables. Define a quick positioning button on the relationship diagram.

[0076] S502, input and expand step, when the user clicks the quick locate button, a window pops up, which includes an input box and a search button.

[0077] When the user inputs in the input box, the onchange event will be triggered. By listening to the onchange event of the input box, you can get the content entered by the user.

[0078] Define an array elementList to store the entity or relationship data queried based on the user input content. The specific method is: traverse all entities and relationships in the relationship graph, determine whether the title of the entity and relationship contains the keyword entered by the user, and if so, add the current entity or relationship to the defined array elementList.

[0079] It should be noted that the search logic here can be expanded, and searches can be performed based on different fields in the input content.

[0080] S503, search and display step, the array elementList obtained in S502 is displayed in the form of a drop-down list below the input box. The user can select the node or link to be located from the drop-down list, or directly enter without selecting and then click the search button. The specific selection corresponding operations are as follows:

[0081] When the user directly clicks the search button, the content entered by the user is used as a keyword to search the data in the relationship graph, and the nodes and connections between the nodes whose titles contain the input keywords are retrieved to obtain a result array (the retrieval method is the same as S402), and this result array is cached. First, the first item of the above array is obtained, and the interface of the relationship graph is called according to the id of the first item. The node or connection specified by the user is moved to the middle of the window, enlarged to 1.1 times the size, and highlighted, and the index at this time is recorded. If the user triggers the search button again, or presses the Enter key on the keyboard, the index item in the array is obtained, and the above logic is repeated to locate the node or relationship in the relationship graph, and the recorded index is updated to index+1. When index+1 exceeds the length of the array, the first item of the array is located.

[0082] When the user selects an item from the drop-down list and clicks it, the corresponding node or edge in the relationship graph is queried based on the ID of the node or edge selected by the user. At the same time, the center method is used to move the node or edge to the center of the window, enlarge it to 1.1 times the size, and highlight it. The specific method is the same as above.

[0083] It should be noted that the steps shown in the above process or the flowchart in the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and although a logical order is shown in the flowchart, in some cases, the steps shown or described can be executed in an order different from that shown here.

[0084] This embodiment also provides a rapid positioning system based on a knowledge graph, which is used to implement the above embodiments and preferred implementations, and will not be repeated here. As used below, the terms "module", "unit", "subunit", etc. can implement a combination of software and / or hardware for a predetermined function. Although the devices described in the following embodiments are preferably implemented in software, the implementation of hardware, or a combination of software and hardware, is also possible and conceivable.

[0085] Figure 6 is a structural block diagram of a rapid positioning system based on a knowledge graph according to an embodiment of the present application, such as Figure 6 As shown, the system includes:

[0086] Triggering the positioning event module 1, setting a positioning button based on a relationship diagram, triggering a pop-up window through the positioning button, the pop-up window includes an input box and a search button;

[0087] Keyword acquisition module 2, inputs the content to be located through the input box, processes the content to be located to obtain the corresponding keywords;

[0088] Search module 3 searches for keywords through a search button, obtains a result array consisting of entities containing keywords and corresponding entity relationships in the relationship graph, and displays the result array accordingly.

[0089] In some embodiments, the search module 3 specifically includes:

[0090] A keyword expansion unit 31, which expands the keywords, including synonyms and / or near-synonyms;

[0091] The relationship graph traversal unit 32 traverses all entities and entity relationships in the relationship graph, determines whether the corresponding titles of the entities and entity relationships contain keywords, and if so, stores the entities and entity relationships in the result array.

[0092] The above settings can help users quickly locate the specified data, improve the user experience, and save users time in finding nodes in a dense relationship graph.

[0093] In some embodiments, the keyword acquisition module 2 further includes:

[0094] The process array acquisition unit 21 obtains the content to be located by monitoring the onchange event, expands the content to be located, and traverses the relationship graph according to the expansion result to obtain the entity and / or entity relationship including the content to be located and store them in a process array;

[0095] The keyword selection unit 22 displays the process array in a drop-down list document form through an input box, selects the entity or entity relationship to be located through the drop-down list to obtain the corresponding keyword, or directly inputs the box to obtain the keyword.

[0096] The positioning of keywords is achieved through the above-mentioned unit settings. At the same time, this process can be combined with the selection of related content in the process of expanding the content to be positioned to improve the positioning speed.

[0097] The process array acquisition unit 21 expands the content to be located and displays the corresponding expanded content to the user for user selection, so as to achieve accurate and fast positioning when multiple nodes meet the content to be located. At the same time, the keyword selection unit 22 can improve the positioning speed and accuracy of the relationship graph through secondary selection.

[0098] In some of the embodiments, a display module 4 is further included:

[0099] The first display unit 41 calls the interface of the relationship graph according to the id of the index group of the result array, uses the center method to move the entities or entity relationships corresponding to the first group to the middle of the window, and enlarges and highlights them, wherein the index is initially set to 1;

[0100] The second display unit 42, when the search button is triggered again or the enter key is pressed, updates the current index to index+1, repeats the first display step, and locates the first group of the result array when the updated index exceeds the length of the result array.

[0101] The Enter key of the above-mentioned keyboard refers to the Enter key of a built-in or external keyboard of a computer device, and the computer device may refer to a desktop computer or a laptop computer, etc.

[0102] It should be noted that the above modules can be functional modules or program modules, and can be implemented by software or hardware. For modules implemented by hardware, the above modules can be located in the same processor; or the above modules can be located in different processors in any combination.

[0103] In addition, combined Figure 1 The fast positioning method based on the knowledge graph described in the embodiment of the present application can be implemented by a computer device. Figure 7 Schematic diagram of the hardware structure of a computer device according to an embodiment of the present application.

[0104] The computer device may include a processor 81 and a memory 82 storing computer program instructions.

[0105] Specifically, the processor 81 may include a central processing unit (CPU), or an application specific integrated circuit (ASIC), or may be configured to implement one or more integrated circuits of the embodiments of the present application.

[0106] Among them, the memory 82 may include a large-capacity memory for data or instructions. By way of example and not limitation, the memory 82 may include a hard disk drive (HDD), a floppy disk drive, a solid-state drive (SSD), a flash memory, an optical disk, a magneto-optical disk, a magnetic tape, or a universal serial bus (USB) drive, or a combination of two or more of these. Where appropriate, the memory 82 may include a removable or non-removable (or fixed) medium. Where appropriate, the memory 82 may be inside or outside the data processing device. In a specific embodiment, the memory 82 is a non-volatile memory. In a specific embodiment, the memory 82 includes a read-only memory (ROM) and a random access memory (RAM). Where appropriate, the ROM may be a mask-programmed ROM, a programmable ROM (PROM), an erasable PROM (EPROM), an electrically erasable PROM (EEPROM), an electrically alterable ROM (EAROM) or a flash memory (FLASH), or a combination of two or more of these. Under appropriate circumstances, the RAM can be a static random access memory (SRAM) or a dynamic random access memory (DRAM), wherein the DRAM can be a fast page mode dynamic random access memory (FPMDRAM), an extended data output dynamic random access memory (EDODRAM), a synchronous dynamic random access memory (SDRAM), etc.

[0107] The memory 82 may be used to store or cache various data files required for processing and / or communication, as well as possible computer program instructions executed by the processor 81 .

[0108] The processor 81 reads and executes computer program instructions stored in the memory 82 to implement any one of the knowledge graph-based rapid positioning methods in the above-mentioned embodiments.

[0109] In some of these embodiments, the computer device may further include a communication interface 83 and a bus 80. Figure 7 As shown, the processor 81, the memory 82, and the communication interface 83 are connected via a bus 80 and communicate with each other.

[0110] The communication interface 83 is used to implement communication between the modules, devices, units and / or equipment in the embodiment of the present application. The communication interface 83 can also implement data communication with other components such as: external devices, image / data acquisition equipment, databases, external storage, and image / data processing workstations.

[0111] The bus 80 includes hardware, software or both, and couples the components of the computer device to each other. The bus 80 includes but is not limited to at least one of the following: a data bus, an address bus, a control bus, an expansion bus, and a local bus. By way of example and not limitation, bus 80 may include an Accelerated Graphics Port (AGP) or other graphics bus, an Extended Industry Standard Architecture (EISA) bus, a Front Side Bus (FSB), a Hyper Transport (HT) interconnect, an Industry Standard Architecture (ISA) bus, an InfiniBand interconnect, a Low Pin Count (LPC) bus, a memory bus, a Micro Channel Architecture (MCA) bus, a Peripheral Component Interconnect (PCI) bus, a PCI-Express (PCI-X) bus, a Serial Advanced Technology Attachment (SATA) bus, a Video Electronics Standards Association Local Bus (VLB) bus, or other suitable buses or a combination of two or more of these. Where appropriate, bus 80 may include one or more buses. Although embodiments of the present application describe and illustrate a particular bus, the present application contemplates any suitable bus or interconnect.

[0112] The computer device can execute the keyword acquisition step in the embodiment of the present application based on the acquired content to be located, thereby realizing the combination Figure 1 Described is a fast positioning method based on knowledge graph.

[0113] In addition, in combination with the fast positioning method based on the knowledge graph in the above embodiment, the embodiment of the present application can provide a computer-readable storage medium for implementation. The computer-readable storage medium stores computer program instructions; when the computer program instructions are executed by the processor, any one of the fast positioning methods based on the knowledge graph in the above embodiment is implemented.

[0114] The technical features of the above-described embodiments may be arbitrarily combined. To make the description concise, not all possible combinations of the technical features in the above-described embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0115] The above-mentioned embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the invention patent. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the patent of the present application shall be subject to the attached claims.

Claims

1. A rapid positioning method based on knowledge graph, characterized in that: The following steps are involved: A positioning event triggering step is to set a positioning button based on a relationship diagram, and trigger a pop-up window through the positioning button, wherein the pop-up window includes an input box and a search button; A keyword acquisition step, inputting the content to be located through the input box, and processing the content to be located to acquire corresponding keywords; A search step, searching the keyword through the search button, obtaining a result array consisting of entities containing the keyword and corresponding entity relationships in the relationship graph, and displaying the result array accordingly; The keyword acquisition step further includes: A process array acquisition step, obtaining the content to be located by monitoring an onchange event, expanding the content to be located, and traversing the relationship graph according to the expansion result to obtain the entity and / or the entity relationship including the content to be located and store them in a process array; The keyword selection step is to display the keyword in a drop-down list document form through the input box according to the process array, select the entity or entity relationship to be located through the drop-down list to obtain the corresponding keyword, or directly obtain the keyword through the input box.

2. The rapid positioning method based on knowledge graph according to claim 1 is characterized in that: The searching step specifically includes: A keyword expansion step, expanding the keywords according to the keywords, wherein the expansion method includes synonyms and / or near-synonyms; The relationship graph traversal step traverses all entities and entity relationships in the relationship graph, determines whether the corresponding titles of the entities and the entity relationships contain the keyword, and if so, stores the entities and the entity relationships in the result array.

3. The rapid positioning method based on knowledge graph according to claim 1, characterized in that: The search step is followed by the display step: The first display step is to call the interface of the relationship graph according to the id of the index group of the result array, and use the center method to move the entities or entity relationships corresponding to the first group to the middle of the window, and enlarge and highlight them, wherein the index is initially set to 1; The second display step, when the search button is triggered again or the enter key on the keyboard is pressed, the current index is updated to index+1, and the first display step is repeated. When the updated index exceeds the length of the result array, the first group of the result array is located.

4. A rapid positioning system based on knowledge graph, applying the rapid positioning method based on knowledge graph described in any one of claims 1 to 3, characterized in that: include: Triggering a positioning event module, setting a positioning button based on a relationship diagram, triggering a pop-up window through the positioning button, the pop-up window including an input box and a search button; A keyword acquisition module, inputting the content to be located through the input box, and processing the content to be located to obtain corresponding keywords; A search module, which searches for the keyword through the search button, obtains a result array consisting of entities containing the keyword and corresponding entity relationships in the relationship graph, and displays the result array accordingly; The keyword acquisition module further includes: A process array acquisition unit obtains the content to be located by monitoring an onchange event, expands the content to be located, and traverses the relationship graph according to the expansion result to obtain the entity and / or the entity relationship including the content to be located and store them in a process array; The keyword selection unit displays the process array in a drop-down list document form through the input box, selects the entity or entity relationship to be located through the drop-down list to obtain the corresponding keyword, or directly obtains the keyword through the input box.

5. The rapid positioning system based on knowledge graph according to claim 4 is characterized in that: The search module specifically includes: A keyword expansion unit, which expands the keywords, including synonyms and / or near-synonyms; The relationship graph traversal unit traverses all entities and entity relationships in the relationship graph, determines whether the corresponding titles of the entities and the entity relationships contain the keyword, and if so, stores the entities and the entity relationships in the result array.

6. The rapid positioning system based on knowledge graph according to claim 4 is characterized in that: Also includes display module: The first display unit calls the interface of the relationship diagram according to the id of the first group of the result array, uses the center method to move the entity or entity relationship corresponding to the first group to the middle of the window, enlarges and highlights it, and records the id as index; The second display unit, when the search button is triggered again or the enter key on the keyboard is pressed, updates the current index to index+1, repeats the first display step, and locates the first group of the result array when the updated index exceeds the length of the result array.

7. A computer device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, it implements the knowledge graph-based rapid positioning method as described in any one of claims 1 to 3.

8. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, a rapid positioning method based on a knowledge graph as described in any one of claims 1 to 3 is implemented.

Images