CN107622057A

CN107622057A - A kind of method and apparatus of lookup task

Info

Publication number: CN107622057A
Application number: CN201610551092.1A
Authority: CN
Inventors: 张子彧; 刘少伟
Original assignee: Alibaba Group Holding Ltd
Current assignee: Alibaba Group Holding Ltd
Priority date: 2016-07-13
Filing date: 2016-07-13
Publication date: 2018-01-23

Abstract

The embodiment of the present application discloses a kind of method of lookup task.This method includes：In response to the selected operation of the first benchmark task, the first datum node corresponding to the first benchmark task is obtained；The downstream node of first datum node is searched in the first mapping table, and using the first datum node and its downstream node as first object node, generates the second mapping table and/or the 3rd mapping table；Wherein, first mapping table is used to record in all task nodes father node to the mapping relations of child node, father node is to the mapping relations of child node in first object node for recording for second mapping table, and the 3rd mapping table is for recording first object node child nodes to the mapping relations of father node；Second mapping table and the 3rd mapping table, it is used to search the second destination node for task search request, to cause task corresponding to the second destination node to be identified as goal task corresponding to the task search request.In addition, the embodiment of the present application also discloses a kind of device of lookup task.

Description

A kind of method and apparatus of lookup task

Technical field

The application is related to field of computer technology, more particularly to a kind of method and apparatus of lookup task.

Background technology

Generally, computer system needs to perform substantial amounts of task.In some cases, computer system is needed substantial amounts of One or more specific tasks are found out in task.For example, there may be some in having performed for task performs mistake Losing for task, computer system need the task by these execution failures to find out, failure are performed to re-execute these Task.

In the prior art, the relevant information of all tasks is stored in the same data in database in computer system In table.When requiring to look up task every time, computer system is required for traveling through the relevant information of all tasks in the tables of data Satisfactory particular task can just be found out.And for some large-scale computer systems, the quantity of its task is very It is huge.These computer systems travel through the relevant information of all tasks in same tables of data, and not only lookup speed is very slow, looks into Extend when looking for, but also occupy the process resource of computer system too much.

The content of the invention

The embodiment of the present application technical problem to be solved is to provide a kind of method and apparatus of lookup task, to solve According to searching speed caused by the relevant information for being required for traveling through all tasks when searching task every time in the prior art Extend when slowly, searching, the technical problem that computer system processor resource is excessively taken.

In a first aspect, the embodiment of the present application provides a kind of method of lookup task, including：

In response to the selected operation of the first benchmark task, node corresponding to first benchmark task is obtained as the first base Quasi- node；

The downstream node of first datum node is searched in the first mapping table, and with first datum node and institute The downstream node of the first datum node is stated as first object node, the second mapping table is generated based on the first object node And/or the 3rd mapping table；

Wherein, first mapping table is used to record between node corresponding to all tasks existing father node to child node Mapping relations, second mapping table be used for record existing father node reflecting to child node between the first object node Penetrate relation, the 3rd mapping table is used to recording between the first object node existing child node to the mapping pass of father node System；

Second mapping table and the 3rd mapping table, it is used to search the second target section for task search request Point, to cause task corresponding to second destination node to be identified as goal task corresponding to the task search request.

Optionally, first mapping table is stored in database, and second mapping table and the 3rd mapping table are deposited Storage is in internal memory.

Optionally, methods described also includes：

Task attribute information corresponding to the first object node is searched in the first attribute list, and is based on first mesh Mark task attribute information corresponding to node and generate the second attribute list；

Wherein, first attribute list is used to record task attribute information corresponding to node corresponding to all tasks, described Second attribute list is used to record task attribute information corresponding to the first object node；

Second attribute list, for task based access control attribute to be believed in the first object node for task search request Breath searches the second destination node, to cause task corresponding to second destination node to be identified as the task search request pair The goal task answered.

Optionally, first attribute list is stored in database, and second attribute list is stored in internal memory.

Optionally, methods described also includes：

In response to the selected operation of the second benchmark task, node corresponding to the second benchmark task is obtained as the second benchmark section Point；

The downstream node of second datum node is searched in the second mapping table, to cause second datum node Downstream node is used for determining second destination node.

Optionally, methods described also includes：

Based on second attribute list, the 3rd destination node is searched in the downstream node of second datum node, with So that the 3rd destination node is used for determining second destination node；

Wherein, the task attribute information of the 3rd destination node represents that task corresponding to the 3rd destination node is in Status of fail.

Optionally, before the downstream node that second datum node is searched in the second mapping table, in addition to：

Based on first attribute list, the 4th destination node, the 4th target are searched in the first object node The task attribute information of node represents that task is placed in a suspend state corresponding to the 4th destination node；

In second mapping table, search and delete the downstream of the 4th destination node and the 4th destination node Node.

Optionally, methods described also includes：

In response to the selected operation of the 3rd benchmark task, node corresponding to the 3rd benchmark task is obtained as the 3rd benchmark section Point；

The upstream node of the 3rd datum node is searched in the 3rd mapping table, to cause the 3rd datum node Upstream node is used for determining second destination node.

Optionally, methods described also includes：

Based on second attribute list, the 5th destination node is searched in the upstream node of the 3rd datum node, with So that the 5th destination node is used for determining second destination node；

Wherein, the task attribute information of the 5th destination node represents that task corresponding to the 5th destination node is in Status of fail.

Optionally, before the upstream node that the 3rd datum node is searched in the 3rd mapping table, in addition to：

In the 3rd mapping table, search and delete the downstream of the 4th destination node and the 4th destination node Node.

Second aspect, the embodiment of the present application provide a kind of device of lookup task, including：

First acquisition unit, for the selected operation in response to the first benchmark task, obtain first benchmark task pair The node answered is as the first datum node；

First generation unit, for searching the downstream node of first datum node in the first mapping table, and with institute The first datum node is stated with the downstream node of first datum node as first object node, based on the first object section Point the second mapping table of generation and/or the 3rd mapping table；

Optionally, first mapping table is stored in database, second mapping table and the 3rd mapping Table is stored in internal memory.

Optionally, described device also includes：

Second generation unit, believe for searching task attribute corresponding to the first object node in the first attribute list Breath, and the second attribute list is generated based on task attribute information corresponding to the first object node；

Optionally, described device also includes：

Second acquisition unit, for the selected operation in response to the second benchmark task, obtain corresponding to the second benchmark task Node is as the second datum node；

First searching unit, for searching the downstream node of second datum node in the second mapping table, to cause The downstream node of second datum node is used for determining second destination node.

Optionally, described device also includes：

Second searching unit, for based on second attribute list, being looked into the downstream node of second datum node The 3rd destination node is looked for, to cause the 3rd destination node to be used for determining second destination node；

Optionally, described device also includes：

3rd searching unit, for searching second root node in the second mapping table in first searching unit Before downstream node, based on first attribute list, the 4th destination node of lookup in the first object node, the described 4th The task attribute information of destination node represents that task is placed in a suspend state corresponding to the 4th destination node；

First deletes unit, in second mapping table, searching and deleting the 4th destination node and described The downstream node of 4th destination node.

Optionally, described device also includes：

3rd acquiring unit, for the selected operation in response to the 3rd benchmark task, obtain corresponding to the 3rd benchmark task Node is as the 3rd datum node；

4th searching unit, for searching the upstream node of the 3rd datum node in the 3rd mapping table, to cause The upstream node of 3rd datum node is used for determining second destination node.

Optionally, described device also includes：

5th searching unit, for based on second attribute list, being looked into the upstream node of the 3rd datum node The 5th destination node is looked for, to cause the 5th destination node to be used for determining second destination node；

Optionally, described device also includes：

6th searching unit, for searching the 3rd benchmark in the 3rd mapping table described in the 4th searching unit Before the upstream node of node, based on first attribute list, the 4th destination node, institute are searched in the first object node The task attribute information for stating the 4th destination node represents that task is placed in a suspend state corresponding to the 4th destination node；

Second deletes unit, in the 3rd mapping table, searching and deleting the 4th destination node and described The downstream node of 4th destination node.

The third aspect, the embodiment of the present application provides a kind of method of lookup task, applied to user terminal, including：

Show the operation interface for selecting the first benchmark task；

In response to the selected operation of first benchmark task, for first benchmark task is sent to server One selected instruction, so that the server obtains node corresponding to first benchmark task as the first datum node, the The downstream node of first datum node is searched in one mapping table, and with first datum node and the first benchmark section The downstream node of point generates the second mapping table and/or the 3rd mapping as first object node based on the first object node Table；

Optionally, methods described also includes：

Show the operation interface for selecting the second benchmark task；

In response to the selected operation of second benchmark task, sent to the server and be directed to second benchmark task Task search request, so that the server obtains node corresponding to the second benchmark task as the second datum node, the The downstream node of second datum node is searched in two mapping tables, institute is determined from the downstream node of second datum node The second destination node is stated, and task is sent to the user terminal based on task corresponding to second destination node and searches knot Fruit；

Receive the task lookup result and show.

Optionally, methods described also includes：

Show the operation interface for selecting the 3rd benchmark task；

In response to the selected operation of the 3rd benchmark task, sent to the server and be directed to the 3rd benchmark task Task search request, so that the server obtains node corresponding to the 3rd benchmark task as the 3rd datum node, the The downstream node of the 3rd datum node is searched in three mapping tables, institute is determined from the downstream node of the 3rd datum node The second destination node is stated, and task is sent to the user terminal based on task corresponding to second destination node and searches knot Fruit；

Receive the task lookup result and show.

Fourth aspect, the embodiment of the present application provide a kind of device of lookup task, are configured at user terminal, including：

First display unit, for showing the operation interface for being used for selecting the first benchmark task；

First transmitting element, for the selected operation in response to first benchmark task, sent to server and be directed to institute The first selected instruction of the first benchmark task is stated, so that the server obtains node conduct corresponding to first benchmark task First datum node, the downstream node of first datum node is searched in the first mapping table, and with the first benchmark section Put with the downstream node of first datum node as first object node, reflected based on first object node generation second Firing table and/or the 3rd mapping table；

Optionally, described device also includes：

Second display unit, for showing the operation interface for being used for selecting the second benchmark task；

Second transmitting element, for the selected operation in response to second benchmark task, pin is sent to the server To the task search request of second benchmark task, so that the server obtains node conduct corresponding to the second benchmark task Second datum node, the downstream node of second datum node is searched in the second mapping table, from second datum node Downstream node in determine second destination node, it is and whole to the user based on task corresponding to second destination node Hold transmission task lookup result；

First receiving unit, for receiving the task lookup result and showing.

Optionally, described device also includes：

3rd display unit, for showing the operation interface for being used for selecting the 3rd benchmark task；

3rd transmitting element, for the selected operation in response to the 3rd benchmark task, pin is sent to the server To the task search request of the 3rd benchmark task, so that the server obtains node conduct corresponding to the 3rd benchmark task 3rd datum node, the downstream node of the 3rd datum node is searched in the 3rd mapping table, from the 3rd datum node Downstream node in determine second destination node, it is and whole to the user based on task corresponding to second destination node Hold transmission task lookup result；

Second receiving unit, for receiving the task lookup result and showing.

Compared with prior art, the application has advantages below：

According to the technical scheme of the embodiment of the present application, it is contemplated that user would generally be in the task of a particular category repeatedly Carry out task lookup, the first operation based on user, by traveling through the relevant information of all tasks, spy is found out in all tasks Determine the task under classification, then, by traveling through the relevant information of the task under particular category, the pin in the task under particular category Goal task is searched to task search request, it is seen then that searched for more subtasks of user, being searched per subtask all only needs time The relevant information of going through under particular category for task, the relevant information without going to travel through all tasks again, is searched so as to improve Speed, lookup time delay is shortened, and also save the process resource of computer system.

Specifically, the dependence between task can be embodied as between directed acyclic graph interior joint in computer systems Dependence, each task correspond to a node on directed acyclic graph, father node between each node be present to son Mapping relations of node, and preserve the first mapping table in computer systems, for record node corresponding to all tasks it Between existing father node to child node mapping relations.It is actual in view of node corresponding to all tasks under a particular category On constitute a branch on directed acyclic graph, the first benchmark task selected according to user is corresponding with the first benchmark task Node as datum node, the downstream node of the first datum node is found out in the first mapping table.With the first datum node And its downstream node actually just constitutes one point on directed acyclic graph as first object node, first object node , i.e. task under a particular category.In order to enter in the task for task search request and under the particular category Row task is searched, and can be based on first object node and be generated the second mapping table and/or the 3rd mapping table, wherein, the second mapping table For existing father node between recording the first object node to the mapping relations of child node, the 3rd mapping table is for recording For existing child node to the mapping relations of father node, both may be used to appointing for user between the first object node Search request of being engaged in carries out the lookup of goal task.As can be seen here, the first mapping table have recorded the relevant information of all tasks, and second Mapping table and the 3rd mapping table have recorded the relevant information of the task under a particular category, it is seen then that relative to the first mapping table, Information content much less in second mapping table and the 3rd mapping table, therefore, more subtask search requests of user all utilize the Two mapping tables and/or the 3rd mapping table carry out task lookup, and so being searched per subtask all only needs to travel through under particular category The relevant information of task, the relevant information without going to travel through all tasks again.

Brief description of the drawings

, below will be to embodiment or existing in order to illustrate more clearly of the embodiment of the present application or technical scheme of the prior art There is the required accompanying drawing used in technology description to be briefly described, it should be apparent that, drawings in the following description are only this Some embodiments described in application, for those of ordinary skill in the art, on the premise of not paying creative work, Other accompanying drawings can also be obtained according to these accompanying drawings.

Fig. 1 is the network system block schematic illustration involved by an application scenarios in the embodiment of the present application；

Fig. 2 is a kind of schematic flow sheet of the method for lookup task in the embodiment of the present application；

Fig. 3 is a kind of schematic diagram of directed acyclic illustrated example in the embodiment of the present application；

Fig. 4 is a kind of schematic diagram of directed acyclic illustrated example in the embodiment of the present application；

Fig. 5 is a kind of schematic flow sheet of task lookup method in the embodiment of the present application；

Fig. 6 is a kind of schematic flow sheet of the method for lookup task in the embodiment of the present application；

Fig. 7 is a kind of structural representation of the device of lookup task in the embodiment of the present application；

Fig. 8 is a kind of structural representation of the device of lookup task in the embodiment of the present application.

Embodiment

In order that those skilled in the art more fully understand application scheme, below in conjunction with the embodiment of the present application Accompanying drawing, the technical scheme in the embodiment of the present application is clearly and completely described, it is clear that described embodiment is only this Apply for part of the embodiment, rather than whole embodiments.Based on the embodiment in the application, those of ordinary skill in the art exist The every other embodiment obtained under the premise of creative work is not made, belongs to the scope of the application protection.

The application can be used in numerous general or special purpose computing system environments or configuration.Such as：Personal computer, service Device computer, handheld device or portable set, laptop device, multicomputer system, the system based on microprocessor, top set Box, programmable consumer-elcetronics devices, network PC, minicom, mainframe computer including any of the above system or equipment DCE etc..

The application can be described in the general context of computer executable instructions, such as program Module.Usually, program module includes performing particular task or realizes routine, program, object, the group of particular abstract data type Part, data structure etc..The application can also be put into practice in distribution counts environment, in these DCEs, by leading to Cross communication network and connected remote processing devices perform task.In a distributed computing environment, program module can position In the local and remote computer-readable storage medium including storage device.

Present inventor has found by research, in the prior art, for the mainframe computer of task enormous amount For system, speed that task is searched is slow, when extend, also, task searches the processing for also occupying computer system too much Resource.And why prior art has these, reason is, the relevant information of all tasks is recorded in a tables of data In, for every subtask search request of user, it is required for that the relevant information of all tasks is all traveled through into one in the tables of data It is secondary, need the information content that travels through excessive in task search procedure so as to result in.

In order to solve the above mentioned problem of prior art, in the embodiment of the present application, it is contemplated that user would generally be in a spy Determine repeatedly to carry out task lookup in the task of classification, the first operation based on user, by traveling through the relevant information of all tasks, The task under particular category is found out in all tasks, then, by traveling through the relevant information of the task under particular category, in spy Determine to search goal task for task search request in the task under classification, it is seen then that search for more subtasks of user, every time Task searches the relevant information for all only needing to travel through the task under particular category, without going the correlation for traveling through all tasks to believe again Breath, so as to reduce the information content for needing to travel through in task search procedure, improves lookup speed, shortens lookup time delay, and And also save the process resource of computer system.

Specifically, the dependence between task can be embodied as between directed acyclic graph interior joint in computer systems Dependence, each task correspond to a node on directed acyclic graph, father node between each node be present to son Mapping relations of node, and preserve the first mapping table in computer systems, for record node corresponding to all tasks it Between existing father node to child node mapping relations.It is actual in view of node corresponding to all tasks under a particular category On constitute a branch on directed acyclic graph, the first benchmark task that computer system can be selected according to user, with Node corresponding to one benchmark task finds out the downstream node of the first datum node as datum node in the first mapping table. Directed acyclic is actually just constituted as first object node, first object node using the first datum node and its downstream node Task under a branch on figure, i.e. a particular category.In order to for task search request and in the particular category Under task in carry out task lookup, first object node can be based on and generate the second mapping table and/or the 3rd mapping table, its In, the second mapping table is used to record existing father node between the first object node to the mapping relations of child node, and the 3rd Mapping table, which is used for existing child node between recording the first object node, to the mapping relations of father node, both can use The lookup of goal task is carried out in the task search request for user.As can be seen here, the first mapping table have recorded all tasks Relevant information, the second mapping table and the 3rd mapping table have recorded the relevant information of the task under a particular category, it is seen then that phase For the first mapping table, the information content much less in the second mapping table and the 3rd mapping table, therefore, more subtasks of user are looked into Request is looked for all to carry out task lookup using the second mapping table and/or the 3rd mapping table, so often subtask lookup all only needs time The relevant information of going through under particular category for task, the relevant information without going to travel through all tasks again.

For example, one of scene of the embodiment of the present application, such as computer system as shown in Figure 1 can be applied to In 101.It is corresponding to obtain first benchmark task in response to the selected operation of the first benchmark task for the computer system 101 Node as the first datum node.Then, the computer system 101 searches the first benchmark section in the first mapping table The downstream node of point, and first object section is used as using the downstream node of first datum node and first datum node Point, the second mapping table and/or the 3rd mapping table are generated based on the first object node.Wherein, first mapping table is used for Existing father node is to the mapping relations of child node between recording node corresponding to all tasks, and second mapping table is for remembering Existing father node is to the mapping relations of child node between recording the first object node, and the 3rd mapping table is for recording institute Existing child node is stated between first object node to the mapping relations of father node.Second mapping table and the 3rd mapping Table, it is used to search the second destination node for task search request, to cause task quilt corresponding to second destination node It is identified as goal task corresponding to the task search request.

It should be noted that the computer system 101 can be any one computer system.For example, the calculating Machine system 101 can be with a server.And for example, the server that the computer system 101 can be made up of multiple servers System.For another example, the computer system 101 can be terminal device.

It is understood that above-mentioned scene is only the Sample Scenario that the embodiment of the present application provides, the embodiment of the present application It is not limited to this scene.

Below in conjunction with the accompanying drawings, the various non-limiting embodiments of the application are described in detail.

Illustrative methods

Referring to Fig. 2, a kind of schematic flow sheet of the method for lookup task in the embodiment of the present application is shown.The present embodiment Method for example can apply to any one computer system.In the present embodiment, methods described for example specifically can include with Lower step：

201st, in response to the selected operation of the first benchmark task, obtain node corresponding to first benchmark task and be used as the One datum node.

During specific implementation, computer system can provide a user the selection interface of the first benchmark task, and user can lead to The interface is crossed to select any one task from all tasks computer system is in response to user to as the first benchmark task The selected operation of one benchmark task, node corresponding to the first benchmark task is obtained as the first datum node.

It should be noted that the dependence between task can be embodied as saving in directed acyclic graph in computer systems Dependence between point, each task correspond to a node on directed acyclic graph.In computer system, task Corresponding node is embodied on data mode with identifying.Specifically, computer system is that each task is assigned with one Individual independent mark, the mark make a distinction for system to different task.The mark can be referred to as node identification, i.e. task Corresponding node.For example, first datum node corresponding with first benchmark task can represent in computer system For the node identification of the first benchmark task.

202nd, the downstream node of first datum node is searched in the first mapping table, and with first datum node Downstream node with first datum node is as first object node, based on the mapping of first object node generation second Table and/or the 3rd mapping table；

In the present embodiment, upstream node and downstream node are for the direction of directed acyclic graph.For section For point A and node B, if can reach node B according to the forward direction of directed acyclic graph since node A, node B is node A Downstream node, node A be node B upstream node；If it can reversely reach section according to directed acyclic graph since node A Point B, then node B is node A upstream node, and node A is node B downstream node；If according to directed acyclic since node A The forward and reverse of figure can not all reach node B, then the relation of upstream and downstream is not present between node A and node B.It can be seen that first The downstream node of datum node specifically, on directed acyclic graph using the first datum node as the branch of root node in except Other nodes outside one datum node, i.e. passed through according to the forward direction of directed acyclic graph from the first datum node to leaf node All nodes crossed.For example, in the example of the directed acyclic graph shown in Fig. 3, the direction of arrow is the forward direction of directed acyclic graph. If the first datum node is node 1, the downstream node of the first datum node includes node 2, node 3, node 4 and node 5.

Furthermore, what father node and child node represented is the upstream and downstream pass of two nodes adjacent on directed acyclic graph System, i.e. on directed acyclic graph in two adjacent nodes, the node positioned at upstream is father node, and the node positioned at downstream is Child node.For example, in the example of the directed acyclic graph shown in Fig. 3, node 2 is the father node of node 4, and node 4 is node 2 Child node.And for example, in the example of the directed acyclic graph shown in Fig. 3, the child node of node 1 includes node 2 and node 3, node 2 Father node with node 3 is all node 1.

It is understood that for the computer system multiple tasks to be performed, one is usually there will be between each task Fixed dependence, that is, between each task execution sequence relation.Performed for example, task A implementing result is task B Initial conditions, i.e. task A depend on task B, then task B is being first carried out, and task A is in rear execution.In computer systems, task Between dependence can generally form the structure of directed acyclic graph.Dependence between task in computer systems, Dependence i.e. between directed acyclic graph interior joint, it is embodied as the set membership between each node in directed acyclic graph. In computer system, set membership on directed acyclic graph between each node is embodied with mapping table on data mode 's.Specifically, two kinds of mapping tables can be used for recording the set membership between each node.

The first mapping table is used to record the existing mapping relations from father node to child node between each node.It is this to reflect The relation of penetrating is specially the mapping relations formed between all child nodes of each father node and the father node in each node.Tool Body, in the first mapping table, each node (i.e. each father node) except for the leaf nodes corresponds to one respectively Individual list item.In list item corresponding to any one father node, key is the node identification of the father node, and value is the father node The node identification of all child nodes.For example, in the present embodiment, the first mapping table and the second mapping table belong to it is described the first Mapping table.By taking the directed acyclic graph shown in Fig. 3 as an example, in the record of the first mapping table, if key is the ID of node 0, Value includes ID, the ID of node 6 and the ID of node 8 of node 1.

Second mapping table is used to recording the existing mapping relations from child node to father node between each node.It is this to reflect The relation of penetrating is specially the mapping relations formed between all father nodes of each child node and the child node in each node.Tool Body, in second of mapping table, each node (i.e. each child node) in addition to root node corresponds to one respectively List item.In list item corresponding to any one individual child node, key be the child node node identification, value for the child node institute There is the node identification of father node.For example, in the present embodiment, the 3rd mapping table belongs to second of mapping table.With shown in Fig. 3 Directed acyclic graph exemplified by, in the record of second of mapping table, if key is the ID of node 7, value includes the ID of node 6 With the ID of node 8.

In 202 specific implementation, computer system generally preserves the first mapping table in database, and described Record has between node corresponding to all tasks existing father node to the mapping relations of child node in one mapping table.Selected in user , can be by traveling through described for the first datum node corresponding to the first benchmark task in the case of selecting the first benchmark task The mode of one mapping table, child node is found out using the first datum node as father node, then, then saved respectively with the son found out Point as father node continues to search for child node, up to the node found out is all leaf node, can thus find out the All downstream nodes of one datum node.First datum node and its downstream node are represented with first object node, based on above-mentioned Father node can obtain to the search procedure of child node and record existing set membership between first object node, so as to raw Into the second mapping table and the 3rd mapping table.Wherein, between first object node existing father node to child node mapping relations, The second mapping table can be recorded；Existing child node can record to the mapping relations of father node between first object node To the 3rd mapping table.So, the second mapping table and the 3rd mapping table may be used to search mesh for the job enquiry request of user Mark task.

In some embodiments of the present embodiment, it can be realized by way of recursion cycle and above-mentioned be based on the first benchmark Node generates the process of the second mapping table and the 3rd mapping table.Specifically, there is provided one is used to search child node and renewal second The queue of mapping table and the 3rd mapping table.First the second mapping table and the 3rd mapping table are initialized, then, for being put into the queue In node, the child node of the node is searched in the first mapping table using the node as father node, will from the node in itself to The mapping relations of the child node of the node recorded in the second mapping table, by the reflecting in itself from the child node of the node to the node Relation record is penetrated into the 3rd mapping table.During the first datum node generates the second mapping table and the 3rd mapping table, first First datum node is put into the queue, finds out the child node of the first datum node, then the child node found out is put into Continued to search in the queue, until leaf node is put into queue, child node can not be found again for leaf node, so as to There is no new node to be added in queue, and now, all downstream nodes of the first datum node are all found out, and second Mapping table and the 3rd mapping table have also generated.

It is understood that the second mapping table and the 3rd mapping table based on the generation of the first datum node, actually corresponding A branch using the first datum node as root node on directed acyclic graph, that is, the second mapping table and the 3rd mapping table It actually correspond to all tasks under a particular category.After the second mapping table and the generation of the 3rd mapping table, work as user , can be by traveling through the second mapping table or the 3rd mapping table in response to the task search request during triggering task search request Mode, finds the second destination node for meeting the task search request, and task corresponding to the second destination node is the task Goal task corresponding to search request.It can be seen that by traveling through the second mapping table or the 3rd mapping table, it is possible to achieve in particular category Under all tasks in search goal task.Multiple carry out task it would generally be looked into the task of particular category in view of user Look for, the second mapping table and more subtask search requests of the 3rd mapping table typically user generated is searched target and appointed Business.

Be generally stored inside in view of first mapping table in database, which results in the reading speed of the first mapping table compared with Slowly.In some embodiments of the present embodiment, in order to improve the traversal speed of the second mapping table and the 3rd mapping table, to enter one The speed that raising task is searched is walked, second mapping table and the 3rd mapping table can be stored in internal memory.Due to calculating The speed ratio that machine system reads data from internal memory reads data faster from database, can thus improve the second mapping table With the traversal speed of the 3rd mapping table.

It should be noted that the second mapping table and the 3rd mapping table can reflect between all tasks under particular category Dependence, that is, passing through the second mapping table and the 3rd mapping table, it is possible to achieve searched according to the dependence between task Task.In some cases, the lookup of task is not only needed according to the dependence between task, it is also necessary to according to task category Property, i.e., goal task needs the requirement for meeting particular task attribute.For example, task status letter is contained in task attribute information Breath.Wherein, task status information can represent the implementation status of task corresponding to node.For example, task status information include into Work(state, status of fail and halted state.If task has been successfully executed corresponding to node, task status corresponding to the node Information is success status.If tasks carrying corresponding to node fails, task status information corresponding to the node is status of fail. If tasks carrying is suspended corresponding to node, task status information corresponding to the node is halted state.Task search request Such as can be goal task for searching particular task state, such as the goal task of status of fail.

The first attribute list is generally preserved in the database of computer system, all tasks are have recorded in the first attribute list Task attribute information.In order that obtain task attribute only can also be searched in the task under particular category, can generate For the second attribute list of the task attribute information for recording task under particular category, so only needed for more subtask search requests The second attribute list that traversal information amount is less is wanted, without removing the first more attribute list of traversal information amount again, so as to improve The speed that task is searched.Specifically, the present embodiment can also for example include：The first object section is searched in the first attribute list Task attribute information corresponding to point, and the second attribute list is generated based on task attribute information corresponding to the first object node； Wherein, first attribute list is used to record task attribute information corresponding to node corresponding to all tasks, second attribute Table is used to record task attribute information corresponding to the first object node；Second attribute list, for being searched for task Request task based access control attribute information in the first object node searches the second destination node, to cause the second target section Task corresponding to point is identified as goal task corresponding to the task search request.

In computer system, the first attribute list and the second attribute list can use on data mode and see that KV maps.Tool Body, in the first attribute list, each node corresponding to all tasks corresponds to a list item respectively.It is corresponding in any one node List item in, key is the node identification of the node, and value is that the node corresponds to the task attribute information of task.Similarly, exist In second attribute list, each first object node corresponds to a list item respectively.In list item corresponding to any one node, key For the node identification of the node, value is the task attribute information that the node corresponds to task.

It is understood that the second attribute list record be all tasks under a particular category task attribute letter Breath.After the generation of the second attribute list, when task search request of user's triggering for particular task attribute, in response to this Business search request, by traveling through the second attribute list, it can be found on the basis of the second mapping table or the 3rd mapping table is traveled through Meet the second destination node of the task search request, task corresponding to the second destination node is that the task search request is corresponding Goal task.It can be seen that for the task search request for particular task attribute, the second mapping table or the 3rd mapping are being traveled through On the basis of table, by traveling through the second attribute list, it is possible to achieve search goal task in all tasks under particular category.Examine Consider user would generally the multiple carry out task lookup in the task of particular category, the second attribute list generated is typically More subtask search requests of user search goal task.

Be generally stored inside in view of first attribute list in database, which results in the reading speed of the first attribute list compared with Slowly.In some embodiments of the present embodiment, in order to improve the traversal speed of the second attribute list, looked into further improving task The speed looked for, second attribute list can be stored in internal memory.Because computer system reads the speed of data from internal memory Than reading data faster from database, the traversal speed of the second attribute list can be thus improved.

It is understood that under different application scenarios, task search request can be divided into two kinds of different types, the Two mapping tables and the 3rd mapping table may be respectively used for searching goal task for the task search request of both types.

The task search request of first type for example can be for asking to carry out in the downstream node of a certain node The lookup of destination node.Second mapping table can be used for searching goal task for the task search request of this type.Specifically, In some embodiments of the present embodiment, such as it can also include：In response to the selected operation of the second benchmark task, the is obtained Node is as the second datum node corresponding to two benchmark tasks；The downstream of second datum node is searched in the second mapping table Node, to cause the downstream node of second datum node to be used for determining second destination node.More specifically, calculate Machine system can provide a user the selection interface of the second benchmark task, and user can be by the interface from first object node pair Any one task is selected in answering for task, and as the second benchmark task, computer system is in response to user to the second benchmark task Selected operation, obtain the second benchmark task corresponding to node as the second datum node, and by travel through the second mapping table in The father node of record finds out all downstream nodes of the second datum node to the mapping relations of child node.

In some embodiments of the present embodiment, the second datum node can be searched by way of recursion cycle Downstream node.Specifically, there is provided a queue for being used to search child node.For the node being put into the queue, with the node The child node of the node is searched in the second mapping table as father node, the child node of the node recorded in result set. In the search procedure of the downstream node of second datum node, first the second datum node is put into the queue, finds out the second base The child node of quasi- node, then the child node found out is put into the queue and continued to search for, until leaf node is put into queue In, child node can not be found again for leaf node, to be added to so as to which there is no new node in queue, now, the second base All downstream nodes of quasi- node have all been found out and have been stored in result set.

Furthermore, can be if the task search request of the first type is for particular task attribute The node for meeting the particular task attribute is searched in the downstream node for the second benchmark task that two mapping tables are found out.If for example, Wanted task search request is the task for status of fail, in the downstream joint by the second mapping benchmark task of table search second On the basis of point, the present embodiment can also include：Based on second attribute list, in the downstream node of second datum node The 3rd destination node of middle lookup, to cause the 3rd destination node to be used for determining second destination node；Wherein, it is described The task attribute information of 3rd destination node represents that task corresponding to the 3rd destination node is in status of fail.

For example, in the application scenarios of the failed tasks of race again based on downstream, in order to find times for needing to run again Business, task search request are actually the task search request for the first type of status of fail for task attribute.For The task search request, goal task can be searched by traveling through the second mapping table and the second attribute list.Specifically, in response to Selected operation of the user to the second benchmark task, node corresponding to the second benchmark task is obtained as the second datum node； The downstream node of the second datum node is searched in two mapping tables, and the downstream joint of the second datum node is searched in the second attribute list The task attribute of point, the is used as the node of status of fail so as to choose task attribute in the downstream node of the second datum node Two destination nodes；It is goal task by task recognition corresponding to the second destination node.

It is understood that in many application scenarios, it is contemplated that task placed in a suspend state and its follow-up work are all It is the state in pause processing, it is necessary to which searching for task does not include these tasks.For example, in the failure of race again based on downstream In the application scenarios of task again, it is contemplated that task and its follow-up task placed in a suspend state need not be run.Therefore, searching Need the running of the task again before, node that task attribute is halted state and section downstream can be deleted in the second mapping table Point.Specifically, in some embodiments of the present embodiment, in the downstream joint using the second mapping datum node of table search second Before point, such as it can also include：Based on first attribute list, the 4th target section is searched in the first object node Point, the task attribute information of the 4th destination node represent that task is placed in a suspend state corresponding to the 4th destination node； In second mapping table, search and delete the downstream node of the 4th destination node and the 4th destination node. Second mapping table deletes the 4th destination node and its downstream node and then the second datum node is searched in the second mapping table Downstream node, task placed in a suspend state can be thus filtered out before goal task is searched.

The task search request of second of type for example can be for asking to carry out in the upstream node of a certain node The lookup of goal task.3rd mapping table can be used for searching goal task for the task search request of this type.Specifically, In some embodiments of the present embodiment, such as it can also include：In response to the selected operation of the 3rd benchmark task, the is obtained Node is as the 3rd datum node corresponding to three benchmark tasks；The upstream of the 3rd datum node is searched in the 3rd mapping table Node, to cause the upstream node of the 3rd datum node to be used for determining second destination node.More specifically, calculate Machine system can provide a user the selection interface of the 3rd benchmark task, and user can be by the interface from first object node pair Any one task is selected in answering for task, and as the 3rd benchmark task, computer system is in response to user to the 3rd benchmark task Selected operation, obtain the 3rd benchmark task corresponding to node as the 3rd datum node, and by travel through the 3rd mapping table in The child node of record finds out all upstream nodes of the 3rd datum node to the mapping relations of father node.

In some embodiments of the present embodiment, the 3rd datum node can be searched by way of recursion cycle Upstream node.Specifically, there is provided a queue for being used to search father node.For the node being put into the queue, with the node The father node of the node is searched in the 3rd mapping table as child node, the father node of the node recorded in result set. In the search procedure of the upstream node of 3rd datum node, first the 3rd datum node is put into the queue, finds out the 3rd base The father node of quasi- node, then the father node found out is put into the queue and continued to search for, until root node is put into queue, Child node can not be found again for root node, to be added to so as to which there is no new node in queue, now, the 3rd datum node All upstream nodes all found out and be stored in result set.It is understood that recorded in the 3rd mapping table It is foregoing first datum node and its downstream node, the root node in the 3rd mapping table is foregoing first datum node.

Furthermore, can be if the task search request of second of type is for particular task attribute The node for meeting the particular task attribute is searched in the upstream node for the 3rd benchmark task that three mapping tables are found out.If for example, Wanted task search request is the task for status of fail, is saved in the upstream by the 3rd mapping benchmark task of table search the 3rd On the basis of point, the present embodiment can also include：Based on second attribute list, in the upstream node of the 3rd datum node The 5th destination node of middle lookup, to cause the 5th destination node to be used for determining second destination node；Wherein, it is described The task attribute information of 5th destination node represents that task corresponding to the 5th destination node is in status of fail.

For example, in the application scenarios of the failed tasks of race again based on upstream, in order to find times for needing to run again Business, task search request are actually the task search request for second of type of status of fail for task attribute.For The task search request, goal task can be searched by traveling through the 3rd mapping table and the second attribute list.Specifically, in response to Selected operation of the user to the 3rd benchmark task, node corresponding to the 3rd benchmark task is obtained as the 3rd datum node； The upstream node of the 3rd datum node is searched in three mapping tables, and the upstream section of the 3rd datum node is searched in the second attribute list The task attribute of point, the is used as the node of status of fail so as to choose task attribute in the upstream node of the 3rd datum node Two destination nodes；It is goal task by task recognition corresponding to the second destination node.

It is understood that in many application scenarios, it is contemplated that task placed in a suspend state and its follow-up work are all It is the state in pause processing, it is necessary to which searching for task does not include these tasks.For example, in the failure of race again based on upstream In the application scenarios of task again, it is contemplated that task and its follow-up task placed in a suspend state need not be run.Therefore, searching Need the running of the task again before, node that task attribute is halted state and section downstream can be deleted in the 3rd mapping table Point.Specifically, in some embodiments of the present embodiment, in the upstream section using the 3rd mapping datum node of table search the 3rd Before point, such as it can also include：Based on first attribute list, the 4th target section is searched in the first object node Point, the task attribute information of the 4th destination node represent that task is placed in a suspend state corresponding to the 4th destination node； In the 3rd mapping table, search and delete the downstream node of the 4th destination node and the 4th destination node. 3rd mapping table deletes the 4th destination node and its downstream node and then the 3rd datum node is searched in the 3rd mapping table Downstream node, task placed in a suspend state can be thus filtered out before goal task is searched.

In the present embodiment, it is contemplated that user repeatedly would generally carry out task lookup in the task of a particular category, The first operation based on user, by traveling through the relevant information of all tasks, appointing under particular category is found out in all tasks Business, then, by traveling through the relevant information of the task under particular category, being searched in the task under particular category for task please Seek lookup goal task, it is seen then that searched for more subtasks of user, being searched per subtask all only needs to travel through under particular category Task relevant information, the relevant information without going to travel through all tasks again, needed so as to reduce in task search procedure The information content to be traveled through, lookup speed is improved, shorten lookup time delay, and also save the processing money of computer system Source.

In order that the method that those skilled in the art are easier to understand the embodiment of the present application offer is obtained, it is specific with one below Application scenarios exemplified by be introduced.The task that the Finance Department in group company subordinate is related to is needed in the application scenarios In repeatedly search in status of fail task, with run again these perform failure task.Wherein, involved by the group company All tasks correspond to the directed acyclic graph shown in Fig. 4, and the direction of arrow in Fig. 4 is the forward direction of the directed acyclic graph.This is oriented Father node is recorded in the first mapping table to the mapping relations of child node existing for each node in acyclic figure, in the directed acyclic graph Task attribute information record is in the first attribute list corresponding to each node.

Fig. 5 shows the schematic flow sheet of the task lookup method under above-mentioned application scenarios in the embodiment of the present application.At this In embodiment, methods described for example may comprise steps of：

501st, task corresponding to node G is selected as the first benchmark task in response to user, obtain node G as the first base Quasi- node.

502nd, node G downstream node is searched in the first mapping table, and be based on node G and its downstream node, generates the Two mapping tables and the 3rd mapping table.

In the directed acyclic graph shown in Fig. 4, node G downstream node includes node H, I, J, K, L, M, N, O, P, Q.Such as Shown in Fig. 4, the branch of node G, H, I, J, K, L, M, N, O, P, Q composition, should corresponding to all tasks under a particular category Task under particular category is all tasks that the Finance Department of group company is related to.Wherein, node G is the root section of the branch Point.If user needs repeatedly to search the task in status of fail in all tasks that Finance Department is related to, can be to node G Corresponding task carries out selection operation.System in response to user this selection operation, can according to the first mapping table generate with Second mapping table corresponding to the branch and the 3rd mapping table.Wherein, what is recorded in the second mapping table is involved of Finance Department Under branch corresponding to business between each node father node to child node mapping relations, namely node G, H, I, J, K, L, M, N, O, P, Mapping relations of the existing father node to child node between Q.What is recorded in 3rd mapping table is task pair involved by Finance Department Under the branch answered between each node child node to father node mapping relations, namely node G, H, I, J, K, L, M, N, O, P, Q it Between existing child node to father node mapping relations.

Specifically, the first mapping table can be as shown in table 1：

Table 1

Second mapping table can be as shown in table 2：

Table 2

Key	Value
		Node G	Node H, node I
Node H	Node J, node K
		Node J	Node M
Node K	Node N, node Q, node O
		Node O	Node Q
Node I	Node K, node L
		Node L	Node O, node P

3rd mapping table can be as shown in table 3：

Table 3

Key	Value
		Node Q	Node K, node O
Node P	Node L
		Node O	Node K, node L
Node N	Node K
		Node M	Node J
Node L	Node I
		Node K	Node H, node I
Node J	Node H
		Node I	Node G
Node H	Node G

503rd, task attribute information corresponding to node G~Q is searched in the first attribute list, and based on corresponding to node G~Q Task attribute information generates the second attribute list.

It is understood that what is recorded in the second attribute list is each node under branch corresponding to task involved by Finance Department Task attribute information, namely task attribute information corresponding to node G, H, I, J, K, L, M, N, O, P, Q.Wherein, each node Task attribute information includes each self-corresponding task status information.

Specifically, the first attribute list can be as shown in table 4：

Table 4

Second attribute list can be as shown in table 5：

Table 5

Key	Value
		Node G	Success status
Node H	Success status
		Node I	Success status
Node J	Halted state
		Node K	Success status
Node L	Status of fail
		Node M	Status of fail
Node N	Success status
		Node O	Status of fail
Node P	Status of fail
		Node Q	Status of fail

504th, based on the second attribute list, task attribute information is found out in node G~Q includes the node of halted state.

The node placed in a suspend state found out in the second attribute list is node J.

505th, in the second mapping table and the 3rd mapping table, simultaneously deletion of node J and its downstream node are searched.

Wherein, node J downstream node includes node M, i.e., what is deleted in the second mapping table and the 3rd mapping table is section Point J and node M.

Specifically, the second mapping table after deletion can be as shown in table 6：

Table 6

The 3rd mapping table after deletion can be as shown in table 7：

Table 7

Key	Value
		Node Q	Node K, node O
Node P	Node L
		Node O	Node K, node L
Node N	Node K
		Node L	Node I
Node K	Node H, node I
		Node I	Node G
Node H	Node G

It is understood that after the 3rd mapping table shown in the second mapping table and table 7 shown in 505 generation tables 6, use Family can utilize table 6 or table 7 to searching the needing to run of the task in the task involved by Finance Department again.Wherein, according to actual need Asking, user can trigger system into 506, to search the needing to run of the task in the downstream node for specifying node again, or, use Family can also trigger system into 509, to search the needing to run of the task in the upstream node for specifying node again.

506th, task corresponding to node H is selected as the second benchmark task in response to user, obtain node H as the second base Quasi- node.

If user needs, positioning is in status of fail in node H downstreams again in the branch of task involved by Finance Department Node tasks, can to corresponding to node H task carry out selection operation.System, can basis in response to this selection operation Second mapping table and the second attribute list search the node tasks that egress H downstreams need to run again.Search procedure specifically may refer to 507 and 508.

507th, node H downstream node is searched in the second mapping table.

In the second mapping table (i.e. table 6), node H downstream node includes node K, L, N, O, P, Q.

508th, based on the second attribute list, task attribute information is found out in node H, K, L, N, O, P, Q includes failure shape The node of state.

According to the second attribute list (i.e. table 5), 508 nodes found out include node L, O, P, Q, then need running again for task It is task corresponding to node L, O, P, Q.

509th, task corresponding to node Q is selected as the 3rd benchmark task in response to user, obtain node Q as the 3rd base Quasi- node.

If user needs, positioning is in status of fail in node Q upstreams again in the branch of task involved by Finance Department Node tasks, can to corresponding to node Q task carry out selection operation.System, can basis in response to this selection operation 3rd mapping table and the second attribute list search the node tasks that egress Q upstreams need to run again.Search procedure specifically may refer to 510 and 511.

510th, node Q upstream node is searched in the 3rd mapping table.

In the 3rd mapping table (i.e. table 7), node Q upstream node includes node H, I, K, L, O.

511st, based on the second attribute list, task attribute information is found out in node H, I, K, L, O includes status of fail Node.

According to the second attribute list (i.e. table 5), 511 nodes found out include node L, O, then the needing to run again of the task is Task corresponding to node L, O.

In the present embodiment, if user needs repeatedly to search times for needing to run in the task involved by Finance Department again Business, the relevant information of all tasks involved by traversal group company can be first passed through, in all involved by group company The task involved by Finance Department is found out in business, and is searched in the task attribute information that dead involved all tasks are disclosed by group Go out the task attribute information of the task involved by Finance Department, then, only by travel through task involved by Finance Department and its Task attribute information, can be searched only in the task involved by Finance Department needs to run task again, it is seen then that for the more of user Secondary task of running again is searched, and is run task again every time and is searched the relevant information for all only needing to travel through the task involved by Finance Department, and The relevant information of all tasks involved by traversal group company need not be gone again, needed so as to reduce to run in task search procedure again The information content to be traveled through, lookup speed is improved, shorten lookup time delay, and also save the processing money of computer system Source.

In application scenes, the method that the application embodiment provides can apply to user terminal and server group Into network system.Corresponding to such application scenarios, Fig. 6 shows a kind of method of lookup task in the embodiment of the present application Schematic flow sheet.The method of the present embodiment can apply to user terminal, i.e. the method for the present embodiment can be whole by the user End performs.Specifically, the method for the present embodiment for example may comprise steps of：

601st, the operation interface for selecting the first benchmark task is shown；

602nd, in response to the selected operation of first benchmark task, sent to server and be directed to first benchmark task The first selected instruction, so that the server obtains node corresponding to first benchmark task as the first datum node, The downstream node of first datum node is searched in the first mapping table, and with first datum node and first base The downstream node of quasi- node generates the second mapping table and/or the 3rd as first object node based on the first object node Mapping table；

Optionally, methods described can also include：

Show the operation interface for selecting the second benchmark task；

Receive the task lookup result and show.

Optionally, methods described can also include：

Show the operation interface for selecting the 3rd benchmark task；

Receive the task lookup result and show.

It is understood that in the present embodiment, the action that the server performs specifically may refer to earlier figures 2~5 The introduction of shown embodiment, will not be repeated here.

In the present embodiment, the more subtasks initiated for user terminal to server are searched, and server is in every subtask The relevant information of the task under traversal particular category is all only needed during lookup, without going the correlation for traveling through all tasks to believe again Breath, the information content traveled through is needed so as to reducing server in task search procedure, lookup speed is improved, shortens lookup Time delay, and also save the process resource of computer system.

Example devices

Referring to Fig. 7, a kind of structural representation of the device of lookup task in the embodiment of the present application is shown.The present embodiment Device for example can apply to any one computer system.In the present embodiment, described device for example can specifically include：

First acquisition unit 701, for the selected operation in response to the first benchmark task, obtain first benchmark task Corresponding node is as the first datum node；

First generation unit 702, for searching the downstream node of first datum node in the first mapping table, and with The downstream node of first datum node and first datum node is as first object node, based on the first object Node generates the second mapping table and/or the 3rd mapping table；

Optionally, in addition to：

Referring to Fig. 8, a kind of structural representation of the device of lookup task in the embodiment of the present application is shown.The present embodiment Device can for example be configured at user terminal.In the present embodiment, described device for example can specifically include：

First display unit 801, for showing the operation interface for being used for selecting the first benchmark task；

First transmitting element 802, for the selected operation in response to first benchmark task, send and be directed to server The selected instruction of the first of first benchmark task, make so that the server obtains node corresponding to first benchmark task For the first datum node, the downstream node of first datum node is searched in the first mapping table, and with first benchmark The downstream node of node and first datum node is as first object node, based on first object node generation second Mapping table and/or the 3rd mapping table；

Optionally, described device can also include：

First receiving unit, for receiving the task lookup result and showing.

Optionally, described device can also include：

Second receiving unit, for receiving the task lookup result and showing.

It should be noted that herein, such as first and second or the like relational terms are used merely to a reality Body or operation make a distinction with another entity or operation, and not necessarily require or imply and deposited between these entities or operation In any this actual relation or order.Term " comprising ", "comprising" or its any other variant are intended to non-row His property includes, so that process, method, article or equipment including a series of elements not only include those key elements, and And also include the other element being not expressly set out, or also include for this process, method, article or equipment institute inherently Key element.In the absence of more restrictions, the key element limited by sentence "including a ...", it is not excluded that including institute State in process, method, article or the equipment of key element and other identical element also be present.

For device embodiment, because it corresponds essentially to embodiment of the method, so related part is real referring to method Apply the part explanation of example.Apparatus embodiments described above are only schematical, wherein described be used as separating component The unit of explanation can be or may not be physically separate, can be as the part that unit is shown or can also It is not physical location, you can with positioned at a place, or can also be distributed on multiple NEs.Can be according to reality Need to select some or all of module therein to realize the purpose of this embodiment scheme.Those of ordinary skill in the art are not In the case of paying creative work, you can to understand and implement.

Described above is only the embodiment of the application, it is noted that for the ordinary skill people of the art For member, on the premise of the application principle is not departed from, some improvements and modifications can also be made, these improvements and modifications also should It is considered as the protection domain of the application.

Claims

A kind of 1. method of lookup task, it is characterised in that including：

In response to the selected operation of the first benchmark task, node corresponding to first benchmark task is obtained as the first benchmark section Point；

Search the downstream node of first datum node in the first mapping table, and with first datum node and described the The downstream node of one datum node as first object node, based on the first object node generate the second mapping table and/or 3rd mapping table；

Wherein, first mapping table is used to record existing father node reflecting to child node between node corresponding to all tasks Penetrate relation, second mapping table is used to recording between the first object node existing father node to the mapping pass of child node System, the 3rd mapping table are used to record between the first object node existing child node to the mapping relations of father node；

Second mapping table and the 3rd mapping table, it is used to search the second destination node for task search request, with So that task corresponding to second destination node is identified as goal task corresponding to the task search request.
2. according to the method for claim 1, it is characterised in that first mapping table is stored in database, and described the Two mapping tables and the 3rd mapping table are stored in internal memory.
3. according to the method for claim 1, it is characterised in that also include：

Task attribute information corresponding to the first object node is searched in the first attribute list, and is based on the first object section Task attribute information generates the second attribute list corresponding to point；

Wherein, first attribute list is used to record task attribute information corresponding to node corresponding to all tasks, and described second Attribute list is used to record task attribute information corresponding to the first object node；

Second attribute list, for task based access control attribute information to be looked into the first object node for task search request The second destination node is looked for, to cause task corresponding to second destination node to be identified as corresponding to the task search request Goal task.
4. according to the method for claim 3, it is characterised in that first attribute list is stored in database, and described the Two attribute lists are stored in internal memory.
5. the method according to claim 1 or 3, it is characterised in that also include：

In response to the selected operation of the second benchmark task, node corresponding to the second benchmark task is obtained as the second datum node；

The downstream node of second datum node is searched in the second mapping table, to cause the downstream of second datum node Node is used for determining second destination node.
6. according to the method for claim 5, it is characterised in that also include：

Based on second attribute list, the 3rd destination node is searched in the downstream node of second datum node, to cause 3rd destination node is used for determining second destination node；

Wherein, the task attribute information of the 3rd destination node represents that task is in failure corresponding to the 3rd destination node State.
7. according to the method for claim 5, it is characterised in that second benchmark is searched in the second mapping table described Before the downstream node of node, in addition to：

Based on first attribute list, the 4th destination node, the 4th destination node are searched in the first object node Task attribute information represent that task is placed in a suspend state corresponding to the 4th destination node；

In second mapping table, search and delete the downstream joint of the 4th destination node and the 4th destination node Point.
8. the method according to claim 1 or 3, it is characterised in that also include：

In response to the selected operation of the 3rd benchmark task, node corresponding to the 3rd benchmark task is obtained as the 3rd datum node；

The upstream node of the 3rd datum node is searched in the 3rd mapping table, to cause the upstream of the 3rd datum node Node is used for determining second destination node.
9. according to the method for claim 8, it is characterised in that also include：

Based on second attribute list, the 5th destination node is searched in the upstream node of the 3rd datum node, to cause 5th destination node is used for determining second destination node；

Wherein, the task attribute information of the 5th destination node represents that task is in failure corresponding to the 5th destination node State.
10. according to the method for claim 8, it is characterised in that the 3rd base is searched in the 3rd mapping table described Before the upstream node of quasi- node, in addition to：

Based on first attribute list, the 4th destination node, the 4th destination node are searched in the first object node Task attribute information represent that task is placed in a suspend state corresponding to the 4th destination node；

In the 3rd mapping table, search and delete the downstream joint of the 4th destination node and the 4th destination node Point.
A kind of 11. device of lookup task, it is characterised in that including：

First acquisition unit, for the selected operation in response to the first benchmark task, obtain corresponding to first benchmark task Node is as the first datum node；

First generation unit, for searching the downstream node of first datum node in the first mapping table, and with described The downstream node of one datum node and first datum node is given birth to as first object node based on the first object node Into the second mapping table and/or the 3rd mapping table；

Wherein, first mapping table is used to record existing father node reflecting to child node between node corresponding to all tasks Penetrate relation, second mapping table is used to recording between the first object node existing father node to the mapping pass of child node System, the 3rd mapping table are used to record between the first object node existing child node to the mapping relations of father node；

Second mapping table and the 3rd mapping table, it is used to search the second destination node for task search request, with So that task corresponding to second destination node is identified as goal task corresponding to the task search request.
12. device according to claim 11, it is characterised in that first mapping table is stored in database, Second mapping table and the 3rd mapping table are stored in internal memory.
13. device according to claim 11, it is characterised in that also include：

Second generation unit, for searching task attribute information corresponding to the first object node in the first attribute list, and Second attribute list is generated based on task attribute information corresponding to the first object node；

Wherein, first attribute list is used to record task attribute information corresponding to node corresponding to all tasks, and described second Attribute list is used to record task attribute information corresponding to the first object node；

Second attribute list, for task based access control attribute information to be looked into the first object node for task search request The second destination node is looked for, to cause task corresponding to second destination node to be identified as corresponding to the task search request Goal task.
14. device according to claim 13, it is characterised in that first attribute list is stored in database, described Second attribute list is stored in internal memory.
15. the device according to claim 11 or 13, it is characterised in that also include：

Second acquisition unit, for the selected operation in response to the second benchmark task, obtain node corresponding to the second benchmark task As the second datum node；

First searching unit, it is described to cause for searching the downstream node of second datum node in the second mapping table The downstream node of second datum node is used for determining second destination node.
16. device according to claim 15, it is characterised in that also include：

Second searching unit, for based on second attribute list, to be searched in the downstream node of second datum node Three destination nodes, to cause the 3rd destination node to be used for determining second destination node；

Wherein, the task attribute information of the 3rd destination node represents that task is in failure corresponding to the 3rd destination node State.
17. device according to claim 15, it is characterised in that also include：

3rd searching unit, for searching the downstream of second root node in the second mapping table in first searching unit Before node, based on first attribute list, the 4th destination node, the 4th target are searched in the first object node The task attribute information of node represents that task is placed in a suspend state corresponding to the 4th destination node；

First deletes unit, in second mapping table, searching and deleting the 4th destination node and the described 4th The downstream node of destination node.
18. the device according to claim 11 or 13, it is characterised in that also include：

3rd acquiring unit, for the selected operation in response to the 3rd benchmark task, obtain node corresponding to the 3rd benchmark task As the 3rd datum node；

4th searching unit, it is described to cause for searching the upstream node of the 3rd datum node in the 3rd mapping table The upstream node of 3rd datum node is used for determining second destination node.
19. device according to claim 18, it is characterised in that also include：

5th searching unit, for based on second attribute list, to be searched in the upstream node of the 3rd datum node Five destination nodes, to cause the 5th destination node to be used for determining second destination node；

Wherein, the task attribute information of the 5th destination node represents that task is in failure corresponding to the 5th destination node State.
20. device according to claim 18, it is characterised in that also include：

6th searching unit, for searching the 3rd datum node in the 3rd mapping table described in the 4th searching unit Upstream node before, based on first attribute list, search the 4th destination node in the first object node, described the The task attribute information of four destination nodes represents that task is placed in a suspend state corresponding to the 4th destination node；

Second deletes unit, in the 3rd mapping table, searching and deleting the 4th destination node and the described 4th The downstream node of destination node.
A kind of 21. method of lookup task, it is characterised in that applied to user terminal, including：

Show the operation interface for selecting the first benchmark task；

In response to the selected operation of first benchmark task, the first choosing for first benchmark task is sent to server Fixed instruction, as the first datum node, reflected so that the server obtains node corresponding to first benchmark task first The downstream node of first datum node is searched in firing table, and with first datum node and first datum node Downstream node generates the second mapping table and/or the 3rd mapping table as first object node based on the first object node；

Wherein, first mapping table is used to record existing father node reflecting to child node between node corresponding to all tasks Penetrate relation, second mapping table is used to recording between the first object node existing father node to the mapping pass of child node System, the 3rd mapping table are used to record between the first object node existing child node to the mapping relations of father node；

Second mapping table and the 3rd mapping table, it is used to search the second destination node for task search request, with So that task corresponding to second destination node is identified as goal task corresponding to the task search request.
22. according to the method for claim 21, it is characterised in that also include：

Show the operation interface for selecting the second benchmark task；

In response to the selected operation of second benchmark task, appointing for second benchmark task is sent to the server Business search request, as the second datum node, reflected so that the server obtains node corresponding to the second benchmark task second The downstream node of second datum node is searched in firing table, described is determined from the downstream node of second datum node Two destination nodes, and task lookup result is sent to the user terminal based on task corresponding to second destination node；

Receive the task lookup result and show.
23. according to the method for claim 21, it is characterised in that also include：

Show the operation interface for selecting the 3rd benchmark task；

In response to the selected operation of the 3rd benchmark task, appointing for the 3rd benchmark task is sent to the server Business search request, as the 3rd datum node, reflected so that the server obtains node corresponding to the 3rd benchmark task the 3rd The downstream node of the 3rd datum node is searched in firing table, described is determined from the downstream node of the 3rd datum node Two destination nodes, and task lookup result is sent to the user terminal based on task corresponding to second destination node；

Receive the task lookup result and show.
A kind of 24. device of lookup task, it is characterised in that user terminal is configured at, including：

First display unit, for showing the operation interface for being used for selecting the first benchmark task；

First transmitting element, for the selected operation in response to first benchmark task, sent to server for described the The selected instruction of the first of one benchmark task, so that the server obtains node corresponding to first benchmark task as first Datum node, searches the downstream node of first datum node in the first mapping table, and with first datum node with The downstream node of first datum node generates the second mapping table as first object node based on the first object node And/or the 3rd mapping table；

Wherein, first mapping table is used to record existing father node reflecting to child node between node corresponding to all tasks Penetrate relation, second mapping table is used to recording between the first object node existing father node to the mapping pass of child node System, the 3rd mapping table are used to record between the first object node existing child node to the mapping relations of father node；

Second mapping table and the 3rd mapping table, it is used to search the second destination node for task search request, with So that task corresponding to second destination node is identified as goal task corresponding to the task search request.
25. device according to claim 24, it is characterised in that also include：

Second display unit, for showing the operation interface for being used for selecting the second benchmark task；

Second transmitting element, for the selected operation in response to second benchmark task, sent to the server and be directed to institute The task search request of the second benchmark task is stated, so that the server obtains node corresponding to the second benchmark task as second Datum node, the downstream node of second datum node is searched in the second mapping table, under second datum node Second destination node is determined in trip node, and is sent out based on task corresponding to second destination node to the user terminal Send task lookup result；

First receiving unit, for receiving the task lookup result and showing.
26. device according to claim 24, it is characterised in that also include：

3rd display unit, for showing the operation interface for being used for selecting the 3rd benchmark task；

3rd transmitting element, for the selected operation in response to the 3rd benchmark task, sent to the server and be directed to institute The task search request of the 3rd benchmark task is stated, so that the server obtains node corresponding to the 3rd benchmark task as the 3rd Datum node, the downstream node of the 3rd datum node is searched in the 3rd mapping table, under the 3rd datum node Second destination node is determined in trip node, and is sent out based on task corresponding to second destination node to the user terminal Send task lookup result；

Second receiving unit, for receiving the task lookup result and showing.