CN110321107A - The generation method and server of data processing module - Google Patents

The generation method and server of data processing module Download PDF

Info

Publication number
CN110321107A
CN110321107A CN201810293377.9A CN201810293377A CN110321107A CN 110321107 A CN110321107 A CN 110321107A CN 201810293377 A CN201810293377 A CN 201810293377A CN 110321107 A CN110321107 A CN 110321107A
Authority
CN
China
Prior art keywords
task
node
task node
type
data processing
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201810293377.9A
Other languages
Chinese (zh)
Inventor
范雷雷
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Alibaba China Co Ltd
Original Assignee
Youku Network Technology Beijing Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Youku Network Technology Beijing Co Ltd filed Critical Youku Network Technology Beijing Co Ltd
Priority to CN201810293377.9A priority Critical patent/CN110321107A/en
Publication of CN110321107A publication Critical patent/CN110321107A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00Arrangements for software engineering
    • G06F8/20Software design
    • G06F8/22Procedural

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

This application provides a kind of generation method of data processing module and servers, wherein, this method comprises: obtaining task execution sequence chart, the task execution sequence chart is used to characterize the task type for executing sequence, task node in task flow between each task node;Task execution sequence chart is parsed, to obtain the task type mark of the task node in task flow, the position coordinates of task node;According to the task type of task node mark, the position coordinates of task node, the processing logic of simultaneously combined task node is called, to generate the data processing module for carrying out data processing.Compared to existing method, the task type mark of task node, the position coordinates of task node are determined by the task execution sequence chart using characterization task stream information;It is combined again using above-mentioned data as according to the corresponding processing logic of calling to generate data processing module, to solve the problems, such as that efficiency of the practice present in existing method is low, waste of resource, be easy to appear error.

Description

The generation method and server of data processing module
Technical field
The application belongs to the generation method and server of Internet technical field more particularly to a kind of data processing module.
Background technique
With the development of internet technology, requirement of the people to data processing is higher and higher, more and more diversified.It is how fast The individual requirement of user is interpreted and determined fastly, how efficiently to generate the data processing mould required for different user difference Block is increasingly valued by people to complete corresponding data processing.
Currently, many users (such as small-sized website or individual) can select by comparatively professional data processing Resource and technology provided by platform, to complete the data processing business required by oneself.For example, certain miniature video website C stands In order to carry out video processing to the video in our station, the video processing platform A that the process demand of oneself can be sent to profession is put down Platform.After the technical staff on A platform backstage analyzes the website C demand inputted, the demand that website C may be implemented is write Program code, to form the video processing module that can specially meet the video process demand of website C.
However, above-mentioned this processing mode needs the technical staff on backstage first to analyze the demand of user, corresponding appoint is determined Business stream;Corresponding data processing module is generated by h coding further according to task flow.Since aforesaid way is in the process of realization In cannot be detached from the participation of technical staff, need to occupy a large amount of human resources when existing method being caused to be embodied, and implement Rate is low.Again since existing method needs a large amount of dependence manual operations, cause also to be easy to appear human error when implementing.
In view of the above-mentioned problems, currently no effective solution has been proposed.
Summary of the invention
The application is designed to provide the generation method and server of a kind of data processing module, is deposited with solving existing method Efficiency of the practice it is low, waste of manpower resource, be easy to appear the problem of error, reach at efficient, accurate, automatically generated data Manage the purpose of module.
To achieve the above object, the application embodiment provides a kind of generation method of data processing module, comprising:
Obtain task execution sequence chart, wherein the task execution sequence chart is for characterizing each task node in task flow Between the task type for executing sequence, task node;
The task execution sequence chart is parsed, to obtain the task type mark of the task node in the task flow, appoint The position coordinates of business node;
According to the task type of task node mark, the position coordinates of the task node, simultaneously combined task is called The processing logic of node, to generate the data processing module for carrying out data processing.
To achieve the above object, the application is embodiment further provides a kind of generation method of video data processing module, It include: to obtain task flow characterize data, wherein the task flow characterize data is for characterizing in task flow between each task node The task type for executing sequence, task node;According to the task flow characterize data, the task section in the task flow is determined The position coordinates of the task type mark, task node put;According to the task type of task node mark, the task section The position coordinates of point call the processing logic of simultaneously combined task node, to generate the data processing mould for carrying out data processing Block.
To achieve the above object, embodiment further provides a kind of servers by the application, comprising: network communication interface is deposited Reservoir and processor, in which: the network communication interface, for obtaining task execution sequence chart, wherein the task execution sequence Column figure is used to characterize the task type for executing sequence, task node in task flow between each task node;The processor is used In parsing the task execution sequence chart, to obtain task type mark, the task node of the task node in the task flow Position coordinates;According to the task type of task node mark, the position coordinates of the task node, calls and combine and appoint The processing logic of business node, to generate the data processing module for carrying out data processing;The memory, it is described for storing The processing logic of task node.
To achieve the above object, the application stores thereon embodiment further provides a kind of computer readable storage medium There is computer instruction, described instruction is performed realization: obtaining task execution sequence chart, wherein the task execution sequence chart For characterizing the task type for executing sequence, task node in task flow between each task node;Parse the task execution Sequence chart, to obtain the task type mark of the task node in the task flow, the position coordinates of task node;According to described Task node task type mark, the task node position coordinates, call and combined task node processing logic, with Generate the data processing module for carrying out data processing.
Therefore the generation method and server of data processing module provided herein, avoid existing method To the dependence of people in implementation process, but machine is first determined by the task execution sequence chart using characterization task stream information The task node can voluntarily identify, judged task type mark, task node position coordinates;Again by machine with above-mentioned number Corresponding processing logic is voluntarily called to be combined according to as identification, judgment basis, to generate required data processing module, To solve the problems, such as that efficiency of the practice present in existing method is low, waste of manpower resource, be easy to appear error, reaching can With purpose that is efficient, accurate, automatically generating data processing module.
Detailed description of the invention
In order to illustrate the technical solutions in the embodiments of the present application or in the prior art more clearly, to embodiment or will show below There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this The some embodiments recorded in application, for those of ordinary skill in the art, in the premise of not making the creative labor property Under, it is also possible to obtain other drawings based on these drawings.
Fig. 1 is a kind of processing flow schematic diagram of embodiment of the generation method of data processing module provided by the present application;
Fig. 2 is the schematic diagram of the task execution sequence chart in the generation method of data processing module provided by the present application;
Fig. 3 is to carry out in the generation method of data processing module provided by the present application to the processing logic of current task node The process schematic of processing;
Fig. 4 is to show in a scene embodiment using one of the generation method of data processing module provided by the present application It is intended to;
Fig. 5 is specific to some using the method for formation of data processing module provided by the present application in a scene embodiment The schematic diagram that task flow is analyzed and processed;
Fig. 6 is a kind of schematic diagram realized by machine of the generation method of data processing module provided by the present application;
Fig. 7 is the process flow signal of another embodiment of the generation method of data processing module provided by the present application Figure;
Fig. 8 is a kind of structural schematic diagram of embodiment of server provided by the present application.
Specific embodiment
In order to make those skilled in the art better understand the technical solutions in the application, below in conjunction with the application reality The attached drawing in example is applied, the technical scheme in the embodiment of the application is clearly and completely described, it is clear that described implementation Example is merely a part but not all of the embodiments of the present application.Based on the embodiment in the application, this field is common The application protection all should belong in technical staff's every other embodiment obtained without creative efforts Range.
In view of the generation method of existing data processing module tends not to directly rely on machine (for example, computer) certainly It is dynamic to complete, also need to rely on the participation of people mostly.Specifically, existing method needs the technical staff on backstage first to analyze when realizing The demand of user, with the corresponding task flow of determination;It is generated at corresponding data further according to task flow by modes such as h codings Manage module.Since a data processing module often includes the data processing task of multiple and different types, and different numbers Mutually there is more complicated relevance in execution according to processing task.How accurately to judge next after a certain task execution Which type of a what task of connection connect another task as follow-up work as follow-up work at, and Corresponding follow-up work etc. how is connected, machine completion can not be relied solely in the conventional method.Therefore, existing method is being implemented It needs largely to rely on human resources in the process.Connection group especially in the case where user demand is relative complex, between task Conjunction relationship is increasingly complex, changeable, and at this moment occupancy of the existing method to the resource of manpower, the influence to efficiency of the practice become apparent. For the basic reason for generating the above problem, the application considers can be from machine recognition, the mechanism of judgement, using being capable of table The task execution sequence chart of task flow is levied as primary data, the type mark of task node is determined according to task execution sequence chart Know, the position coordinates of task node, then using the position coordinates of task node as machine recognition, the foundation of judgement, so that machine Corresponding data processing module can be automatically generated according to above-mentioned data, so as to avoid the occupancy to human resources, solved The low problem of waste of resource present in existing method, efficiency of the practice.In addition, reducing due also to reduce manual operation Error improves the accuracy for generating data processing module.Be finally reached it is efficient, accurate, automatically generate data processing mould The purpose of block.
Based on above-mentioned consideration, the application embodiment provides a kind of generation method of data processing module, the data The generation method of processing module specifically can be applied to the server-side of data processing platform (DPP), so that data processing platform (DPP) Server can efficiently, it is accurate, automatically generate the data processing module for meeting user's requirement.Please refer to the related content of Fig. 1, institute It may comprise steps of when stating method specific implementation.
S11: task execution sequence chart is obtained, wherein the task execution sequence chart is for characterizing each task in task flow The task type for executing sequence, task node between node.
In the present embodiment, above-mentioned task flow specifically can be understood as a kind of data processing stream for meeting user's requirement Journey.Generally according to the requirement of user, the data processing that data to be processed are carried out with multiple-task combination is generally required, specific In treatment process, above-mentioned task flow, which can wrap, executes sequence and each containing task node each in flow chart of data processing The task type of task node.
In the present embodiment, it should be noted that task execution sequence chart used in above-mentioned can only characterize task One of data of stream.Also it can use the task flow characterize data that other can characterize task flow when specific implementation to be used as just Beginning data are obtained.Correspondingly, subsequent can generate at the data of data processing according to acquired task flow characterize data Manage module.For example, can as the case may be and demand, selection uses the execution that can be characterized in task flow between each task node Sequentially, the two-dimensional array of the information such as task type of task node or preset characters carry out subsequent as task flow characterize data The generation of data processing module.In the present embodiment, by taking the task execution sequence chart in task flow characterize data as an example, specifically It illustrates how to generate data processing module using task execution sequence chart.It is generated using other kinds of task flow characterize data The process of data processing module can be refering to the specific implementation process for generating data processing module using task execution sequence chart.
In the present embodiment, the execution sequence between above-mentioned task node specifically can be used to indicate that each task node Corresponding processing task present position relationship in entire task flow, such as longitudinal precedence relationship between task node And/or the coordination in transverse direction.For example, the execution in same link, between third task node and the 4th task node Sequence may is that the position of third task node is first, and the position of the 4th task node is rear.It can determine and counted in this way Task corresponding to third task node is first carried out when according to processing, it, just can be with after having carried out third task node of the task Carry out task corresponding to the 4th task node.It can be appreciated that the task execution sequence of third task node is third batch Task, the task of the 4th task node is the task of the 4th batch of execution sequence, in having executed all third batches of the task Afterwards, can just start to execute the task in the 4th batch.Wherein, above-mentioned link specifically can be understood as multiple tasks node and longitudinally connect Connect the task chain to be formed.In another example the 4th task node and the 5th task node can be positioned at mutually parallel two articles respectively Different chain roads task node, precedence relationship is identical on the longitudinal direction of the two task node positions in task flow, such as All in the same task batch, but between the two task nodes, there is also coordinations, can determine the 4th task in this way Task corresponding to task corresponding to node and the 5th task node is in two articles of different links while can to carry out, i.e., Link locating for link locating for 4th task node and the 5th task node is two articles of parallel links.Wherein, above-mentioned parallel Task node in both links in each link connects along longitudinal direction and in a serial fashion in locating link, both links Between mutually there is relationship arranged side by side, i.e., when carrying out data processing, above-mentioned two parallel links are that ad eundem is other, and to it In the execution of a parallel link another parallel link will not be had an impact.Correspondingly, due to the 5th task node and The positional relationship of four task nodes is coordination, is to be located at task node on different parallel links, therefore the 4th Task node and the 5th task node between each other without direct relevance, i.e. the 4th task node and the 5th task node it Between will not generate and influence each other, in specific execute, one of them can also be arranged according to corresponding strategy as the case may be The task of task node first carries out, and executes after the task of another task node.This can flexibly be set as the case may be.
In the present embodiment, each of task flow task node all corresponds to a kind of specific task type, with table Sign needs to be implemented the processing task of the task type in the execution step locating for the task node.For example, first task node Task type be A, then it represents that at first task node carry out type-A task processing.Wherein, the task type can be with Changed according to the variation of data type to be processed.For example, if data to be processed are video datas, above-mentioned task class Type can be data processing type relevant to video data, can specifically include: video download, video cutting, video merging, Video hides mark, the transition point analysis in video, personage's analysis in video, addition video watermark, addition video bag frame etc..Such as Fruit data to be processed are lteral datas, then above-mentioned task type can be data processing type relevant to lteral data, tool Body may include: sentence structure analysis, part of speech determination, semantic association etc..Certainly, above-mentioned cited multiple-task type It is in order to which the application embodiment is better described.The improper restriction to the application embodiment should not be constituted.
In the present embodiment, above-mentioned task execution sequence chart specifically can be a kind of is made up of two-dimensional array structure Structure chart.It specifically can be refering to the task execution sequence chart of the three types cited by Fig. 2.In order to meet user increasingly Complicated, more and more diversified customization requirement, above-mentioned task execution sequence chart specifically can carry out table using two-dimensional array structure Show, the successive pass executed on the longitudinal direction between node location of going out on missions not only is characterized by above-mentioned task execution sequence chart in this way System's (i.e. between task node serial execute sequence), moreover it is possible to accurately reflect it is in the transverse direction between task node position and Column relationship (i.e. between task node parallel execute sequence).Wherein, arranged side by side in the transverse direction between above-mentioned task node position Relationship can specifically refer to whether link locating for different task node is parallel link, or whether an individual single continuous chain Road, and existing structure chart is constituted using simple one-dimension array structure mostly, often can only using existing structure chart The precedence relationship executed on the longitudinal direction of task node position, the coordination that can not be but fully described by out in transverse direction is depicted.This Embodiment institute can use lengthwise position coordinate (ordinate), lateral position coordinate (abscissa) using task execution sequence chart Two parameters characterize the coordination in the precedence relationship and transverse direction executed on the position longitudinal direction of each task node respectively.? To understand are as follows: above-mentioned task execution sequence chart can be by completely symbolizing the position coordinates of task node using two-dimensional array Abscissa and ordinate, wherein the ordinate specifically can be used for characterizing that the task node is longitudinal executes sequence Feature, the abscissa specifically can be used for characterizing the Concurrent Feature in the transverse direction of the link where the task node.
When it is implemented, whether the link where the abscissa that can use task node determines task node is parallel-chain Road or uniline link.It can specifically be made comparisons with the abscissa of task node with uniline instruction parameter.If the cross of task node Coordinate is equal with the uniline instruction numerical value of parameter, then can determining link locating for the task node, there is no other links and its Parallel, i.e., link locating for task node is uniline link.Wherein, the data of above-mentioned uniline instruction parameter specifically can be set to 0. Certainly, the numerical value of above-mentioned cited uniline instruction parameter is that one kind schematically illustrates.When it is implemented, can also be by uniline Instruction parameter is set as other suitable numerical value, is not construed as limiting to this application.In case where uniline instruction parameter is 0, If the abscissa of some task node is equal to 0, may determine that without link locating for other links and the task node simultaneously Row, i.e., without other task nodes and the task node there are coordination, link locating for the task node is uniline link. Certainly, when building obtains task execution sequence chart, the task node in uniline link for meeting above situation is in addition to can The numerical value of abscissa is set as outside uniline instruction parameter in advance, directly its abscissa can also be emptied, to characterize the task Link locating for node is uniline link, is not parallel link.This application is not construed as limiting.Opposite, if task node Abscissa be not equal to 0, then may determine that there are other links and link locating for the task node are parallel, it is possible to which there are it There are coordination, link locating for the task node is parallel link for his task node and the task node.In addition, task section The abscissa of point can be also used for distinguishing the parallel link where the task node in a plurality of parallel link.For example, some is appointed Be engaged in node abscissa be 1, then may determine that there are other links and the task node place link it is parallel, the task node institute It is parallel link in link, and link locating for the task node is the parallel link (example that number is 1 in a plurality of parallel link Such as, it can refer in a plurality of mutually parallel link first parallel link from left to right).Similar, another task node Abscissa is 5, then the link where may determine that the task node is the parallel link that number is 5 in a plurality of parallel link.This Coordination that sample is not only able to accurately to be depicted between task node by the abscissa of above-mentioned task node (or task Parallel between node executes sequence), i.e., the Concurrent Feature in the transverse direction of the link where the described task node is taken the post as with determination Whether link where business node is uniline link.
In addition to the Concurrent Feature in the transverse direction of the link where the abscissa using task node characterizes the task node, In above-mentioned task execution sequence chart, it can also be characterized in flow chart of data processing using the ordinate of task node vertical along link Upward sequencing, i.e., the described longitudinal execution ordinal characteristics of task node.For example, refering to the second class in Fig. 2 Type task execution sequence chart, the position coordinates for the task node that number is 1 in the structure chart can specifically be expressed as (, 1), In, the abscissa of the task node is sky, ordinate 1.It may determine that and do not deposit by the numerical value of the abscissa of the task order Parallel in other links and link locating for the task node, i.e., the link where the task node is uniline link;By this The numerical value of the ordinate of task node may determine that the task sequence of execution in the longitudinal direction of the task node is 1, be first It executes, or the task of the task node is claimed to be to belong to the task of first batch.In another example in Second Type task execution sequence The position coordinates for the task node that number second number is 4 from left to right in column figure can specifically be expressed as (2,4).According to this The position coordinates analysis of business node, it is known that since the abscissa of the task node is not 0, i.e., parameter is indicated not equal to uniline, because This may determine that there are other links and the link where the task node are parallel, i.e., the link where the task node is parallel Link;And again since the numerical value of the abscissa of the task node is specially 2, the chain where the task node can be further judged Road is the parallel link that number is 2 in a plurality of mutually parallel parallel link.Simultaneously as the ordinate of the task node is 4, It may determine that execution sequence is 4 on the task longitudinal direction of the task node, i.e., the task category of the task node in entire task flow In the task of the 4th batch, specifically, can be understood as in times for successively having handled all task nodes that ordinate is 1,2,3 The task of the task node can be just started to process after business.
In the present embodiment, it is emphasized that above-mentioned task execution sequence chart is due to can completely, accurately state It goes out on missions and flows detailed process, details, therefore can visually be not understood as a kind of specific construction drawing, which includes to apply Construction material required for work (such as task type of task node), and (such as appointed using the specific rules of construction material Sequence is executed between business node).When such Specific construction, it may not be necessary to designer (such as data processing platform (DPP) backstage Technical staff), computer disposal can be fully relied on, existing method is avoided to account for when implementing to a large amount of energy, resource, time With.But can directly give drawing to machine, by machine by simply carry assembling (such as call preset point From processing logic and linker) constructed automatically (such as is met by connecting corresponding processing logic and establishing out automatically The data processing module that user requires).So as to reach the operation for effectively avoiding repeatability, efficiency of the practice is improved, number is reduced According to the workload of processing platform, the effect of human error is reduced.
In the present embodiment, above-mentioned task execution sequence chart can specifically obtain in the following way: acquisition user is defeated The instruction information entered, wherein the instruction information of user's input carries flow chart of data processing set by user, and (i.e. user sets Fixed task flow);The instruction information is parsed, to obtain flow chart of data processing set by user;It is set further according to the user Flow chart of data processing generate corresponding task execution sequence chart.Wherein, the instruction information of above-mentioned acquisition user input specifically may be used To include: the data for acquiring user and being inserted in specified definition template;And/or acquisition user is directed in specified interface The operation data of icon, the icon are directed toward the processing logic etc. of corresponding task type.For how to acquire the finger of user's input Show that information, the application are not construed as limiting.
S12: parsing the task execution sequence chart, to obtain the task type mark of the task node in the task flow Know, the position coordinates of task node.
In the present embodiment, specifically, can be obtained in task flow respectively by parsing above-mentioned task execution sequence chart Each task node task type mark, task node position coordinates.Wherein, it should be noted that above-mentioned task execution Sequence chart is a kind of structure chart being made of two-dimensional array structure.Above-mentioned two dimensional data structure can not only carry task node Position coordinates, moreover it is possible to while carrying the task type mark of task node.The task identification of above-mentioned task node specifically can be with With specific string representation.Wherein, the task type mark of above-mentioned task node is corresponding with a task type.It illustrates Bright, the corresponding task type of the task node that number is 4 is shearing video, accordingly about the task in task execution sequence chart It is not only stored with abscissa, the ordinate of the task node in the two-dimensional array structure of node, is also stored with the task node Task identification: " jianqie ".When it is implemented, the task section can be respectively obtained by the parsing to task execution sequence chart Position coordinates (such as (2,4)) and the task type mark (such as jianqie) of point, so as to subsequent use.
In the present embodiment, it should be noted that the mode of above-mentioned parsing task execution sequence chart is held with building task Row sequence chart is corresponding.When it is implemented, can according to building task execution sequence chart mode select corresponding mode to appoint Business executes sequence chart and is parsed.In this regard, the application is not construed as limiting.
S13: it according to the task type of task node mark, the position coordinates of the task node, calls and combines The processing logic of task node, to generate the data processing module for carrying out data processing.
In the present embodiment, above-mentioned processing logic specifically can be understood as a kind of certain concrete type that can be realized The program structure body of processing task.Wherein, each above-mentioned processing logic is corresponding with a kind of task type respectively, passes through one The data processing of corresponding task type may be implemented in processing logic.Furthermore, it is necessary to which it is emphasised that above-mentioned processing logic has Body can be the backstage for being prepared in advance and being stored in data processing platform (DPP) (for example, being stored in the server of data processing platform (DPP) In) for calling the program structure body of operation at any time.Also, above-mentioned processing logic is mutually indepedent between each other, is independent of each other, can To be individually combined, run so as to subsequent by server calls as needed.So in the specific implementation, machine can will be more The processing logic of kind task type prepares into independent program structure body in advance, so as at the data that combination meets different requirements When managing module, the program structure body having had been prepared for can be called directly, realizes corresponding task without regrouping again Program, existing program structure body before then may be reused improve so as to reduce the waste to resource, manpower Efficiency of the practice.
In the present embodiment, above-mentioned data processing module, which specifically can be understood as one kind, can satisfy user's requirement, According to flow chart of data processing set by user or task flow data to be processed are carried out with the execution of multiple-task processing in order Unit.Above-mentioned data processing module is further also understood that the combination that logic is handled for multiple-task.
In the present embodiment, above-mentioned data processing module specifically can be used for carrying out phase at least one of lower data The data processing answered: image data, voice data, video data, operational data, lteral data etc..Certainly, it needs to illustrate It is that above-mentioned cited data type is intended merely to better illustrate the application embodiment.When it is implemented, can also be by this Apply for that the generation method expansion of the data processing module provided is carried forward into the processing for other types data.For example, may be used also To promote the generation method of the data processing module, to generate the identity data processing for carrying out identity data verifying Module.
In the present embodiment, task type mark, the task node of each task node in task flow are obtained in parsing Position coordinates after, can voluntarily be called according to preset identification, judgment rule by smart machines such as machines, such as computer And the corresponding processing logic of each task node is combined, with data processing mould that is efficient, being automatically generated for progress data processing Block.When it is implemented, can be adjusted first according to the task type of task node mark, the position coordinates of the task node With the processing logic of task node;Further according to the task node task type mark, the task node position coordinates, The processing logic of combined task node, to generate the data processing module for meeting user's requirement.
In the present embodiment, it is also necessary to, it is emphasized that the task type of above-mentioned task node identifies, the position of task node Setting coordinate all is that machine can Direct Recognition, the data of analysis.Then when subsequent implementation, machine can be above-mentioned with Direct Recognition, analysis Data, voluntarily determine task type in corresponding task flow and multiple-task executes sequence, and then can not need artificial It participates in, is automatically performed the building of corresponding data processing module.
In the present embodiment, above-mentioned according to the task type of task node mark, the position of the task node Coordinate calls the processing logic of task node, when it is implemented, may include the following contents: according to appointing for the task node Service type mark calls the processing logic of the task node, wherein the preset processing from preset processing logical base Multiple processing logics are stored in logical base, and a kind of task type mark of a processing logical AND corresponds to.
In the present embodiment, above-mentioned processing logic specifically can store in processing logical base, above-mentioned processing logical base It is especially stored in data processing platform (DPP) side.For example, can store in the memory in the server of data processing platform (DPP), It can store in the storage equipment being connected with server.Phase is rapidly called so that server can be identified according to task type The processing logic answered.For the above-mentioned specific storage location of processing logic, can flexible setting as the case may be, in this regard, this Application is not construed as limiting.
In the present embodiment, above-mentioned according to the task type of task node mark, the position of the task node Coordinate, the processing logic of combined task node, when it is implemented, may include the following contents: according to the position of the task node Coordinate is set, the processing logic of the task node is connected, to generate the data processing module.
In the present embodiment, each to determine when it is implemented, the position coordinates of each task node can be analyzed respectively Connection relationship of the processing logic of a task node in task flow with the processing logic of other task nodes, and then can be successively The corresponding connection for completing the processing logic of each task node is completed the combination of the processing logic of task node, is obtained final Data processing module.
Below by taking the processing logic of current task node as an example, illustrate the processing for specifically how completing each task node The corresponding connection of logic.It can be refering to below for current task node for the connection of the processing logic of other task nodes Handle logic.It specifically can be refering to shown in Fig. 3.
When it is implemented, machine first can carry out recognition detection by the position coordinates to current task node, when it is implemented, It may include the following contents.
In the present embodiment, whether the processing logic that can first detect current task node is that processing in single continuous chain is patrolled Volume;After the processing logic for determining current task order is located in single continuous chain, determine present node in the single continuous chain whether also There are the processing logics of subsequent task node, if there is the processing logic of subsequent task node, by subsequent task section The processing of the processing logical AND current task node of point is logically contiguous.Specific implementation, may comprise steps of:
S1: whether the abscissa of detection current task node is equal to uniline instruction parameter.
S2: in the case where the abscissa of the current task node is equal to uniline instruction parameter, work as described in determination The processing logic of preceding task node is located in single continuous chain road.
S3: it detects in the task flow with the presence or absence of first kind node, wherein the ordinate of the first kind node The difference for subtracting the ordinate of the current task node is equal to preset threshold.
S4: there are in the case where the first kind node in determining the task flow, the current task section is determined There is also subsequent task nodes for the locating uniline link of point, and will be current described in the processing logical AND of the first kind node The processing of task node is logically contiguous.
In the present embodiment, the numerical value of above-mentioned uniline instruction parameter can be set to 0.Correspondingly, above-mentioned detection is as predecessor Whether the abscissa of business node is equal to uniline instruction parameter, may include: that the abscissa of current task node is made comparisons with 0. If the abscissa of current task node is equal to 0, it may determine that the processing logic of current task node is located at single continuous chain road In.Certainly, it should be noted that above-mentioned cited uniline instruction parameter is that one kind schematically illustrates.When it is implemented, also Can as the case may be and require, use other numerical value as above-mentioned uniline indicate parameter.In this regard, the application is not construed as limiting.
In addition, it is different according to the mode for establishing task execution sequence chart, be in the processing logic of detection current task node No is that can be combined with the mode of task execution sequence chart, such as the cross of setting task node during being located at uniline link Whether the specific rules of coordinate are to be located in uniline link to detect to current task node using other suitable modes. For example, if the rule of use is by the horizontal seat of the task node in uniline link when establishing task execution sequence chart Mark empties.At this moment, whether the processing logic for detecting current task order is located in uniline link, may include: detection as predecessor Whether the abscissa of business node is empty;In the case where it is empty for determining the abscissa of the current task node, it can be determined that when The processing logic of preceding task node is located in the uniline link.
In the present embodiment, current task can also be further determined that after determining that current task node is located at single continuous chain Whether the processing logic of node is that whether the last one processing logic, i.e. this uniline link have combined in this uniline link At.Specifically, can be to be detected in task node remaining in task flow, to determine the current task in this uniline link Whether there is also other subsequent task nodes after node.When it is implemented, can detecte whether there is in the task flow First kind node, wherein the ordinate of the first kind node subtracts the difference of the ordinate of the current task node Equal to preset threshold.Wherein, above-mentioned first kind node can indicate the subsequent task node of current task node.It is above-mentioned pre- If threshold value specifically can be set to 1.Certainly, it should be noted that above-mentioned cited preset threshold is that one kind schematically illustrates, When it is implemented, can also as the case may be with require to use other numerical value as above-mentioned preset threshold.In this regard, the application is not It limits.
For example, if the position coordinates of current task nodes X are (0,3), due to the abscissa of current task node Equal to 0 (be equal to uniline and indicate parameter), it can determine that X is in uniline link;Detection is in remaining task node again It is no exist meet ordinate subtract X ordinate value be 1 (i.e. preset threshold) first kind node, subsequent as X Business node.For example, the position coordinates for detecting a task node Y are (0,4), due to the difference of the ordinate of the ordinate and X of Y Value is 1, can determine that Y is the subsequent task node of X, and the processing of the processing logical AND X of Y is logically contiguous.
In the present embodiment, it is also necessary to which explanation, current task node are the node in single continuous chain, but current task The subsequent task node of node can be the node in single continuous chain, such as Y (0,4), the node being also possible in parallel link. In another example only egress Z (Isosorbide-5-Nitrae) may be detected in remaining task node for X, but the abscissa of Z is not 0, i.e. Z is At this moment the task node of parallel link can determine that Z is the parallel-chain where node and Z in uniline link where X The node on road may further judge that Z is the point of interface of above-mentioned uniline link and parallel link.Can be understood as Z is the place X Uniline link end node, while being the start node of the parallel link where Z again, at this moment machine can be according to same Mode is logically contiguous by the processing of the processing logical AND X of Z.
In the present embodiment, with the presence or absence of after first kind node in detecting the task flow, the method is also wrapped Include: in the case where in determining the task flow there is no the first kind node, it can be determined that current task node it Afterwards without subsequent node, i.e., the uniline link where current task node terminates, and then can determine the data processing module Combination is completed, that is, has been generated the data processing module for meeting user's requirement, can have been stopped subsequent detection, connection.
In the present embodiment, the processing of the current task node described in the processing logical AND by the first kind node After logically contiguous, the method, which is also embodied, to include the following contents: detecting the abscissa of the first kind node Whether it is equal to the uniline and indicates parameter;It is not equal to the feelings of uniline instruction parameter in the abscissa of the first kind node Under condition, a plurality of parallel link to be connected is generated by start node of the processing logic of the first kind node.
Whether the subsequent task node logically contiguous with the processing of current task node can be determined by aforesaid operations It is point of interface, i.e., whether is the end point of uniline link where current task node, and where is simultaneously the task node The starting point of parallel link.After determining that the node is point of interface, such as point Z, a step can be carried out and determine that Z contains for subsequent packet The starting point in the parallel area of a plurality of parallel-chain, and a plurality of parallel-chain to be connected is generated by start node of the processing logic of node Road can be logically connected to the processing of corresponding task node in above-mentioned parallel link so that machine is subsequent.
In the present embodiment, above-mentioned a plurality of parallel link includes at least two parallel links.Certainly, on when specific implementation State other numerical value that the item number in a plurality of parallel link is also possible to be greater than 2, such as 3,4 etc..In this regard, the application does not limit It is fixed.
In the present embodiment, article number of a plurality of parallel link in above-mentioned same parallel area specifically can be according to described The processing logic of one type node and/or for the first kind node data processing parameters determine.It usually can basis The quantity for the data result that the processing logic of first kind node obtains determines the item number of a plurality of parallel link.Wherein, above-mentioned What the quantity for the data result that the processing logic of one type node obtains can be that user is previously set is documented in for the first kind Data in the data processing parameters of type node, for example, user sets shearing number of segment as 3, to be limited at point Z in point Z in advance Shear treatment logic obtained when being sheared to video three sections of video datas to get to 3 data as a result, can determine in turn by Point Z is 3 as the item number of the parallel link of the generation of start node.Further, it is also possible to be patrolled according to the processing of first kind node Volume task type itself determines the quantity for the data result that the processing logic of first kind node obtains.For example, the processing of point Z Task type corresponding to logic is mirror image pending data, i.e., can only obtain two data of data of former data and mirror image As a result, at this moment can determine that by point Z be 2 as the item number of the parallel link of the generation of start node.
In the present embodiment, specific real when the processing logic for determining current task node is not located at uniline link Shi Shi can carry out subsequent detection judgement in the following way, with determine current task node whether the section in parallel link The subsequent task node of point and current task node.
S1: in the case where the abscissa of the current task node is not equal to uniline instruction parameter, described in determination The processing logic of current task node is located in parallel link.
S2: it detects in the task flow with the presence or absence of Second Type node, wherein the ordinate of the Second Type node The difference for subtracting the ordinate of the current task node is equal to preset threshold, and the abscissa of the Second Type node is equal to described The abscissa of current task node.
S3: there are in the case where the Second Type node in determining the task flow, the current task section is determined There is also subsequent task nodes for the locating parallel link of point, and will be current described in the processing logical AND of the Second Type node The processing of task node is logically contiguous.
In the present embodiment, above-mentioned Second Type node, which specifically can be used for characterizing being located in parallel link, works as predecessor The subsequent task node of business node.Similar to the subsequent task section for determining the current task node being located in uniline link Point, it is pre- for can detecte the difference of the ordinate value in remaining task node with the presence or absence of ordinate value and current task node If threshold value (such as 1), and coordinate value task node identical with the abscissa of current task node, i.e. Second Type node.The Two type nodes and current task node be in the same parallel link in a plurality of parallel link, therefore can be by second The processing of the processing logical AND current task node of type node is logically contiguous.
For example, the position coordinates of such as current task node P be (3,5), it can judge P be number be 3 and Execution sequence in line link, and in the longitudinal direction is the 5th batch.And then it can detecte whether to have in remaining task node and meet The point of Second Type node diagnostic.Such as detecting task node U, position coordinates are (3,6).Due to the abscissa and P of U Abscissa is identical, therefore point U and point P are located in the parallel link that same number is 3.Again since the ordinate of U subtracts the vertical of P The difference of coordinate is 1 (i.e. preset threshold), can determine that U is the subsequent task node of the P in same parallel link, in turn The processing that the processing logical AND of U can be located to the P in the parallel link that number is 3 is logically contiguous.
In the present embodiment it should be noted that if current task node is the start node in parallel area, such as appoint It is engaged in node V (Isosorbide-5-Nitrae), since the task node is No. 1 parallel link of a plurality of parallel link, No. 2 parallel links, No. 3 parallel links Common starting point.Therefore, even if the position coordinates of task node R are (2,5), the i.e. abscissa with point V in No. 2 parallel links It is unequal, but since point V is the start node in the parallel area including No. 2 parallel links, in processing, machine can decision-point V It also is located at same parallel link, i.e. No. 2 chain roads with point R, and the processing of the processing logical AND point V of point R is logically contiguous.
In the present embodiment, it should be noted that if detect the ordinate of ordinate and current task node Difference is preset threshold, but when the abscissa to be determined task node different from the abscissa of current task node, can be carried out Further judgement: whether the abscissa for detecting task node to be determined is equal to uniline instruction parameter;Determining task section to be determined The abscissa of point can determine that point to be determined is current task node equal to (such as point O (0,6)) in the case of uniline instruction parameter The gathering node of a plurality of parallel link at place, it is understood that for task node to be determined be each item in a plurality of parallel link The end of parallel link, then can be logically contiguous by the processing of the processing logical AND current task node of node to be determined.? Determine that the abscissa of task node to be determined is equal to uniline and indicates parameter, and the situation different from the abscissa of current task node Under (such as point T (2,6)), it can determine that the task node is positioned at parallel not with the parallel link where current task node With the task node of next execution sequence batch of chain road, at this moment machine will not be by the processing logical AND of the node as predecessor The processing of business node is logically contiguous.
In the present embodiment, the processing logic of the subsequent task node of current task node in parallel link has been connected Afterwards, can judge whether each parallel link connects respectively further according to following manner to finish, if all parallel links All connection finishes, can be logically contiguous with the processing of gathering node respectively by a plurality of parallel link in parallel area, to close simultaneously Row area.Particularly, may include the following contents:
S1: in the case where the Second Type node is not present in determining the task flow, the current task is determined Subsequent task node is not present in parallel link locating for node.
S2: in the case where determining that subsequent task node is not present in parallel link locating for the current task node, Determine whether is other parallel links in a plurality of parallel link in addition to the parallel link locating for the current task node There are subsequent task nodes.
S3: other in determining a plurality of parallel link in addition to the parallel link locating for the current task node In the case that subsequent task node is not present in parallel link, detects and whether there is third type node in the task flow, In, the abscissa of the third type node is equal to the uniline and indicates parameter, and the ordinate of the third type node subtracts The difference of the maximum value of ordinate is equal to the preset threshold in multiple tasks node in a plurality of parallel link.
S4: by the processing logic of the third type node respectively with each parallel link in a plurality of parallel link In the maximum task node of ordinate processing it is logically contiguous.
In the present embodiment, above-mentioned third type node specifically can be used to indicate that terminate in parallel area each item simultaneously The gathering node of line link.Refer to the presence or absence of abscissa equal to uniline when it is implemented, can detecte in remaining task node Show parameter, and the difference of ordinate maximum value is equal to the node of preset threshold as receipts in task node in ordinate and multilink Hold together node.
For example, there are 3 parallel links in a certain parallel area, wherein successively include on longitudinal direction in No. 1 parallel link Following task node: A (1,3), B (Isosorbide-5-Nitrae), C (1,5);It successively include following task node: W on longitudinal direction in No. 2 parallel links (2,3), T (2,4);It successively include following task node R (3,3) on longitudinal direction in No. 3 parallel links.At this moment above-mentioned a plurality of parallel-chain In task node in ordinate maximum value be 5, at this moment detect point F position coordinates be (0,6), due to the abscissa of F Equal to 0 (i.e. uniline instruction parameter), and ordinate meets the maximum value for subtracting ordinate in the task node in a plurality of parallel-chain (5) difference is 1 (preset threshold), can determine that F is the gathering node of a plurality of parallel-chain in the parallel area, i.e. F be respectively No. 1 simultaneously The end node of row chain, No. 2 parallel-chains, No. 3 parallel-chains, the above-mentioned a plurality of parallel-chain of the processing logical AND of F can be respectively connected with, To close parallel area.
In the manner described above, it can make machine automatically without manually participating in successively to each task node Recognition detection is carried out, the corresponding connection of the processing logic of each task order is sequentially completed, is combined, is obtained by connection Finally meet the data processing module of user's requirement.
Therefore the generation method of data processing module provided herein, it avoids existing method and was implementing To the dependence of people in journey, but first determine that machine can be known by the task execution sequence chart using characterization task stream information Not, judge task node task type mark, task node position coordinates;Again by machine using above-mentioned data as knowledge Not, judgment basis voluntarily calls corresponding processing logic to be combined, to generate required data processing module, to solve Efficiency of the practice present in existing method is low, waste of manpower resource, is easy to appear the problem of error, reach can efficiently, Accurately, the purpose of data processing module is automatically generated.
In a concrete application scene, it can wish to provide for real by data processing platform (DPP) refering to Fig. 4, user A The data processing module of existing a variety of preset tasks, the server of data processing platform (DPP) receive the instruction information of user A transmission.Its In the flow chart of data processing of task flow set by user or setting is carried in above-mentioned instruction information.Server is according to above-mentioned finger Show acquisition of information task execution sequence chart, wherein the task execution sequence chart for characterize in task flow each task node it Between the task type for executing sequence, task node.Further server parses task execution sequence chart, is appointed with obtaining Business stream in each task node task type mark, each task node position coordinates.Into server can according to really The task type mark of the fixed task node can identify, judged is adjusted from the preset processing logical base of data processing platform (DPP) With the processing logic of the task node, wherein be stored with multiple processing logics, and one in the preset processing logical base A kind of task type mark of logical AND is handled to correspond to.Wherein, above-mentioned processing logical base specifically can be that be set to data processing flat In the peripheral hardware storage equipment of platform, which can wirelessly be connected with the server of data processing platform (DPP), this Sample server can according to need the processing logic for calling task node at any time.Can with as shown in fig.5, server according to number Task type for 3 task node identifies " B ", determines that the data processing task of task node is the task of B type, Jin Erke To call the processing logic B in processing logical base for realizing B type tasks.Meanwhile server can also be according to the task The position coordinates of node on this basis successively detect each task node in task flow, are analyzed, successively connected respectively The processing logic of the task node is connect, to generate the data processing module.Using No. 1 task node as current task section The position coordinates of point, the task node (hereinafter referred to as No. 1 node) that first detection number is 1 are (0,1), due to the task node Abscissa is equal to uniline and indicates parameter 0, can determine that No. 1 node is located in single continuous chain.It is in detecting remaining task node The difference of the no ordinate that No. 1 node is subtracted there are ordinate is the node of 1 (i.e. preset threshold).It is searched for by detection, discovery is compiled Number meet above-mentioned condition for the position coordinates (0,2) of 2 task node (referred to as No. 2 nodes), No. 2 nodes are determined as No. 1 section The first kind node of point, i.e., the subsequent task node of No. 1 node, by the processing of processing No. 1 node of logical AND of No. 2 nodes It is logically contiguous, complete the connection about No. 1 node.Again using No. 2 nodes as current task node, volume is found in the same fashion Number for 3 subsequent task node of the task node as No. 2 nodes, and by the place of processing No. 2 nodes of logical AND of No. 3 nodes It manages logically contiguous.Again since the position coordinates of No. 3 nodes are (1,3), abscissa indicates parameter not equal to uniline, it is known that No. 3 sections Point is the separation between single continuous chain and parallel area.That is No. 3 nodes are the end of uniline link where No. 1 node, No. 2 nodes Node, and be the start node of a plurality of parallel link in parallel area.Again according to the data processing of the task type for No. 3 nodes Parameter, it is known that two result datas can be generated after the processing of the task of No. 3 nodes in No. 3 nodes.Therefore, computer is saved with No. 3 Point is the start node of parallel area's parallel link, and two parallel links to be connected are established from No. 3 nodes.Again with No. 3 nodes For current task node, the task node that two nodes number the task node for being 4.1, number is 4.2 is detected the presence of The difference that ordinate subtracts the ordinate of No. 3 nodes is 1.Wherein, the position coordinates of No. 4.1 nodes can be expressed as (Isosorbide-5-Nitrae), The position coordinates of No. 4.2 nodes can be expressed as (2,4).Due to the abscissa phase of the abscissa and No. 3 nodes of No. 4.1 nodes Deng, it is clear that it can determine that No. 4.1 nodes are subsequent in same parallel link (i.e. No. 1 parallel task chain) with No. 3 nodes Task node.It is also contemplated that No. 3 nodes are the start node in parallel area, in the start node that current task node is parallel area In the case of, although the difference of the abscissa of No. 4.2 nodes and No. 3 nodes, it can still determine No. 4.2 nodes and No. 3 nodes Positioned at same parallel link (i.e. No. 2 parallel links).So as to by the processing logic of No. 4.1 nodes in No. 1 parallel link It is logically contiguous with the processing of No. 3 nodes, by the processing logic of processing No. 3 nodes of logical AND of No. 4.2 nodes in No. 2 parallel links It is connected.Then can be first using No. 4.1 task nodes as current task node, the detection search 4.1 in remaining task node The Second Type node of node, i.e. abscissa are identical as the abscissa of No. 4.1 nodes, and ordinate subtracts the vertical seat of No. 4.1 nodes It is designated as 1 node.It can determine that position coordinates be No. 5.1 nodes of (1,5) are that No. 4.1 nodes are same by detecting position coordinates Subsequent task node in parallel link, and then can be by the processing logic of processing No. 4.1 nodes of logical AND of No. 5.1 nodes It is connected.In the same way, No. 5.2 nodes of Second Type node of No. 4.2 nodes can be determined, and by No. 5.2 nodes Processing No. 4.2 nodes of logical AND processing it is logically contiguous.Again using No. 5.2 nodes as current task node, detect whether also to deposit In the subsequent task node (the Second Type node of i.e. No. 5.2 nodes) being located in same parallel link with No. 5.2 nodes, Determine that there is no may determine that No. 1 parallel link will enter when above-mentioned Second Type node to collapse.Equally, in the same fashion It can determine that No. 2 parallel links will also enter to collapse.And then it can be remaining according to No. 5.1 nodes and/or No. 5.2 nodal tests It whether there is third type node in task node, wherein the abscissa of the third type node is indicated equal to the uniline Parameter, the ordinate of the third type node subtract in the multiple tasks node in a plurality of parallel link ordinate most The difference being worth greatly is equal to the preset threshold 1.It is that (0,6) meets above-mentioned want by the node location coordinate that detection discovery number is 6 Ask, be the gathering point of No. 1 parallel link and No. 2 parallel links, therefore, can by the processing logic of No. 6 nodes respectively with No. 5.1 The processing logic of node, the processing of No. 5.2 nodes are logically contiguous.Again using No. 6 nodes as current task node, detect whether also There are the first kind node, Second Type node of No. 6 nodes, when determining not only without the first kind node of No. 6 nodes, but also does not have In the case where the Second Type node of No. 6 nodes, no subsequent task node after No. 6 nodes is determined.In this way according to above-mentioned Mode does not need to participate in quickly and accurately generating being able to achieve a variety of different tasks by artificial, more complicated number According to processing module.
In one embodiment, the position coordinates of the task node can specifically include abscissa and ordinate, In, for the ordinate for characterizing the longitudinal execution ordinal characteristics of the task node, the abscissa is described for characterizing Concurrent Feature in the transverse direction of link where task node.It in this way can be more smart by the position coordinates of above-mentioned task node Carefully depict specific execution position of the task node in task flow.In addition, characterizing task using abscissa and ordinate The processing logic of node executes sequence, easily facilitates the identification, reading, judgement of machine, helps to rely only at machine realization Manage the combination of logic.
In one embodiment, above-mentioned according to the task type of task node mark, the position of the task node Set coordinate, the processing logic of combined task node, when it is implemented, may include: according to the position coordinates of the task node, The processing logic of the task node is connected, to generate the data processing module.It can recognize judgement due to having parsed machine Position coordinates, and then can enable machine using the position coordinates of above-mentioned task node as according to it is automatic realize it is corresponding The connection of the processing logic of task node, so that combination obtains required data processing module.
In one embodiment, according to the position coordinates of the task node, the processing for connecting the task node is patrolled Volume, to generate the data processing module, when it is implemented, may include the following contents: the horizontal seat of detection current task node Whether mark is equal to uniline instruction parameter (for example, 0);It is equal to the uniline in the abscissa of the current task node and indicates parameter In the case where, determine that the processing logic of the current task node is located in single continuous chain road;It detects in the task flow and whether deposits In first kind node, wherein the ordinate of the first kind node subtracts the difference of the ordinate of the current task node Value is equal to preset threshold (for example, 1);There are in the case where the first kind node in determining the task flow, institute is determined Stating uniline link locating for current task node, (first kind node is current task node there is also subsequent task node Subsequent task node), and by the first kind node processing logical AND described in current task node processing logic It is connected.The connection about current task node can be completed in this way.In the present embodiment, if detection is in current task node When above-mentioned first kind node being not present in locating single continuous chain, it can be determined that current task node has not had in single continuous chain Subsequent task node can then determine that current task node is the end node of single continuous chain, and due to not subsequent Task node, which can determine, has been completed all connections, i.e., to generate required data processing module.
In the present embodiment, the numerical value of above-mentioned uniline instruction parameter can be set to 0.Correspondingly, above-mentioned detection is as predecessor Whether the abscissa of business node is equal to uniline instruction parameter, may include: that the abscissa of current task node is made comparisons with 0. If the abscissa of current task node is equal to 0, it may determine that the processing logic of current task node is located at single continuous chain road In.Certainly, it should be noted that above-mentioned cited uniline instruction parameter is that one kind schematically illustrates.When it is implemented, also Can as the case may be and require, use other numerical value as above-mentioned uniline indicate parameter.In this regard, the application is not construed as limiting.
In addition, it is different according to the mode for establishing task execution sequence chart, be in the processing logic of detection current task node No is that can be combined with the mode of task execution sequence chart, such as the cross of setting task node during being located at uniline link Whether the specific rules of coordinate are to be located in uniline link to detect to current task node using other suitable modes. For example, if the rule of use is by the horizontal seat of the task node in uniline link when establishing task execution sequence chart Mark empties.At this moment, whether the processing logic for detecting current task order is located in uniline link, may include: detection as predecessor Whether the abscissa of business node is empty;In the case where it is empty for determining the abscissa of the current task node, it can be determined that when The processing logic of preceding task node is located in the uniline link.
In one embodiment, the place of the current task node described in the processing logical AND by the first kind node Manage it is logically contiguous after, the method be embodied when can also include the following contents: detect the horizontal seat of the first kind node Whether mark, which is equal to the uniline, indicates parameter;Parameter is indicated not equal to the uniline in the abscissa of the first kind node In the case of, a plurality of parallel link to be connected is generated by start node of the processing logic of the first kind node.Wherein, institute The item number of a plurality of parallel link is stated according to the processing logic of the first kind node and/or for the first kind node Data processing parameters determination etc..At this moment, it can determine that the task node is the point of interface of single continuous chain and parallel-chain.I.e. the node is It is the end node of a upper single continuous chain, and is the start node of each parallel-chain in subsequent a plurality of parallel-chain.
In one embodiment, after whether the abscissa of detection current task node is equal to uniline instruction parameter, institute Method is stated when it is implemented, can also include the following contents: being not equal to the uniline in the abscissa of the current task node In the case where indicating parameter, determine that the processing logic of the current task node is located in parallel link;Detect the task flow In whether there is Second Type node, wherein the ordinate of the Second Type node subtracts the vertical of the current task node The difference of coordinate is equal to preset threshold, and the abscissa of the Second Type node is equal to the abscissa of the current task node;? It determines in the task flow there are in the case where the Second Type node, determines parallel-chain locating for the current task node There is also subsequent task node (the subsequent task nodes that Second Type node is current task node) on road, and will be described The processing of current task node described in the processing logical AND of Second Type node is logically contiguous.
In one embodiment, with the presence or absence of after Second Type node in detecting the task flow, the method has Body can also include the following contents when implementing: in the case where the Second Type node is not present in determining the task flow, Determining parallel link locating for the current task node, there is no subsequent task nodes;Determining the current task node In the case that subsequent task node is not present in locating parallel link, determine in a plurality of parallel link except described as predecessor Other parallel links other than parallel link locating for business node whether there is subsequent task node;Determine it is described it is a plurality of simultaneously Subsequent task section is not present in other parallel links in line link in addition to the parallel link locating for the current task node In the case where point, detect in the task flow with the presence or absence of third type node (i.e. gathering point), wherein the third type section The abscissa of point is equal to the uniline and indicates parameter, and the ordinate of the third type node subtracts in a plurality of parallel link Multiple tasks node in ordinate maximum value difference be equal to the preset threshold;The processing of the third type node is patrolled Collect the processing logic phase with the maximum task node of ordinate in each parallel link in a plurality of parallel link respectively Even.
In one embodiment, it is sat according to the position of the task type of task node mark, the task node Mark, calls the processing logic of task node, when it is implemented, may include the following contents: according to the task of the task node Type identification calls the processing logic of the task node from preset processing logical base, wherein the preset processing is patrolled It collects and is stored with multiple processing logics in library, and a kind of task type mark of a processing logical AND corresponds to.In this city embodiment In, above-mentioned task type mark specifically can be specific character string, wherein the character string can serve to indicate that a certain processing is patrolled Volume, it can and a certain processing is logically present one-to-one relationship.It can be identified by task type in this way from processing logic Corresponding processing logic is found to be called in library.
In the present embodiment, above-mentioned processing logic specifically can be understood as a kind of certain concrete type that can be realized The program structure body of processing task.Wherein, each above-mentioned processing logic is corresponding with a kind of task type respectively, passes through one The kitchen tools processing of corresponding task type may be implemented in processing logic.Furthermore, it is necessary to which it is emphasised that above-mentioned processing logic has Body can be the backstage for being prepared in advance and being stored in data processing platform (DPP) (for example, being stored in the server of data processing platform (DPP) In) for calling the program structure body of operation at any time.Also, above-mentioned processing logic is mutually indepedent between each other, is independent of each other, can To be individually combined, run so as to subsequent by server calls as needed.So in the specific implementation, machine can will be more The processing logic of kind task type prepares into independent program structure body in advance, so as at the data that combination meets different requirements When managing module, the program structure body having had been prepared for can be called directly, realizes corresponding task without regrouping again Program, existing program structure body before then may be reused improve so as to reduce the waste to resource, manpower Efficiency of the practice.
In one embodiment, above-mentioned data processing module specifically can be used for carrying out at least one of lower data Corresponding data processing: image data, voice data, video data, operational data, lteral data etc..Certainly, it needs to illustrate Be that above-mentioned cited data type is intended merely to better illustrate the application embodiment.When it is implemented, can also incite somebody to action The generation method expansion of data processing module provided by the present application is carried forward into the processing for other types data.For example, also The generation method of the data processing module can be promoted, to generate at the identity data for carrying out identity data verifying Manage module.
In the present embodiment, above-mentioned data processing module, which specifically can be understood as one kind, can satisfy user's requirement, According to flow chart of data processing set by user or task flow data to be processed are carried out with the execution of multiple-task processing in order Unit.Above-mentioned data processing module is further also understood that the combination that logic is handled for multiple-task.
In one embodiment, above-mentioned task execution sequence chart can specifically obtain in the following way: acquisition user The instruction information of input, wherein the instruction information of user's input carries flow chart of data processing (i.e. user set by user The task flow of setting);The instruction information is parsed, to obtain flow chart of data processing set by user;It is set further according to the user Fixed flow chart of data processing generates corresponding task execution sequence chart.Wherein, the instruction information of above-mentioned acquisition user input is specific It may include: the data for acquiring user and being inserted in specified definition template;And/or acquisition user's needle in specified interface To the operation data of icon, the icon is directed toward the processing logic etc. of corresponding task type.For how to acquire user's input Indicate that information, the application are not construed as limiting.
In one embodiment, after establishing above-mentioned data processing module, the server of data processing platform (DPP) can be with The user interface of the data processing module is supplied to user to use, so that user oneself can use data by user interface Processing module completes corresponding data processing;The server for being also possible to data processing platform (DPP) is voluntarily run at established data Reason module carries out data processing to the pending data that user provides, and the result after data processing is fed back to user.
In one embodiment, it is carried out specific according to the task type of task node mark, described in machine The position coordinates of task node call the processing logic of simultaneously combined task node, to generate the data for carrying out data processing When processing module, can by control machine in control unit (master) and execution unit (worker) assist complete specifically Combination connection.Can be refering to Fig. 6, and content as shown in connection with fig. 3, specifically, control unit can be according to by task execution sequence The type identification of task node, the position coordinates of task node that column diagram separates out determine the calling of each task node logic The order of connection, then in order some task node corresponding will be called connection task to give execution unit specifically to execute.And An implementing result can be returned after the connection of the every processing logic for completing a task node of execution unit to control unit, such as Successful connection or connection failure, then the implementing result and remaining untreated task that are returned by execution unit combination execution unit Type identification, the position coordinates of node distribute the connection work of new task node to execution unit.To be sequentially completed institute There is the connection of the processing logic of task node, finally combination is satisfied the data processing module of requirement.
Therefore the generation method of data processing module provided herein, it avoids existing method and was implementing To the dependence of people in journey, but first determine that machine can be known by the task execution sequence chart using characterization task stream information Not, judge task node task type mark, task node position coordinates;Again by machine using above-mentioned data as knowledge Not, judgment basis voluntarily calls corresponding processing logic to be combined, to generate required data processing module, to solve Efficiency of the practice present in existing method is low, waste of manpower resource, is easy to appear the problem of error, reach can efficiently, Accurately, the purpose of data processing module is automatically generated.
Embodiment further provides a kind of generation methods of video data processing module by the application, refering to Fig. 7, this method tool May include the following contents when body is implemented:
S71: task flow characterize data is obtained, wherein the task flow characterize data is for characterizing each task in task flow The task type for executing sequence, task node between node.
S72: according to the task flow characterize data, determine the task node in the task flow task type mark, The position coordinates of task node.
S73: it according to the task type of task node mark, the position coordinates of the task node, calls and combines The processing logic of task node, to generate the data processing module for carrying out data processing.
In one embodiment, the task flow characterize data can specifically include in data set forth below at least it One: two-dimensional array, chart data, preset characters string etc..Certainly, it should be noted that above-mentioned cited task flow characterizes number According to being intended merely to that the application embodiment is better described.The improper restriction to the application embodiment should not be constituted.Specifically When implementation, other suitable categorical datas can also be introduced as above-mentioned task flow characterize data as the case may be.In this regard, The application is not construed as limiting.
In one embodiment, it is contemplated that two-dimensional array is inherently with position coordinates, the word of task type mark Symbol string, therefore, distinguishes other data, in the case where the task flow characterize data is two-dimensional array, is obtaining task flow table After levying data, the method is not when it is implemented, need to be parsed again in the following way, directly from the two-dimensional array The position coordinates of the task type mark, task node of extracting the task node in the task flow can when so as to subsequent implementation According to the position coordinates of the task type of task node mark, the task node, to call and combined task node Logic is handled, to generate the data processing module for carrying out data processing.So as to avoid to task flow characterize data Parsing, further improve efficiency of the practice.
In one embodiment, above-mentioned task flow characterize data can specifically obtain in the following way: acquisition user The instruction information of input, wherein the instruction information of user's input carries task flow set by user;Parse the instruction Information, to obtain task flow set by user;Corresponding task flow, which is generated, further according to the task flow set by user characterizes number According to.Wherein, the instruction information of above-mentioned acquisition user input can specifically include: acquisition user inserts in specified definition template Data;And/or acquisition user is directed to the operation data of icon in specified interface, the icon is directed toward corresponding task class Processing logic of type etc..For how to acquire the instruction information of user's input, the application is not construed as limiting.
Therefore the generation method of data processing module provided herein, it avoids existing method and was implementing To the dependence of people in journey, but first determine that machine can be known by the task flow characterize data using characterization task stream information Not, judge task node task type mark, task node position coordinates;Again by machine using above-mentioned data as knowledge Not, judgment basis voluntarily calls corresponding processing logic to be combined, to generate required data processing module, to solve Efficiency of the practice present in existing method is low, waste of manpower resource, is easy to appear the problem of error, reach can efficiently, Accurately, the purpose of data processing module is automatically generated;Also by directly characterizing number using two-dimensional array as above-mentioned task flow According to, avoid the parsing to task flow characterize data, so as to directly extract task node task type mark, task The position coordinates of node, further improve efficiency of the practice.
The application it is above-mentioned provided by data processing module generation method embodiment can server, client or It is executed in similar arithmetic unit.
It is the generation of the data processing module proposed using application embodiment refering to Fig. 8 for running on the server The hardware block diagram of the server of method.As shown in figure 8, server may include one or more (only showing one in figure) (processor 802 can include but is not limited to the processing dress of Micro-processor MCV or programmable logic device FPGA etc. to processor 802 Set), memory 803 for storing data and the network communication interface 801 for communication function.Ordinary skill Personnel are appreciated that structure shown in Fig. 8 is only to illustrate, and do not cause to limit to the structure of above-mentioned electronic device.For example, clothes Business device may also include than shown in Fig. 8 more perhaps less component or with the configuration different from shown in Fig. 8.
Wherein, memory 803 can be used for storing the software program and module of application software, in the embodiment of the present invention Corresponding program instruction/the module of method for exhibiting data, the software program that processor 802 is stored in memory 803 by operation And module realizes the method for exhibiting data of above-mentioned application program thereby executing various function application and data processing. Memory 803 may include high speed random access memory, may also include nonvolatile memory, as one or more magnetic storage fills It sets, flash memory or other non-volatile solid state memories.In some instances, memory 803 can further comprise relative to place The remotely located memory of device 802 is managed, these remote memories can pass through network connection to server.The example of above-mentioned network Including but not limited to internet, intranet, local area network, mobile radio communication and combinations thereof.
Network communication interface 801 is used to that data to be received or sent via a network.Above-mentioned network specific example can The wireless network that communication providers including server provide.In an example, network communication interface 801 includes a network Adapter (Network Interface Controller, NIC), can be connected by base station with other network equipments so as to It is communicated with internet.In an example, network communication interface 801 can be radio frequency (Radio Frequency, RF) mould Block is used to wirelessly be communicated with internet.
When it is implemented, network communication interface 801 described above, processor 802, memory 803 pass through Internal cable phase Even to carry out specific data interaction.The network communication interface 801 specifically can be used for obtaining task execution sequence chart, In, the task execution sequence chart executes sequence, the task of task node between each task node for characterizing in task flow Type;The processor 802 specifically can be used for parsing the task execution sequence chart, to obtain appointing in the task flow Be engaged in node task type mark, task node position coordinates;According to the task type of task node mark, described The position coordinates of business node, call the processing logic of simultaneously combined task node, to generate at the data for carrying out data processing Manage module;The memory 803 specifically can be used for storing the processing logic of the task node.
A kind of computer storage of generation method based on data processing module is additionally provided in this theory application embodiment Medium, the computer storage medium are stored with computer program instructions, are performed realization in the computer program instructions: Obtain task execution sequence chart, wherein the task execution sequence chart is for characterizing holding between each task node in task flow The task type of row sequence, task node;The task execution sequence chart is parsed, to obtain the task node in the task flow Task type mark, task node position coordinates;According to the task type of task node mark, the task node Position coordinates, call and combined task node processing logic, to generate the data processing module for carrying out data processing.
In the present embodiment, above-mentioned storage medium includes but is not limited to random access memory (Random Access Memory, RAM), read-only memory (Read-Only Memory, ROM), caching (Cache), hard disk (Hard DiskDrive, ) or storage card (Memory Card) HDD.The memory can be used for storing computer program instructions.Network communication unit It can be according to standard setting as defined in communication protocol, for carrying out the interface of network connection communication.
In the present embodiment, the function and effect of the program instruction specific implementation of computer storage medium storage, can To compare explanation with other embodiment, details are not described herein.
Although this application provides the method operating procedure as described in embodiment or flow chart, based on conventional or noninvasive The labour for the property made may include more or less operating procedure.The step of enumerating in embodiment sequence is only numerous steps One of execution sequence mode, does not represent and unique executes sequence.It, can when device or client production in practice executes To execute or parallel execute (such as at parallel processor or multithreading according to embodiment or method shown in the drawings sequence The environment of reason).
The device or module that above-described embodiment illustrates can specifically realize by computer chip or entity, or by having The product of certain function is realized.For convenience of description, it is divided into various modules when description apparatus above with function to describe respectively. The function of each module can be realized in the same or multiple software and or hardware when implementing the application.It is of course also possible to Realization the module for realizing certain function is combined by multiple submodule or subelement.
Method, apparatus or module described herein can realize that controller is pressed in a manner of computer readable program code Any mode appropriate is realized, for example, controller can take such as microprocessor or processor and storage can be by (micro-) The computer-readable medium of computer readable program code (such as software or firmware) that processor executes, logic gate, switch, specially With integrated circuit (Application Specific Integrated Circuit, ASIC), programmable logic controller (PLC) and embedding Enter the form of microcontroller, the example of controller includes but is not limited to following microcontroller: ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20 and Silicone Labs C8051F320, Memory Controller are also implemented as depositing A part of the control logic of reservoir.It is also known in the art that in addition to real in a manner of pure computer readable program code Other than existing controller, completely can by by method and step carry out programming in logic come so that controller with logic gate, switch, dedicated The form of integrated circuit, programmable logic controller (PLC) and insertion microcontroller etc. realizes identical function.Therefore this controller It is considered a kind of hardware component, and hardware can also be considered as to the device for realizing various functions that its inside includes Structure in component.Or even, it can will be considered as the software either implementation method for realizing the device of various functions Module can be the structure in hardware component again.
Part of module in herein described device can be in the general of computer executable instructions Upper and lower described in the text, such as program module.Generally, program module includes executing particular task or realization specific abstract data class The routine of type, programs, objects, component, data structure, class etc..The application can also be practiced in a distributed computing environment, In these distributed computing environment, by executing task by the connected remote processing devices of communication network.In distribution It calculates in environment, program module can be located in the local and remote computer storage media including storage equipment.
As seen through the above description of the embodiments, those skilled in the art can be understood that the application can It is realized by the mode of software plus required hardware.Based on this understanding, the technical solution of the application is substantially in other words The part that contributes to existing technology can be embodied in the form of software products, and can also pass through the implementation of Data Migration It embodies in the process.The computer software product can store in storage medium, such as ROM/RAM, magnetic disk, CD, packet Some instructions are included to use so that a computer equipment (can be personal computer, mobile terminal, server or network are set It is standby etc.) execute method described in certain parts of each embodiment of the application or embodiment.
Each embodiment in this specification is described in a progressive manner, the same or similar portion between each embodiment Dividing may refer to each other, and each embodiment focuses on the differences from other embodiments.The whole of the application or Person part can be used in numerous general or special purpose computing system environments or configuration.Such as: personal computer, server calculate Machine, handheld device or portable device, mobile communication terminal, multicomputer system, based on microprocessor are at laptop device System, programmable electronic equipment, network PC, minicomputer, mainframe computer, the distribution including any of the above system or equipment Formula calculates environment etc..
Although depicting the application by embodiment, it will be appreciated by the skilled addressee that the application there are many deformation and Variation is without departing from spirit herein, it is desirable to which the attached claims include these deformations and change without departing from the application's Spirit.

Claims (15)

1. a kind of generation method of data processing module characterized by comprising
Obtain task execution sequence chart, wherein the task execution sequence chart is for characterizing in task flow between each task node The task type for executing sequence, task node;
The task execution sequence chart is parsed, to obtain task type mark, the task section of the task node in the task flow The position coordinates of point;
According to the task type of task node mark, the position coordinates of the task node, simultaneously combined task node is called Processing logic, to generate the data processing module for carrying out data processing.
2. the method according to claim 1, wherein the position coordinates of the task node include abscissa and indulge Coordinate, wherein the ordinate is used for table for characterizing the longitudinal execution ordinal characteristics of the task node, the abscissa Levy the Concurrent Feature in the transverse direction of the link where the task node.
3. according to the method described in claim 2, it is characterized in that, being identified according to the task type of the task node, being described The position coordinates of task node, the processing logic of combined task node, comprising:
According to the position coordinates of the task node, the processing logic of the task node is connected, to generate the data processing Module.
4. according to the method described in claim 3, it is characterized in that, according to the position coordinates of the task node, described in connection The processing logic of task node, to generate the data processing module, comprising:
Whether the abscissa of detection current task node is equal to uniline instruction parameter;
In the case where the abscissa of the current task node is equal to uniline instruction parameter, the current task section is determined The processing logic of point is located in single continuous chain road;
It detects in the task flow with the presence or absence of first kind node, wherein the ordinate of the first kind node subtracts institute The difference for stating the ordinate of current task node is equal to preset threshold;
There are in the case where the first kind node in determining the task flow, determine locating for the current task node There is also subsequent task nodes for uniline link, and by current task node described in the processing logical AND of the first kind node Processing it is logically contiguous.
5. according to the method described in claim 4, it is characterized in that, will be described in the processing logical AND of the first kind node After the processing of current task node is logically contiguous, the method also includes:
Whether the abscissa for detecting the first kind node is equal to the uniline instruction parameter;
In the case where the abscissa of the first kind node is not equal to uniline instruction parameter, with the first kind section The processing logic of point is that start node generates a plurality of parallel link to be connected.
6. according to the method described in claim 5, it is characterized in that, the item number of a plurality of parallel link is according to the first kind The processing logic of type node and/or for the first kind node data processing parameters determine.
7. according to the method described in claim 4, it is characterized in that, whether the abscissa in detection current task node is equal to list After row instruction parameter, the method also includes:
In the case where the abscissa of the current task node is not equal to uniline instruction parameter, the current task is determined The processing logic of node is located in parallel link;
It detects in the task flow with the presence or absence of Second Type node, wherein the ordinate of the Second Type node subtracts institute The difference for stating the ordinate of current task node is equal to preset threshold, and the abscissa of the Second Type node is equal to described as predecessor The abscissa of business node;
There are in the case where the Second Type node in determining the task flow, determine locating for the current task node There is also subsequent task nodes for parallel link, and by current task node described in the processing logical AND of the Second Type node Processing it is logically contiguous.
8. the method according to the description of claim 7 is characterized in that whether there is Second Type section in detecting the task flow After point, the method also includes:
In the case where the Second Type node is not present in determining the task flow, determine locating for the current task node Parallel link be not present subsequent task node;
In the case where determining that subsequent task node is not present in parallel link locating for the current task node, determine a plurality of Other parallel links in parallel link in addition to the parallel link locating for the current task node whether there is subsequent Business node;
Other parallel-chains in determining a plurality of parallel link in addition to the parallel link locating for the current task node In the case that subsequent task node is not present in road, detect in the task flow with the presence or absence of third type node, wherein described The abscissa of third type node is equal to the uniline and indicates parameter, and the ordinate of the third type node subtracts described a plurality of The difference of the maximum value of ordinate is equal to the preset threshold in multiple tasks node in parallel link;
By the processing logic of the third type node respectively with it is vertical in each parallel link in a plurality of parallel link The processing of the maximum task node of coordinate is logically contiguous.
9. the method according to claim 1, wherein being identified according to the task type of the task node, being described The position coordinates of task node call the processing logic of task node, comprising:
It is identified according to the task type of the task node, the processing of the task node is called from preset processing logical base Logic, wherein multiple processing logics, and an a kind of task class of processing logical AND are stored in the preset processing logical base Type mark corresponds to.
10. the method according to claim 1, wherein the data processing module be used for in lower data extremely Few a kind of carry out data processing: image data, voice data, video data, operational data, lteral data.
11. a kind of generation method of data processing module characterized by comprising
Obtain task flow characterize data, wherein the task flow characterize data is for characterizing in task flow between each task node The task type for executing sequence, task node;
According to the task flow characterize data, task type mark, the task node of the task node in the task flow are determined Position coordinates;
According to the task type of task node mark, the position coordinates of the task node, simultaneously combined task node is called Processing logic, to generate the data processing module for carrying out data processing.
12. according to the method for claim 11, which is characterized in that the task flow characterize data include it is following at least it One: two-dimensional array, chart data, preset characters string.
13. according to the method for claim 12, which is characterized in that in the feelings that the task flow characterize data is two-dimensional array Under condition, after obtaining task flow characterize data, which comprises
It is sat from the position of the task type of the task node extracted in the two-dimensional array in the task flow mark, task node Mark;
According to the task type of task node mark, the position coordinates of the task node, simultaneously combined task node is called Processing logic, to generate the data processing module for carrying out data processing.
14. a kind of server characterized by comprising network communication interface, memory and processor, in which:
The network communication interface, for obtaining task execution sequence chart, wherein the task execution sequence chart is appointed for characterizing The task type for executing sequence, task node in business stream between each task node;
The processor, for parsing the task execution sequence chart, to obtain the task of the task node in the task flow The position coordinates of type identification, task node;According to the task type of task node mark, the position of the task node Coordinate calls the processing logic of simultaneously combined task node, to generate the data processing module for carrying out data processing;
The memory, for storing the processing logic of the task node.
15. a kind of computer readable storage medium, which is characterized in that be stored thereon with computer instruction, described instruction is performed The step of Shi Shixian any one of claims 1 to 10 the method.
CN201810293377.9A 2018-03-30 2018-03-30 The generation method and server of data processing module Pending CN110321107A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810293377.9A CN110321107A (en) 2018-03-30 2018-03-30 The generation method and server of data processing module

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810293377.9A CN110321107A (en) 2018-03-30 2018-03-30 The generation method and server of data processing module

Publications (1)

Publication Number Publication Date
CN110321107A true CN110321107A (en) 2019-10-11

Family

ID=68112323

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810293377.9A Pending CN110321107A (en) 2018-03-30 2018-03-30 The generation method and server of data processing module

Country Status (1)

Country Link
CN (1) CN110321107A (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110767212A (en) * 2019-10-24 2020-02-07 百度在线网络技术(北京)有限公司 Voice processing method and device and electronic equipment
CN110928578A (en) * 2019-12-05 2020-03-27 潍柴动力股份有限公司 Data processing method, device and system
CN113360258A (en) * 2021-05-28 2021-09-07 北京百度网讯科技有限公司 Data processing method and device, electronic equipment and storage medium
CN114584802A (en) * 2020-11-30 2022-06-03 腾讯科技(深圳)有限公司 Multimedia processing method, device, medium and electronic equipment
CN117170690A (en) * 2023-11-02 2023-12-05 湖南三湘银行股份有限公司 Distributed component management system

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103019691A (en) * 2012-11-20 2013-04-03 北京思特奇信息技术股份有限公司 Transformation method for extract, transform and load (ETL) operation relation graph and implementation system thereof
WO2014022968A1 (en) * 2012-08-07 2014-02-13 华为技术有限公司 Media service processing method and media service system
CN103679401A (en) * 2013-12-31 2014-03-26 浙江中控研究院有限公司 Flow control method, server, client side and system
CN104461702A (en) * 2013-09-16 2015-03-25 腾讯科技(深圳)有限公司 Business processing method and business processing device
US20150200867A1 (en) * 2014-01-15 2015-07-16 Cisco Technology, Inc. Task scheduling using virtual clusters
CN105243521A (en) * 2015-11-20 2016-01-13 华润电力投资有限公司河南分公司 Workflow management method and system
CN105868190A (en) * 2015-01-19 2016-08-17 中国移动通信集团河北有限公司 Method and system for optimizing task processing in ETL
CN106897809A (en) * 2015-12-17 2017-06-27 北京奇虎科技有限公司 Workflow creation method, workflow designer and workflow system
CN106897806A (en) * 2015-12-17 2017-06-27 北京奇虎科技有限公司 Workflow creation method and system, operation system

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014022968A1 (en) * 2012-08-07 2014-02-13 华为技术有限公司 Media service processing method and media service system
CN103019691A (en) * 2012-11-20 2013-04-03 北京思特奇信息技术股份有限公司 Transformation method for extract, transform and load (ETL) operation relation graph and implementation system thereof
CN104461702A (en) * 2013-09-16 2015-03-25 腾讯科技(深圳)有限公司 Business processing method and business processing device
CN103679401A (en) * 2013-12-31 2014-03-26 浙江中控研究院有限公司 Flow control method, server, client side and system
US20150200867A1 (en) * 2014-01-15 2015-07-16 Cisco Technology, Inc. Task scheduling using virtual clusters
CN105868190A (en) * 2015-01-19 2016-08-17 中国移动通信集团河北有限公司 Method and system for optimizing task processing in ETL
CN105243521A (en) * 2015-11-20 2016-01-13 华润电力投资有限公司河南分公司 Workflow management method and system
CN106897809A (en) * 2015-12-17 2017-06-27 北京奇虎科技有限公司 Workflow creation method, workflow designer and workflow system
CN106897806A (en) * 2015-12-17 2017-06-27 北京奇虎科技有限公司 Workflow creation method and system, operation system

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110767212A (en) * 2019-10-24 2020-02-07 百度在线网络技术(北京)有限公司 Voice processing method and device and electronic equipment
CN110767212B (en) * 2019-10-24 2022-04-26 百度在线网络技术(北京)有限公司 Voice processing method and device and electronic equipment
CN110928578A (en) * 2019-12-05 2020-03-27 潍柴动力股份有限公司 Data processing method, device and system
CN114584802A (en) * 2020-11-30 2022-06-03 腾讯科技(深圳)有限公司 Multimedia processing method, device, medium and electronic equipment
CN114584802B (en) * 2020-11-30 2024-03-08 腾讯科技(深圳)有限公司 Multimedia processing method, device, medium and electronic equipment
CN113360258A (en) * 2021-05-28 2021-09-07 北京百度网讯科技有限公司 Data processing method and device, electronic equipment and storage medium
CN117170690A (en) * 2023-11-02 2023-12-05 湖南三湘银行股份有限公司 Distributed component management system
CN117170690B (en) * 2023-11-02 2024-03-22 湖南三湘银行股份有限公司 Distributed component management system

Similar Documents

Publication Publication Date Title
CN110321107A (en) The generation method and server of data processing module
CN110276456B (en) Auxiliary construction method, system, equipment and medium for machine learning model
CN106528613B (en) Intelligent answer method and device
CN104750737B (en) A kind of photograph album management method and device
CN109165249A (en) Data processing model construction method, device, server and user terminal
US10311115B2 (en) Object search method and apparatus
CN108875289B (en) Algorithm debugging method, client, background server and system
CN110321119A (en) The generation method of data processing module, server and client side
CN108898174A (en) A kind of contextual data acquisition method, contextual data acquisition device and electronic equipment
CN106022568A (en) Workflow processing method and apparatus
CN107741950A (en) Processing method, device, processor and the service end of data syn-chronization task
CN106227751A (en) A kind of scan method storing file and scanning device
CN111161804A (en) Query method and system for species genomics database
CN104463420B (en) The order processing system and method for OTA websites
CN111240669A (en) Interface generation method and device, electronic equipment and computer storage medium
CN111191503A (en) Pedestrian attribute identification method and device, storage medium and terminal
CN111008008A (en) Micro-service architecture-based application development method and system
CN110489242A (en) Distributed data calculation method, device, terminal device and storage medium
CN109693244A (en) The method and device of optimization dialogue robot
US20150178658A1 (en) Onboarding by Analyzing Practices of Best Hiring Managers
CN112286879B (en) Metadata-based data asset construction method and device
CN109885651A (en) A kind of question pushing method and device
CN113805886A (en) Page creating method, device and system, computer device and storage medium
CN106997363A (en) A kind of data processing method and equipment
CN106021316A (en) Core patent determination system and determination method

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
TA01 Transfer of patent application right

Effective date of registration: 20200518

Address after: 310052 room 508, floor 5, building 4, No. 699, Wangshang Road, Changhe street, Binjiang District, Hangzhou City, Zhejiang Province

Applicant after: Alibaba (China) Co.,Ltd.

Address before: 100080 Beijing Haidian District city Haidian street A Sinosteel International Plaza No. 8 block 5 layer A, C

Applicant before: Youku network technology (Beijing) Co., Ltd

TA01 Transfer of patent application right