CN113961560A - Method and device for realizing batch retrieval and path display of data blood margin based on shortest path tree technology - Google Patents

Abstract

The invention discloses a method and a device for realizing batch retrieval and path display of data blood margin based on a shortest path tree technology, wherein the method comprises the following steps: obtaining data blood margin updating information, and obtaining a change node after analyzing blood margin change conditions; acquiring all associated nodes associated with the changed nodes; respectively calculating the shortest paths from the root nodes to the associated nodes based on a shortest path tree algorithm; acquiring child nodes of the associated nodes, and processing and updating shortest paths corresponding to the child nodes of the associated nodes in the shortest path information table; acquiring target fields in batches, inquiring a field information table in a database, if the target fields exist, retrieving based on the target fields, and outputting corresponding shortest paths from the shortest path information table; and summarizing the shortest paths, combining the common nodes to form data, and highlighting the position and the shortest path of the target field in the shortest path tree. The invention can reduce repeated invalid calculation when the blood margin path is updated after data is updated, thereby improving the overall efficiency.

Description

Method and device for realizing batch retrieval and path display of data blood margin based on shortest path tree technology

Technical Field

The invention relates to the technical field of retrieval and display of data blood borders in a data warehouse, in particular to a method and a device for realizing batch retrieval and path display of the data blood borders based on a shortest path tree technology.

Background

From the generation, processing fusion and circulation of data to the provision of applications, the data naturally form a relationship, and the person skilled in the art uses a similar relationship in human society to express the relationship between the data, which is called the relationship of the blood relationship of the data, namely the blood relationship of the data. The process of building a data warehouse typically includes the following steps: data integration or access, data modeling, data processing conversion and data application publishing.

In a data warehouse, retrieval and display are carried out based on the data blood relationship, and the method is a method for rapidly retrieving and obtaining data and visually knowing the data blood relationship. In the prior art, a data warehouse generally calculates a blood-cut-off path between data nodes by using a breadth search method, and when data in the data warehouse is modified to cause data nodes in the data warehouse to be newly added or deleted, the blood-cut-off path between the nodes of the data warehouse needs to be recalculated based on each node to respectively obtain the shortest path between a root node and each node.

The inventor believes that in the prior art, after each time of the data nodes in the data warehouse are subjected to the addition and deletion, the blood-related paths of all the nodes need to be recalculated, wherein the blood-related paths include a large number of repeated and meaningless blood-related path calculations, and the workload of the data warehouse in updating the data is increased, which causes resource waste. Meanwhile, in the process of comprehensively updating and calculating the path after updating the data, the efficiency of data retrieval and path display of the data warehouse is obviously reduced, and the use experience of a user is influenced.

Disclosure of Invention

In order to overcome the technical defects of a large amount of repeated and meaningless path calculation in the prior art, the invention provides a method and a device for realizing batch retrieval and path display of data blood margins based on a shortest path tree technology.

In order to solve the problems, the invention is realized according to the following technical scheme:

in a first aspect, the invention discloses a method for realizing batch retrieval and path display of data blood margin based on a shortest path tree technology, which comprises the following steps:

obtaining data blood margin updating information, and obtaining a change node after analyzing blood margin change conditions;

acquiring all associated nodes associated with the changed nodes;

respectively calculating the shortest paths from the root nodes to the associated nodes based on a shortest path tree algorithm;

acquiring child nodes of the associated nodes, and processing and updating shortest paths corresponding to the child nodes of the associated nodes in the shortest path information table;

acquiring target fields in batches, inquiring a field information table in a database, if the target fields exist, retrieving based on the target fields, and outputting corresponding shortest paths from the shortest path information table;

and summarizing the shortest paths, combining the common nodes to form data, and highlighting the position and the shortest path of the target field in the shortest path tree.

In an embodiment, the calculating the shortest paths from the root node to the associated nodes based on the shortest path tree algorithm includes:

all the associated nodes are sequentially placed into a task queue;

judging whether the task queue is empty or not;

if not, sequentially popping up the associated nodes to calculate the shortest path;

if the shortest path is empty, the shortest path calculation is terminated.

In an embodiment, the sequentially popping up the associated nodes to perform shortest path calculation specifically includes:

acquiring related nodes popped up in a task queue, and calculating a shortest path based on a shortest path tree algorithm;

obtaining the shortest path from the root node to the associated node;

inquiring a shortest path information table based on the associated node, and acquiring a historical path of the associated node stored in the shortest path information table;

and replacing the history path with the shortest path to update the shortest path information table.

In one embodiment, after replacing the shortest path with the historical path to update the shortest path information table, the method further includes:

respectively extracting path nodes through which the shortest path and the historical path pass, and respectively intercepting the shortest path and the historical path from the root node to the path nodes;

obtaining historical paths and shortest paths of path nodes to be compared respectively;

based on the comparison result, acquiring a path node of which the shortest path is superior to the historical path;

and correspondingly updating the shortest path into the shortest path information table.

In an embodiment, the acquiring the child node of the associated node, and processing and updating the shortest path corresponding to the child node of the associated node in the shortest path information table specifically include:

traversing all the associated nodes, and judging whether the associated nodes have child nodes or not;

if so, sequentially placing the child nodes of the associated nodes into a task list;

if not, skipping the associated node;

sequentially popping up child nodes from the task list;

calculating the shortest path from the root node to the child node through a shortest path tree algorithm;

comparing the shortest path of the child node with the historical path in the shortest path information table;

if the shortest path of the child node is better than the historical path, updating the shortest path of the child node into a shortest path information table;

and circularly executing calculation and comparison of the shortest path until the task queue is empty.

In a second aspect, the present invention further discloses a device for implementing batch retrieval and path display of data blood margin based on shortest path tree technology, including:

the blood margin updating module is used for acquiring data blood margin updating information and acquiring a change node after analyzing blood margin change conditions;

the association acquisition module is used for acquiring all association nodes associated with the change node;

the path calculation module is used for respectively calculating the shortest paths from the root nodes to the associated nodes based on a shortest path tree algorithm;

the path processing module is used for acquiring the child nodes of the associated nodes, and processing and updating the shortest paths corresponding to the child nodes of the associated nodes in the shortest path information table;

the system comprises a batch retrieval module, a database and a shortest path information table, wherein the batch retrieval module is used for acquiring target fields in batches, inquiring the field information table in the database, retrieving based on the target fields if the target fields exist, and outputting corresponding shortest paths from the shortest path information table;

and the path display module is used for summarizing the shortest paths, combining the common nodes to form data, and highlighting the position of the target field and the shortest path in the shortest path tree.

In one embodiment, the path computation module, when running, specifically executes:

all the associated nodes are sequentially placed into a task queue;

judging whether the task queue is empty or not;

if not, sequentially popping up the associated nodes to calculate the shortest path;

if the shortest path is empty, the shortest path calculation is terminated.

In an embodiment, the sequentially popping up the associated nodes to perform shortest path calculation specifically includes:

acquiring related nodes popped up in a task queue, and calculating a shortest path based on a shortest path tree algorithm;

obtaining the shortest path from the root node to the associated node;

inquiring a shortest path information table based on the associated node, and acquiring a historical path of the associated node stored in the shortest path information table;

and replacing the history path with the shortest path to update the shortest path information table.

In one embodiment, the path processing module, when running, further performs:

respectively extracting path nodes through which the shortest path and the historical path pass, and respectively intercepting the shortest path and the historical path from the root node to the path nodes;

obtaining historical paths and shortest paths of path nodes to be compared respectively;

based on the comparison result, acquiring a path node of which the shortest path is superior to the historical path;

and correspondingly updating the shortest path into the shortest path information table.

In one embodiment, the path processing module specifically executes, when running:

traversing all the associated nodes, and judging whether the associated nodes have child nodes or not;

if so, sequentially placing the child nodes of the associated nodes into a task list;

if not, skipping the associated node;

sequentially popping up child nodes from the task list;

calculating the shortest path from the root node to the child node through a shortest path tree algorithm;

comparing the shortest path of the child node with the historical path in the shortest path information table;

if the shortest path of the child node is better than the historical path, updating the shortest path of the child node into a shortest path information table;

and circularly executing calculation and comparison of the shortest path until the task queue is empty.

Compared with the prior art, the invention has the beneficial effects that:

the invention only carries out calculation updating of the shortest path to the related nodes of the changed nodes after the data of the data warehouse is updated, and the invention carries out calculation of the shortest path through the shortest path tree algorithm, thereby better processing the child nodes of the related nodes, so that the shortest path of the child nodes of the related nodes is easy to update.

Drawings

Embodiments of the invention are described in further detail below with reference to the attached drawing figures, wherein:

FIG. 1 is a flow chart of a method for implementing batch retrieval and path display of data blood margin based on shortest path tree technology according to the present invention;

fig. 2 is a block diagram of the apparatus for implementing batch retrieval and path display of data blood margin based on shortest path tree technology according to the present invention.

Detailed Description

Preferred embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While the preferred embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.

The term "include" and variations thereof as used herein is meant to be inclusive in an open-ended manner, i.e., "including but not limited to". Unless specifically stated otherwise, the term "or" means "and/or". The term "based on" means "based at least in part on". The terms "one example embodiment" and "one embodiment" mean "at least one example embodiment". The term "another embodiment" means "at least one additional embodiment". The terms "first," "second," and the like may refer to different or the same object. Other explicit and implicit definitions are also possible below.

The access device and the server may be directly or indirectly connected by wired or wireless communication. The access device may be a terminal or a server. The access device has a target application running thereon. The target application is an application program capable of initiating a data request to the server, such as a social application, a payment application, a game application, and the like. The server may be an application server that the target application provides a service, or may be a proxy server that distinguishes the application server corresponding to the target application. The server is used for identifying whether each access device belongs to the malicious device and intercepting the data message from the malicious device. When the server is a proxy server, the proxy server forwards the data message which does not belong to the malicious equipment to the application server. The terminal may specifically be a desktop terminal or a mobile terminal, and the mobile terminal may specifically be a smart phone, a tablet computer, a notebook computer, a desktop computer, an intelligent sound box, an intelligent watch, and the like, but is not limited thereto. The server and the server can be independent physical servers respectively, can also be a server cluster or distributed system formed by a plurality of physical servers, and can also be cloud servers for providing basic cloud computing services such as cloud service, a cloud database, cloud computing, cloud functions, cloud storage, network service, cloud communication, middleware service, domain name service, security service, CDN (content delivery network) and big data and artificial intelligence platforms.

Example 1

In a first aspect, as shown in fig. 1, an embodiment of the present invention discloses a method for implementing batch retrieval and path display of data blood margins based on a shortest path tree technique.

The invention creatively only carries out the calculation and updating of the shortest path on the related node of the change node in the data warehouse after the data of the data warehouse is updated, and the invention adopts the shortest path tree algorithm which is easy to process the subnodes to carry out the calculation of the shortest path, thereby better processing the subnodes of the related nodes and leading the shortest path of the subnodes of the related nodes to be easy to update.

The method for realizing the batch retrieval and the path display of the data blood margin based on the shortest path tree technology comprises the following steps:

step S1: and obtaining data blood margin updating information, and obtaining a change node after analyzing the blood margin change condition.

Specifically, the server acquires data lineage update information carrying the update condition of the data warehouse, updates the data in the data warehouse based on the data lineage update information, specifically, performs addition, transfer or deletion on data nodes, marks the added, transferred and deleted nodes respectively after analysis, acquires corresponding nodes as change nodes, and stores the updated data in the data warehouse.

Step S2: all associated nodes associated with the change node are obtained.

Specifically, the server analyzes the changed nodes, analyzes the nodes with changed data blood margins after the changed nodes are changed, and acquires the nodes as the associated nodes.

Step S3: and respectively calculating the shortest paths from the root node to the associated nodes based on a shortest path tree algorithm.

Specifically, the present step specifically includes the following sub-steps when executed:

all the associated nodes are sequentially placed into a task queue;

judging whether the task queue is empty or not;

if the shortest path is empty, the shortest path calculation is terminated.

If not, sequentially popping up the associated nodes to calculate the shortest path, and specifically comprising the following steps:

acquiring related nodes popped up in a task queue, and calculating a shortest path based on a shortest path tree algorithm;

obtaining the shortest path from the root node to the associated node;

inquiring a shortest path information table based on the associated node, and acquiring a historical path of the associated node stored in the shortest path information table;

and replacing the history path with the shortest path to update the shortest path information table.

After updating the shortest path information table, the method also comprises the following steps:

respectively extracting path nodes through which the shortest path and the historical path pass, and respectively intercepting the shortest path and the historical path from the root node to the path nodes;

obtaining historical paths and shortest paths of path nodes to be compared respectively;

based on the comparison result, acquiring a path node of which the shortest path is superior to the historical path;

and correspondingly updating the shortest path into the shortest path information table.

After the step is completed, the shortest paths of the associated nodes, the path nodes and the sub-nodes of the associated nodes can be updated, and in subsequent updating, if the associated nodes in the task queue are the same as the path nodes or the associated sub-nodes, the data of the shortest path information table can be directly read, so that repeated redundant calculation is not needed, and the overall efficiency is better improved.

Step S4: and acquiring the child nodes of the associated nodes, and processing and updating the shortest paths corresponding to the child nodes of the associated nodes in the shortest path information table.

Specifically, the present step specifically includes the following sub-steps when executed:

traversing all the associated nodes, and judging whether the associated nodes have child nodes or not;

if so, sequentially placing the child nodes of the associated nodes into a task list;

if not, skipping the associated node;

sequentially popping up child nodes from the task list;

calculating the shortest path from the root node to the child node through a shortest path tree algorithm;

comparing the shortest path of the child node with the historical path in the shortest path information table;

if the shortest path of the child node is better than the historical path, updating the shortest path of the child node into a shortest path information table;

and circularly executing calculation and comparison of the shortest path until the task queue is empty.

If the shortest path of the associated node changes, the shortest paths of the child nodes of the associated node also correspondingly change, and the shortest paths of the child nodes can be correspondingly processed based on the change condition of the shortest paths of the associated node by sequentially traversing and processing all the child nodes of the associated node, so that the overall processing effect is improved.

Step S5: and acquiring target fields in batches, inquiring a field information table in a database, if the target fields exist, retrieving based on the target fields, and outputting the corresponding shortest paths from the shortest path information table.

The method comprises the steps that a server obtains target fields which are input by users in batches and need to be searched in a data warehouse, a field information table used for storing field data names is inquired, if the target fields exist in the field information table after inquiry, nodes corresponding to the target fields correspondingly exist, further searching is conducted, matching degree searching is conducted on the basis of the names of the target fields and the names of the nodes, the matched nodes are target nodes, searching is conducted in a shortest path information table on the basis of the target nodes to obtain corresponding shortest paths, and path weight information is attached to the paths of the shortest paths.

Step S6: and summarizing the shortest paths, combining the common nodes to form data, and highlighting the position and the shortest path of the target field in the shortest path tree.

The server summarizes the shortest paths, combines common nodes among different searches to generate a data blood relationship graph with a shortest path tree structure with higher integration level, correspondingly displays the data blood relationship graph on display equipment, respectively highlights the root node, the path node and the target node, correspondingly highlights the shortest path formed by connecting the nodes in sequence, and displays the shortest path and the related nodes in the shortest path tree, so that a user can more visually observe the obtained search result after searching, and the use experience of the user is improved.

Other steps of the method for realizing batch retrieval and path display of data blood margin based on the shortest path tree technology described in this embodiment are referred to in the prior art.

Example 2

As shown in fig. 2, in a second aspect, the present invention further discloses a device for implementing batch retrieval and path display of data blood margin based on a shortest path tree technique, including:

the blood relationship updating module M1 is used for acquiring data blood relationship updating information and acquiring a change node after analyzing blood relationship change conditions;

an association obtaining module M2, configured to obtain all association nodes associated with the change node;

the path calculation module M3 is used for calculating the shortest paths from the root node to the associated nodes respectively based on the shortest path tree algorithm;

the path processing module M4 is configured to acquire child nodes of the associated node, process and update the shortest path corresponding to the child nodes of the associated node in the shortest path information table;

the batch retrieval module M5 is used for acquiring target fields in batches, inquiring a field information table in a database, if the target fields exist, retrieving based on the target fields, and outputting corresponding shortest paths from the shortest path information table;

and the path display module M6 is used for summarizing the shortest paths, merging the common nodes to form data, and highlighting the position and the shortest path of the target field in the shortest path tree.

Preferably, in this embodiment, when the path calculation module M3 runs, the path calculation module specifically executes:

all the associated nodes are sequentially placed into a task queue;

judging whether the task queue is empty or not;

if the shortest path is empty, the shortest path calculation is terminated;

if not, sequentially popping up the associated nodes to calculate the shortest path, specifically comprising:

acquiring related nodes popped up in a task queue, and calculating a shortest path based on a shortest path tree algorithm;

obtaining the shortest path from the root node to the associated node;

inquiring a shortest path information table based on the associated node, and acquiring a historical path of the associated node stored in the shortest path information table;

and replacing the history path with the shortest path to update the shortest path information table.

Further performing:

respectively extracting path nodes through which the shortest path and the historical path pass, and respectively intercepting the shortest path and the historical path from the root node to the path nodes;

obtaining historical paths and shortest paths of path nodes to be compared respectively;

based on the comparison result, acquiring a path node of which the shortest path is superior to the historical path;

and correspondingly updating the shortest path into the shortest path information table.

Preferably, in this embodiment, when the path processing module M4 runs, the path processing module specifically executes:

traversing all the associated nodes, and judging whether the associated nodes have child nodes or not;

if so, sequentially placing the child nodes of the associated nodes into a task list;

if not, skipping the associated node;

sequentially popping up child nodes from the task list;

calculating the shortest path from the root node to the child node through a shortest path tree algorithm;

comparing the shortest path of the child node with the historical path in the shortest path information table;

if the shortest path of the child node is better than the historical path, updating the shortest path of the child node into a shortest path information table;

and circularly executing calculation and comparison of the shortest path until the task queue is empty.

In summary, when the apparatus according to the embodiment of the present invention operates, all steps of the method for implementing the apparatus for batch retrieval and path display of data blood margin based on the shortest path tree technique described in embodiment 1 can be implemented, so as to implement the technical effect achieved in embodiment 1.

Other structures of the apparatus for implementing batch retrieval and path display of data blood margin based on the shortest path tree technology described in the present embodiment are referred to in the prior art.

Example 3

The invention also discloses an electronic device, at least one processor and a memory communicatively connected with the at least one processor, wherein the memory stores instructions executable by the at least one processor, the instructions are executed by the at least one processor, and when the at least one processor executes the instructions, the following steps are specifically realized: obtaining data blood margin updating information, and obtaining a change node after analyzing blood margin change conditions; acquiring all associated nodes associated with the changed nodes; respectively calculating the shortest paths from the root nodes to the associated nodes based on a shortest path tree algorithm; acquiring child nodes of the associated nodes, and processing and updating shortest paths corresponding to the child nodes of the associated nodes in the shortest path information table; acquiring target fields in batches, inquiring a field information table in a database, if the target fields exist, retrieving based on the target fields, and outputting corresponding shortest paths from the shortest path information table; and summarizing the shortest paths, combining the common nodes to form data, and highlighting the position and the shortest path of the target field in the shortest path tree.

Example 4

The invention also discloses a storage medium, which stores a computer program, and when the computer program is executed by a processor, the following steps are concretely realized: obtaining data blood margin updating information, and obtaining a change node after analyzing blood margin change conditions; acquiring all associated nodes associated with the changed nodes; respectively calculating the shortest paths from the root nodes to the associated nodes based on a shortest path tree algorithm; acquiring child nodes of the associated nodes, and processing and updating shortest paths corresponding to the child nodes of the associated nodes in the shortest path information table; acquiring target fields in batches, inquiring a field information table in a database, if the target fields exist, retrieving based on the target fields, and outputting corresponding shortest paths from the shortest path information table; and summarizing the shortest paths, combining the common nodes to form data, and highlighting the position and the shortest path of the target field in the shortest path tree.

It should be noted that the present disclosure may be methods, apparatus, systems, and/or computer program products. The computer program product may include a computer-readable storage medium having computer-readable program instructions embodied thereon for carrying out various aspects of the present disclosure.

The computer readable storage medium may be a tangible device that can hold and store the instructions for use by the instruction execution device. The computer readable storage medium may be, for example, but not limited to, an electronic memory device, a magnetic memory device, an optical memory device, an electromagnetic memory device, a semiconductor memory device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: 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), a Static Random Access Memory (SRAM), a portable compact disc read-only memory (CD-ROM), a Digital Versatile Disc (DVD), a memory stick, a floppy disk, a mechanical coding device, such as punch cards or in-groove projection structures having instructions stored thereon, and any suitable combination of the foregoing. Computer-readable storage media as used herein is not to be construed as transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission medium (e.g., optical pulses through a fiber optic cable), or electrical signals transmitted through electrical wires.

The computer-readable program instructions described herein may be downloaded from a computer-readable storage medium to a respective computing/processing device, or to an external computer or external storage device via a network, such as the internet, a local area network, a wide area network, and/or a wireless network. The network may include copper transmission cables, fiber optic transmission, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. The network adapter card or network interface in each computing/processing device receives computer-readable program instructions from the network and forwards the computer-readable program instructions for storage in a computer-readable storage medium in the respective computing/processing device.

The computer program instructions for carrying out operations of the present disclosure may be assembler instructions, Instruction Set Architecture (ISA) instructions, machine-related instructions, microcode, firmware instructions, state setting data, or source or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C + +, Java, or the like, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The computer-readable program instructions 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 type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider). In some embodiments, the electronic circuitry that can execute the computer-readable program instructions implements aspects of the present disclosure by utilizing the state information of the computer-readable program instructions to personalize the electronic circuitry, such as a programmable logic circuit, a Field Programmable Gate Array (FPGA), or a Programmable Logic Array (PLA).

Various aspects of the present disclosure are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the disclosure. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer-readable program instructions.

These computer-readable program instructions may be provided to a processing unit of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processing unit of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer-readable program instructions may also be stored in a computer-readable storage medium that can direct a computer, programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer-readable medium storing the instructions comprises an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.

The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer, other programmable apparatus or other devices implement the functions/acts specified in the flowchart and/or block diagram block or blocks.

The flowchart 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 instructions, which comprises one or more executable instructions for implementing the specified logical function(s). 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.

Having described embodiments of the present disclosure, the foregoing description is intended to be exemplary, not exhaustive, and not limited to the disclosed embodiments. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein was chosen in order to best explain the principles of the embodiments, the practical application, or improvements made to the technology in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.

Claims (10)

1. A method for realizing batch retrieval and path display of data blood margin based on shortest path tree technology is characterized by comprising the following steps:

obtaining data blood margin updating information, and obtaining a change node after analyzing blood margin change conditions;

acquiring all associated nodes associated with the changed nodes;

respectively calculating the shortest paths from the root nodes to the associated nodes based on a shortest path tree algorithm;

acquiring child nodes of the associated nodes, and processing and updating shortest paths corresponding to the child nodes of the associated nodes in the shortest path information table;

acquiring target fields in batches, inquiring a field information table in a database, if the target fields exist, retrieving based on the target fields, and outputting corresponding shortest paths from the shortest path information table;

and summarizing the shortest paths, combining the common nodes to form data, and highlighting the position and the shortest path of the target field in the shortest path tree.

2. The method for realizing the batch retrieval and the path display of the data blooding borders based on the shortest path tree technology as claimed in claim 1, wherein the shortest paths from the root node to the associated nodes are respectively calculated based on the shortest path tree algorithm, which specifically comprises:

all the associated nodes are sequentially placed into a task queue;

judging whether the task queue is empty or not;

if not, sequentially popping up the associated nodes to calculate the shortest path;

if the shortest path is empty, the shortest path calculation is terminated.

3. The method for realizing batch retrieval and path display of data blooding borders based on shortest path tree technology according to claim 2, wherein the popping up the associated nodes in sequence and performing shortest path calculation specifically comprises:

acquiring related nodes popped up in a task queue, and calculating a shortest path based on a shortest path tree algorithm;

obtaining the shortest path from the root node to the associated node;

inquiring a shortest path information table based on the associated node, and acquiring a historical path of the associated node stored in the shortest path information table;

and replacing the history path with the shortest path to update the shortest path information table.

4. The method for batch retrieval and path display of data blooding margin based on shortest path tree technique as claimed in claim 3, wherein said replacing the shortest path with the historical path to update the shortest path information table further comprises:

respectively extracting path nodes through which the shortest path and the historical path pass, and respectively intercepting the shortest path and the historical path from the root node to the path nodes;

obtaining historical paths and shortest paths of path nodes to be compared respectively;

based on the comparison result, acquiring a path node of which the shortest path is superior to the historical path;

and correspondingly updating the shortest path into the shortest path information table.

5. The method for realizing data blooding margin batch retrieval and path display based on shortest path tree technology according to claim 4, wherein the obtaining of the child nodes of the associated nodes, and the processing and updating of the shortest paths corresponding to the child nodes of the associated nodes in the shortest path information table specifically include:

traversing all the associated nodes, and judging whether the associated nodes have child nodes or not;

if so, sequentially placing the child nodes of the associated nodes into a task list;

if not, skipping the associated node;

sequentially popping up child nodes from the task list;

calculating the shortest path from the root node to the child node through a shortest path tree algorithm;

comparing the shortest path of the child node with the historical path in the shortest path information table;

if the shortest path of the child node is better than the historical path, updating the shortest path of the child node into a shortest path information table;

and circularly executing calculation and comparison of the shortest path until the task queue is empty.

6. The utility model provides a device that realizes batch retrieval and route show of data blooding margin based on shortest path tree technique which characterized in that includes:

the blood margin updating module is used for acquiring data blood margin updating information and acquiring a change node after analyzing blood margin change conditions;

the association acquisition module is used for acquiring all association nodes associated with the change node;

the path calculation module is used for respectively calculating the shortest paths from the root nodes to the associated nodes based on a shortest path tree algorithm;

the path processing module is used for acquiring the child nodes of the associated nodes, and processing and updating the shortest paths corresponding to the child nodes of the associated nodes in the shortest path information table;

the system comprises a batch retrieval module, a database and a shortest path information table, wherein the batch retrieval module is used for acquiring target fields in batches, inquiring the field information table in the database, retrieving based on the target fields if the target fields exist, and outputting corresponding shortest paths from the shortest path information table;

and the path display module is used for summarizing the shortest paths, combining the common nodes to form data, and highlighting the position of the target field and the shortest path in the shortest path tree.

7. The apparatus for batch retrieval and path display of data blooding borders based on shortest path tree technique as claimed in claim 6, wherein said path computation module when running specifically executes:

all the associated nodes are sequentially placed into a task queue;

judging whether the task queue is empty or not;

if not, sequentially popping up the associated nodes to calculate the shortest path;

if the shortest path is empty, the shortest path calculation is terminated.

8. The apparatus for implementing batch retrieval and path display of data blooding borders based on shortest path tree technique according to claim 7, wherein said sequentially popping up associated nodes for shortest path computation specifically comprises:

acquiring related nodes popped up in a task queue, and calculating a shortest path based on a shortest path tree algorithm;

obtaining the shortest path from the root node to the associated node;

inquiring a shortest path information table based on the associated node, and acquiring a historical path of the associated node stored in the shortest path information table;

and replacing the history path with the shortest path to update the shortest path information table.

9. The apparatus for batch retrieval and path display of data blooding margin based on shortest path tree technique according to claim 8, wherein the path processing module further executes when running:

respectively extracting path nodes through which the shortest path and the historical path pass, and respectively intercepting the shortest path and the historical path from the root node to the path nodes;

obtaining historical paths and shortest paths of path nodes to be compared respectively;

based on the comparison result, acquiring a path node of which the shortest path is superior to the historical path;

and correspondingly updating the shortest path into the shortest path information table.

10. The apparatus for implementing batch retrieval and path display of data blooding borders based on shortest path tree technique according to claim 9, wherein the path processing module specifically executes, when running:

traversing all the associated nodes, and judging whether the associated nodes have child nodes or not;

if so, sequentially placing the child nodes of the associated nodes into a task list;

if not, skipping the associated node;

sequentially popping up child nodes from the task list;

calculating the shortest path from the root node to the child node through a shortest path tree algorithm;

comparing the shortest path of the child node with the historical path in the shortest path information table;

if the shortest path of the child node is better than the historical path, updating the shortest path of the child node into a shortest path information table;

and circularly executing calculation and comparison of the shortest path until the task queue is empty.

Images