CN116756334A - Link tracking method and device based on knowledge graph - Google Patents

Link tracking method and device based on knowledge graph Download PDF

Info

Publication number
CN116756334A
CN116756334A CN202310638095.9A CN202310638095A CN116756334A CN 116756334 A CN116756334 A CN 116756334A CN 202310638095 A CN202310638095 A CN 202310638095A CN 116756334 A CN116756334 A CN 116756334A
Authority
CN
China
Prior art keywords
graph
link tracking
link
web
knowledge
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202310638095.9A
Other languages
Chinese (zh)
Inventor
杨娟
邵伯仲
蔡伟培
翟士丹
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Haizhi Xingtu Technology Co ltd
Original Assignee
Beijing Haizhi Xingtu Technology Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Haizhi Xingtu Technology Co ltd filed Critical Beijing Haizhi Xingtu Technology Co ltd
Priority to CN202310638095.9A priority Critical patent/CN116756334A/en
Publication of CN116756334A publication Critical patent/CN116756334A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/30Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/36Creation of semantic tools, e.g. ontology or thesauri
    • G06F16/367Ontology
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/958Organisation or management of web site content, e.g. publishing, maintaining pages or automatic linking

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Animal Behavior & Ethology (AREA)
  • Computational Linguistics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The application provides a link tracking method based on a knowledge graph, which comprises the following steps: the web terminal initiates the link tracking, the server side graph management component calculates the Session ID for initiating the link tracking, returns to the web terminal, and submits the link tracking task to the graph analysis component; the diagram analysis component performs diagram calculation and analysis according to the business rules and notifies the diagram management component to acquire a calculation result; the diagram management component persists the acquired calculation result to a corresponding storage medium according to the Session ID; the web side polls and initiates a query result request according to the acquired Session ID, the server side acquires result data from the graph management component through the graph display component, constructs a directed connected graph according to the corresponding business rule and returns the directed connected graph to the web side; and rendering by the web end according to the result, and performing link tracking operation. According to the link tracking method based on the knowledge graph, which is provided by the application, on-line dynamic graph construction can be performed in the process of constructing the knowledge graph, and an invalid graph analysis link can be manually terminated in the process of constructing the graph.

Description

Link tracking method and device based on knowledge graph
Technical Field
The application relates to the technical field of data management, in particular to a link tracking method, device and equipment based on a knowledge graph and a computer readable storage medium.
Background
The description of the background art to which the present application pertains is merely for illustrating and facilitating understanding of the summary of the application, and should not be construed as an explicit recognition or presumption by the applicant that the applicant regards the prior art as the filing date of the first filed application.
The knowledge graph is a technical method for describing the association relationship between knowledge and modeling world everything by using a graph model, in the prior art, online dynamic graph construction cannot be performed in the process of constructing the graph by using the knowledge graph, and the graph construction efficiency is low.
In order to solve the technical problems, the application provides a link tracking method, a device, equipment and a computer readable storage medium based on a knowledge graph, wherein the link tracking method displays dynamic graphs in a visual form of the knowledge graph, obtains a group of entity and relation data according to a graph sequence to generate a directed communication graph, supports on-line single link to stop tracking by combining actual conditions, supports all links to stop tracking, and supports a new round of link tracking from a certain node after the dynamic graphs are completed.
Disclosure of Invention
The application provides a link tracking method, a device, equipment and a computer readable storage medium based on a knowledge graph, wherein the link tracking method displays dynamic graphs in a visual form of the knowledge graph, a group of entities and relation data are obtained according to the graph sequence, a directed connected graph is generated, a single link is supported to stop tracking on line according to actual conditions, all links are supported to stop tracking, and after the dynamic graphs are completed, a new round of link tracking is supported from a certain node as a starting point.
The embodiment of the first aspect of the application provides a link tracking method based on a knowledge graph, which comprises the following steps: the web terminal initiates the link tracking, the server side graph management component calculates the Session ID for initiating the link tracking, returns to the web terminal, and submits the link tracking task to the graph analysis component; the diagram analysis component performs diagram calculation and analysis according to the business rules and notifies the diagram management component to acquire a calculation result; the diagram management component persists the acquired calculation result to a corresponding storage medium according to the Session ID; the web side polls and initiates a query result request according to the acquired Session ID, the server side acquires result data from the graph management component through the graph display component, constructs a directed connected graph according to the corresponding business rule and returns the directed connected graph to the web side; and rendering by the web end according to the result, and performing link tracking operation.
Preferably, the web terminal initiates the link tracking, the server side graph management component calculates the Session ID for initiating the link tracking, returns to the web terminal, submits the link tracking task to the graph analysis component, and initiates the link tracking according to a certain piece of service edge data.
Preferably, the web terminal initiates the link tracking, the server side graph management component calculates the Session ID for initiating the link tracking, returns to the web terminal, submits the link tracking task to the graph analysis component, and calculates the Session ID for initiating the link tracking according to the related metadata.
Preferably, the web end performs rendering according to the result, and in the step of performing link tracking operation, the link tracking operation performed includes manually initiating a stopping of link tracking according to the situation, or initiating a new round of link tracking according to a certain entity point.
Preferably, the web end performs rendering according to the result, and the link tracking operation step further includes, after starting link tracking, judging whether the tracking depth is reached, if so, automatically stopping link tracking.
Preferably, after the link tracking is started, whether the tracking depth is reached is judged, if not, whether the link tracking is stopped is judged, and if so, the link tracking is stopped manually.
Preferably, whether the link tracking is stopped is judged, if not, the result is calculated and updated, and a new round of link tracking is initiated according to a certain entity point.
The embodiment of the second aspect of the present application further provides a link tracking device based on a knowledge graph, including: the link tracking task submitting module is used for the web end to initiate link tracking, the server side graph management component calculates a Session ID for initiating the link tracking, returns the Session ID to the web end and submits the link tracking task to the graph analysis component; the graph calculation analysis module is used for carrying out graph calculation and analysis by the graph analysis component according to the business rules and notifying the graph management component to acquire a calculation result; the persistence module is used for persistence of the acquired calculation result to a corresponding storage medium according to the Session ID by the graph management component; the communication graph construction module is used for the web end to poll and initiate a query result request according to the acquired Session ID, the server end obtains result data from the graph management assembly through the graph display assembly, constructs a directed communication graph according to the corresponding business rule and returns the directed communication graph to the web end; and the link tracking module is used for rendering according to the result by the web end and carrying out link tracking operation.
Embodiments of the third aspect of the present application also provide a knowledge-graph-based link tracking device, which includes a memory and a processor; wherein the memory is for storing executable program code; the processor is configured to read executable program code stored in the memory to perform a knowledge-graph based link tracking method.
Embodiments of the fourth aspect of the present application also provide a computer readable storage medium storing a computer program, which when executed by a processor implements a knowledge-graph-based link tracking method.
The link tracking method based on the knowledge graph is displayed in a visual form of the knowledge graph, dynamic graphs are displayed, a group of entities and relation data are obtained according to the graph sequence, a directed connected graph is generated, a single link is supported on line to stop tracking according to actual conditions, all links are supported to stop tracking, and after the dynamic graphs are completed, a new round of link tracking is supported from a certain node to start.
Additional aspects and advantages of the application will be set forth in part in the description which follows, or may be learned by practice of the application.
Drawings
The foregoing and/or additional aspects and advantages of the application will become apparent and may be better understood from the following description of embodiments taken in conjunction with the accompanying drawings in which:
FIG. 1 shows a flow chart of a knowledge-graph based link tracking method, in accordance with an embodiment of the application;
FIG. 2 is a block diagram of one embodiment of a knowledge-graph based link tracking device of the present specification;
FIG. 3 is a block diagram of one embodiment of a computer-readable storage medium based on a knowledge-graph link tracking method of the present description.
Detailed Description
In order that the above-recited objects, features and advantages of the present application will be more clearly understood, a more particular description of the application will be rendered by reference to the appended drawings and appended detailed description. It should be noted that, without conflict, the embodiments of the present application and features in the embodiments may be combined with each other.
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present application, however, the present application may be practiced in other ways than those described herein, and therefore the scope of the present application is not limited to the specific embodiments disclosed below.
The following discussion provides various embodiments of the application. While each embodiment represents a single combination of the application, different embodiments of the application may be substituted or combined, and the application is thus to be considered to include all possible combinations of the same and/or different embodiments described. Thus, if one embodiment comprises A, B, C and another embodiment comprises a combination of B and D, then the present application should also be considered to include embodiments comprising one or more of all other possible combinations comprising A, B, C, D, although such an embodiment may not be explicitly recited in the following.
Fig. 1 shows a flowchart of a knowledge-graph-based link tracking method, according to an embodiment of the application. As shown in fig. 1, the link tracking method based on the knowledge graph includes the following steps: the web side initiates link tracking according to certain business side data, the server side GraphClient calculates the related metadata to initiate Session ID (Md 5 value) of the link tracking, returns to the web side, and submits a link tracking task to GraphAnalysis; graph analysis (graph analysis component) performs graph calculation and analysis according to related business rules, and notifies graph client (graph management component) to obtain calculation results; the GraphClient (graph management component) persists the acquired result to a corresponding storage medium according to the Session ID; the web side polls and initiates a query result request according to the acquired Session ID, the server side acquires result data from a graph client (graph management component) through a graph displayLogic (graph display component), constructs a directed communication graph according to a corresponding service rule and returns the directed communication graph to the web side; the web end performs rendering according to the result, and can manually initiate and stop a certain link tracking according to the situation or initiate a new round of link tracking according to a certain entity point.
The knowledge graph link tracking method is characterized in that the knowledge graph link tracking method is displayed in a visual form of the knowledge graph, dynamic graph is displayed, a group of entity and relation data is obtained according to graph sequence (depth priority/breadth priority), a directed connected graph is generated, and according to actual conditions, single link stop tracking can be supported on line, all links stop tracking is supported, and after the dynamic graph is completed, a new round of link tracking is supported from a certain node as a starting point. The link tracking background is divided into the following components of graph analysis (graph analysis component), graph client (graph management component), graph displaylogic (graph display component). The web end can achieve the effects of on-line dynamic graph construction, link branch tracking of the corresponding graph according to actual conditions and efficient graph construction through a knowledge graph link tracking method.
In the link tracking method based on the knowledge graph, the web end performs rendering according to the result, and the link tracking operation step further comprises the step of judging whether the tracking depth is reached after the link tracking is started; if yes, automatically stopping link tracking; if not, judging whether to stop the link tracking; if yes, manually stopping link tracking; if not, calculating and updating the result, and initiating a new round of link tracking according to a certain entity point.
In the link tracking method based on the knowledge graph, the Session ID is calculated, and whether the Session ID exists or not is judged; if yes, inquiring the result and ending, and if not, inquiring whether the tracked relationship data meets the condition; stopping tracking if the condition is not satisfied; if the condition is met, initializing a tracking graph, generating a graph analysis task, and starting tracking.
The link tracking device based on the knowledge graph provided by the embodiment of the application comprises the following components: the link tracking task submitting module is used for the web end to initiate link tracking, the server side graph management component calculates a Session ID for initiating the link tracking, returns the Session ID to the web end and submits the link tracking task to the graph analysis component; the graph calculation analysis module is used for carrying out graph calculation and analysis by the graph analysis component according to the business rules and notifying the graph management component to acquire a calculation result; the persistence module is used for persistence of the acquired calculation result to a corresponding storage medium according to the Session ID by the graph management component; the communication graph construction module is used for the web end to poll and initiate a query result request according to the acquired Session ID, the server end obtains result data from the graph management assembly through the graph display assembly, constructs a directed communication graph according to the corresponding business rule and returns the directed communication graph to the web end; and the link tracking module is used for rendering according to the result by the web end and carrying out link tracking operation.
Fig. 2 is a block diagram of one embodiment of a knowledge-graph based link tracking device of the present specification. Referring now to fig. 2, a schematic diagram of a knowledge-graph based link tracking device 300 suitable for use in implementing embodiments of the present disclosure is shown. The electronic devices in the embodiments of the present disclosure may include, but are not limited to, mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), in-vehicle terminals (e.g., in-vehicle navigation terminals), and the like, and stationary terminals such as digital TVs, desktop computers, and the like. The electronic device shown in fig. 2 is merely an example and should not be construed to limit the functionality and scope of use of the disclosed embodiments.
As shown in fig. 2, the electronic device 300 may include a processing means (e.g., a central processing unit, a graphics processor, etc.) 301 that may perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 302 or a program loaded from a storage means 308 into a Random Access Memory (RAM) 303. In the RAM303, various programs and data required for the operation of the electronic apparatus 300 are also stored. The processing device 301, the ROM 302, and the RAM303 are connected to each other via a bus 304. An input/output (I/O) interface 305 is also connected to bus 304.
In general, the following devices may be connected to the I/O interface 305: input devices 306 including, for example, a touch screen, touchpad, keyboard, mouse, image sensor, microphone, accelerometer, gyroscope, etc.; an output device 307 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage 308 including, for example, magnetic tape, hard disk, etc.; and communication means 309. The communication means 309 may allow the electronic device 300 to communicate with other devices wirelessly or by wire to exchange data. While fig. 2 shows an electronic device 300 having various means, it is to be understood that not all of the illustrated means are required to be implemented or provided. More or fewer devices may be implemented or provided instead.
In particular, according to embodiments of the present disclosure, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method shown in the flowcharts. In such an embodiment, the computer program may be downloaded and installed from a network via a communication device 309, or installed from a storage device 308, or installed from a ROM 302. The above-described functions defined in the methods of the embodiments of the present disclosure are performed when the computer program is executed by the processing means 301.
FIG. 3 is a block diagram of one embodiment of a computer-readable storage medium based on a knowledge-graph link tracking method of the present description. As shown in fig. 3, a computer-readable storage medium 40 according to an embodiment of the present disclosure has stored thereon non-transitory computer-readable instructions 41. When the non-transitory computer readable instructions 41 are executed by the processor, all or part of the steps of the knowledge-graph based link tracking method of the various embodiments of the disclosure described above are performed.
It should be noted that the computer readable medium described in the present disclosure may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this disclosure, a computer-readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present disclosure, however, the computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, fiber optic cables, RF (radio frequency), and the like, or any suitable combination of the foregoing.
The computer readable medium may be contained in the electronic device; or may exist alone without being incorporated into the electronic device.
The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: constructing a basic page, wherein the page code of the basic page is used for constructing an environment required by the operation of the service page and/or realizing the same abstract workflow in the similar service scene; constructing one or more page templates, wherein the page templates are used for providing code templates for realizing service functions in service scenes; based on the corresponding page template, generating a final page code of each page of the service scene through code conversion of a specific function of each page of the service scene; and merging the generated final page code of each page into the page code of the basic page to generate the code of the service page.
Alternatively, the computer-readable medium carries one or more programs that, when executed by the electronic device, cause the electronic device to: constructing a basic page, wherein the page code of the basic page is used for constructing an environment required by the operation of the service page and/or realizing the same abstract workflow in the similar service scene; constructing one or more page templates, wherein the page templates are used for providing code templates for realizing service functions in service scenes; based on the corresponding page template, generating a final page code of each page of the service scene through code conversion of a specific function of each page of the service scene; and merging the generated final page code of each page into the page code of the basic page to generate the code of the service page.
Computer program code for carrying out operations of the present disclosure may be written in one or more programming languages, including an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units involved in the embodiments of the present disclosure may be implemented by means of software, or may be implemented by means of hardware. Wherein the names of the units do not constitute a limitation of the units themselves in some cases.
The link tracking method based on the knowledge graph is displayed in a visual form of the knowledge graph, dynamic graphs are displayed, a group of entities and relation data are obtained according to the graph sequence, a directed connected graph is generated, a single link is supported on line to stop tracking according to actual conditions, all links are supported to stop tracking, and after the dynamic graphs are completed, a new round of link tracking is supported from a certain node to start.
In the present application, the terms "first," "second," "third," and the like are used for descriptive purposes only and are not to be construed as indicating or implying relative importance; the term "plurality" means two or more, unless expressly defined otherwise. The terms "mounted," "connected," "secured," and the like are to be construed broadly, and may be, for example, fixedly connected, detachably connected, or integrally connected; "coupled" may be directly coupled or indirectly coupled through intermediaries. The specific meaning of the above terms in the present application can be understood by those of ordinary skill in the art according to the specific circumstances.
In the description of the present application, it should be understood that the directions or positional relationships indicated by the terms "upper", "lower", etc. are based on the directions or positional relationships shown in the drawings, are merely for convenience of description and simplification of the description, and do not indicate or imply that the apparatus or unit referred to must have a specific direction, be constructed and operated in a specific direction, and therefore, should not be construed as limiting the present application.
In the description of the present specification, the terms "one embodiment," "some embodiments," "particular embodiments," and the like, mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the present application. In this specification, schematic representations of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
The foregoing is merely illustrative of certain embodiments of the present application and is not intended to limit the application so that various modifications and changes may be made to the application by those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the protection scope of the present application.

Claims (10)

1. The link tracking method based on the knowledge graph is characterized by comprising the following steps of:
the web terminal initiates the link tracking, the server side graph management component calculates the sessionID for initiating the link tracking, returns the sessionID to the web terminal, and submits a link tracking task to the graph analysis component;
the diagram analysis component performs diagram calculation and analysis according to the business rules and notifies the diagram management component to acquire a calculation result;
the diagram management component persists the acquired calculation result to a corresponding storage medium according to the SessionID;
the web side polls and initiates a query result request according to the acquired Session ID, the server side acquires result data from the graph management component through the graph display component, constructs a directed connected graph according to the corresponding business rule and returns the directed connected graph to the web side;
and rendering by the web end according to the result, and performing link tracking operation.
2. The link tracking method based on knowledge graph according to claim 1, wherein the web terminal initiates the link tracking, the server side graph management component calculates a Session ID for initiating the link tracking, returns the Session ID to the web terminal, and submits a link tracking task to the graph analysis component, and the web terminal initiates the link tracking according to a certain service edge data.
3. The link tracking method based on knowledge graph according to claim 1, wherein the web side initiates the link tracking, the server side graph management component calculates the Session ID for initiating the link tracking, returns to the web side, submits the link tracking task to the graph analysis component, and the server side graph management component calculates the Session ID for initiating the link tracking according to the related metadata.
4. A link tracking method based on a knowledge graph according to any one of claims 1-3, wherein the web end performs rendering according to the result, and in the step of performing link tracking operation, the link tracking operation performed includes manually initiating a stop of link tracking according to a situation, or initiating a new round of link tracking according to a certain entity point.
5. The link tracking method based on knowledge graph according to claim 4, wherein the web end performs rendering according to the result, and further comprises, after starting link tracking, determining whether the tracking depth is reached, and if yes, automatically stopping link tracking.
6. The link tracking method based on a knowledge graph according to claim 5, wherein after the link tracking is started, whether the tracking depth is reached is determined, if not, whether the link tracking is stopped is determined, and if so, the link tracking is manually stopped.
7. The link tracking method based on knowledge graph according to claim 6, wherein whether to stop the link tracking is determined, if not, the result is calculated and updated, and a new round of link tracking is initiated according to a certain entity point.
8. A knowledge-graph-based link tracking device, comprising:
the link tracking task submitting module is used for the web end to initiate link tracking, the server side graph management component calculates a Session ID for initiating the link tracking, returns the Session ID to the web end and submits the link tracking task to the graph analysis component;
the graph calculation analysis module is used for carrying out graph calculation and analysis by the graph analysis component according to the business rules and notifying the graph management component to acquire a calculation result;
the persistence module is used for persistence of the acquired calculation result to a corresponding storage medium according to the SessionID by the graph management component;
the communication graph construction module is used for the web end to poll and initiate a query result request according to the acquired Session ID, the server end obtains result data from the graph management assembly through the graph display assembly, constructs a directed communication graph according to the corresponding business rule and returns the directed communication graph to the web end;
and the link tracking module is used for rendering according to the result by the web end and carrying out link tracking operation.
9. A knowledge-graph-based link tracking apparatus comprising a memory and a processor; wherein the memory is for storing executable program code; the processor is configured to read executable program code stored in the memory to perform the knowledge-graph based link tracking method according to any one of claims 1-7.
10. A computer readable storage medium storing a computer program, wherein the computer program when executed by a processor implements the knowledge-graph based link tracking method of any one of claims 1-7.
CN202310638095.9A 2023-05-31 2023-05-31 Link tracking method and device based on knowledge graph Pending CN116756334A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310638095.9A CN116756334A (en) 2023-05-31 2023-05-31 Link tracking method and device based on knowledge graph

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310638095.9A CN116756334A (en) 2023-05-31 2023-05-31 Link tracking method and device based on knowledge graph

Publications (1)

Publication Number Publication Date
CN116756334A true CN116756334A (en) 2023-09-15

Family

ID=87954428

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310638095.9A Pending CN116756334A (en) 2023-05-31 2023-05-31 Link tracking method and device based on knowledge graph

Country Status (1)

Country Link
CN (1) CN116756334A (en)

Similar Documents

Publication Publication Date Title
CN111475298B (en) Task processing method, device, equipment and storage medium
CN109523187B (en) Task scheduling method, device and equipment
CN109582310B (en) Data processing method and device, electronic equipment and computer readable storage medium
CN109726390B (en) Document processing method, device, electronic equipment and storage medium
CN111338944B (en) Remote Procedure Call (RPC) interface testing method, device, medium and equipment
CN110781658A (en) Resume analysis method and device, electronic equipment and storage medium
CN111596992B (en) Navigation bar display method and device and electronic equipment
CN111857518A (en) Method and device for canceling image editing operation, electronic equipment and medium
CN116756334A (en) Link tracking method and device based on knowledge graph
CN109284350B (en) Method and device for updating search content, storage medium and electronic equipment
CN111241368B (en) Data processing method, device, medium and equipment
CN111258582B (en) Window rendering method and device, computer equipment and storage medium
CN111354070B (en) Stereoscopic graph generation method and device, electronic equipment and storage medium
CN115908143B (en) Vehicle cross-layer parking method, device, electronic equipment and computer readable medium
CN111294657A (en) Information processing method and device
CN113806033B (en) Task execution method, device, server and medium for task system
CN111381813A (en) Front-end page debugging method and device, computer equipment and storage medium
CN116796000A (en) Knowledge graph entity fusion method and device based on specified relation type
CN114253520B (en) Interface code generation method and device
CN112070163B (en) Image segmentation model training and image segmentation method, device and equipment
CN111399902B (en) Client source file processing method and device, readable medium and electronic equipment
CN110908867B (en) Task completion judging method and device, storage medium and electronic equipment
CN111625243B (en) Cross-language task processing method and device and electronic equipment
CN115270077B (en) Method, device, electronic equipment and computer readable medium for smoothing calculation progress
CN112380821B (en) Graphic display method and device and electronic equipment

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination