CN110321210A

CN110321210A - Data processing method, device, computer-readable medium and electronic equipment

Info

Publication number: CN110321210A
Application number: CN201910576994.4A
Authority: CN
Inventors: 于思禹; 邓崇鑫
Original assignee: JD Digital Technology Holdings Co Ltd
Current assignee: JD Digital Technology Holdings Co Ltd
Priority date: 2019-06-28
Filing date: 2019-06-28
Publication date: 2019-10-11

Abstract

Present disclose provides a kind of data processing method, data processing equipment, computer-readable medium and electronic equipments, are related to field of computer technology.This method comprises: determining the current state of multiple previous nodes；Wherein, multiple previous nodes are corresponding with present node；When current state is dbjective state, the corresponding data file of processing present node；Wherein, multiple latter nodes are corresponding with present node for the corresponding data file of the multiple latter nodes of parallel processing.Data processing method in the disclosure can overcome the problems, such as that executing DAG by topological sorting sequence causes data-handling efficiency lower to a certain extent, and then by the corresponding data file of parallel processing node, promote data-handling efficiency.

Description

Data processing method, device, computer-readable medium and electronic equipment

Technical field

This disclosure relates to field of computer technology, in particular to a kind of data processing method, data processing equipment, Computer-readable medium and electronic equipment.

Background technique

Directed acyclic graph (Directed Acyclic Graph, DAG) is a kind of loop-free digraph, can be used for retouching State the implementation procedure of an engineering or system.If directed acyclic graph it can be appreciated that one kind can not from some node by Dry side returns to the digraph of the node.

In software application, it usually needs the data generated to user behavior are analyzed, before carrying out data analysis, Data processing is carried out to the initial data that user behavior generates usually using DAG, to obtain being convenient for the unification of data analysis The data of format.Specifically, terminal device or server generally use topological sorting sequence and execute DAG, that is, pass through topological sorting It is a daisy chaining by the node sequencing in DAG, and then executes the daisy chaining.But the more daisy chainings of number of nodes in DAG Then can be longer, also can be longer for the processing time of daisy chaining, can exist led by above topology collating sequence execution DAG in this way The problem for causing data-handling efficiency lower.

It should be noted that information is only used for reinforcing the reason to the background of the disclosure disclosed in above-mentioned background technology part Solution, therefore may include the information not constituted to the prior art known to persons of ordinary skill in the art.

Summary of the invention

The disclosure is designed to provide a kind of data processing method, data processing equipment, computer-readable medium and electricity Sub- equipment, and then overcome causes data-handling efficiency lower at least to a certain extent by topological sorting sequence execution DAG Problem, and then promote data-handling efficiency.

Other characteristics and advantages of the disclosure will be apparent from by the following detailed description, or partially by the disclosure Practice and acquistion.

The first aspect of the disclosure provides a kind of data processing method, comprising: determines the current shape of multiple previous nodes State；Wherein, multiple previous nodes are corresponding with present node；When current state is dbjective state, present node pair is handled The data file answered；Wherein, multiple latter nodes are and currently for the corresponding data file of the multiple latter nodes of parallel processing Node is corresponding.

In a kind of exemplary embodiment of the disclosure, the data processing method further include: according to the first rule file from Target directed acyclic graph is determined in multiple directed acyclic graphs；Wherein, target directed acyclic graph includes present node, the first rule It include the identification information of target directed acyclic graph in file.

In a kind of exemplary embodiment of the disclosure, the corresponding data file of processing present node, comprising: according to target The corresponding data file of the corresponding Second Rule file process present node of directed acyclic graph；Second Rule file includes working as prosthomere The processing rule of the corresponding data file of point.

In a kind of exemplary embodiment of the disclosure, Second Rule file further includes in target directed acyclic graph for table Show the node structure of node execution sequence.

In a kind of exemplary embodiment of the disclosure, the data processing method further include: before being determined according to node structure One node and latter node.

In a kind of exemplary embodiment of the disclosure, the data processing method further include: if it is determined that previous node For sky, then determine present node for first node；If it is determined that latter node be sky, then determine present node for tail node.

In a kind of exemplary embodiment of the disclosure, the data processing method further include: if monitoring Second Rule text The modification time of part changes, and is updated according to the corresponding modification content of modification time to Second Rule file.

In a kind of exemplary embodiment of the disclosure, the data processing method further include: to the Second Rule before update File and updated Second Rule file are stored.

According to the second aspect of the disclosure, a kind of data processing equipment, including status determining unit and data processing are provided Unit, in which: status determining unit, for determining the current state of multiple previous nodes；Wherein, multiple previous nodes with work as Front nodal point is corresponding；Data processing unit, for when the current state of multiple previous nodes is dbjective state, processing to be current The corresponding data file of node；Data processing unit is also used to the corresponding data file of the multiple latter nodes of parallel processing； Wherein, multiple latter nodes are corresponding with present node.

In a kind of exemplary embodiment of the disclosure, which can also include that directed acyclic graph determines list Member, in which: directed acyclic graph determination unit, for determining that target has from multiple directed acyclic graphs according to the first rule file To acyclic figure；Wherein, target directed acyclic graph includes present node, includes the mark of target directed acyclic graph in the first rule file Know information.

In a kind of exemplary embodiment of the disclosure, data processing unit handles the corresponding data file of present node Mode specifically: data processing unit is corresponding according to the corresponding Second Rule file process present node of target directed acyclic graph Data file；Second Rule file includes the processing rule of the corresponding data file of present node.

In a kind of exemplary embodiment of the disclosure, which can also include node determination unit, In: node determination unit, for determining previous node and latter node according to node structure.

In a kind of exemplary embodiment of the disclosure, which can also include node judging unit, In: node judging unit, for determining that present node is first node when the previous node determined is empty；Node determines single Member is also used to determine that present node is tail node when the latter node determined is empty.

In a kind of exemplary embodiment of the disclosure, which can also include modification time monitoring unit With rule file updating unit, in which: whether modification time monitoring unit, the modification time for monitoring Second Rule file are sent out It is raw to change；Rule file updating unit, for monitoring that the modification time of Second Rule file changes in modification time monitoring unit After change, Second Rule file is updated according to modification time corresponding modification content.

In a kind of exemplary embodiment of the disclosure, which can also include that rule file storage is single Member, in which: rule file storage unit, for before update Second Rule file and updated Second Rule file into Row storage.

According to the third aspect of the disclosure, a kind of computer-readable medium is provided, is stored thereon with computer program, journey The data processing method as described in first aspect in above-described embodiment is realized when sequence is executed by processor.

According to the fourth aspect of the disclosure, a kind of electronic equipment is provided, comprising: one or more processors；Storage dress Set, for storing one or more programs, when one or more programs are executed by one or more processors so that one or Multiple processors realize the data processing method as described in first aspect in above-described embodiment.

Technical solution provided by the present disclosure can include the following benefits:

Technical solution provided by some embodiments of the present disclosure can be applied to DAG.It is mentioned in embodiment of the disclosure In the technical solution of confession, present node can be any node in DAG, and previous node can be a upper section for present node Point, that is, needed before the corresponding data file of processing present node by node, exist between previous node and present node according to The relationship of relying.In addition, the quantity of previous node can be one or more, terminal device or server can be with a nodes in each of front Current state processing present node corresponding data file when being dbjective state, it can be understood as, terminal device or service Device can reprocess the corresponding data file of present node after having handled the corresponding data file of each previous node；Its In, dbjective state can be the state that data documents disposal finishes.In addition, latter node can be next section of present node Point, that is, the node triggered after terminal device or the corresponding data file of the complete present node of server process.The number of latter node Amount can be multiple；Wherein, the relationship between each latter node and present node is dependence, and multiple latter nodes Between relationship be coordination, terminal device or server can after having handled the corresponding data file of present node, The corresponding data file of the multiple latter nodes of parallel processing, it is understood that be, while opening multiple threads and handling respectively The corresponding data file of each latter node.It is described according to above scheme, on the one hand the disclosure can overcome to a certain extent The problem that DAG causes data-handling efficiency lower is executed by topological sorting sequence, compares the section in traditional serial execution DAG Point, that is, execute the daisy chaining obtained by node sequencing, and embodiment of the disclosure can pass through the node of parallel processing coordination Corresponding data file promotes data-handling efficiency；It on the other hand can be corresponding by the node of parallel processing coordination Data file promotes the utilization rate for server resource.

It should be understood that above general description and following detailed description be only it is exemplary and explanatory, not The disclosure can be limited.

Detailed description of the invention

The drawings herein are incorporated into the specification and forms part of this specification, and shows the implementation for meeting the disclosure Example, and together with specification for explaining the principles of this disclosure.It should be evident that the accompanying drawings in the following description is only the disclosure Some embodiments for those of ordinary skill in the art without creative efforts, can also basis These attached drawings obtain other attached drawings.In the accompanying drawings:

Fig. 1 shows a kind of flow diagram of data processing method according to one exemplary embodiment of the disclosure；

Fig. 2 shows the switching at runtime schematic diagrames according to a kind of directed acyclic graph of the disclosure one exemplary embodiment；

Fig. 3 shows the pattern match block diagram of the rule-based engine according to one exemplary embodiment of the disclosure；

Fig. 4 shows the switching at runtime schematic diagram of another directed acyclic graph according to one exemplary embodiment of the disclosure；

Fig. 5 shows the flow diagram of another data processing method according to one exemplary embodiment of the disclosure；

Fig. 6 shows the demand schematic diagram of the directed acyclic graph A according to one exemplary embodiment of the disclosure；

Fig. 7 shows the demand schematic diagram of another directed acyclic graph A according to one exemplary embodiment of the disclosure；

Fig. 8 shows the demand schematic diagram of the directed acyclic graph B according to one exemplary embodiment of the disclosure；

Fig. 9 shows the switching at runtime of the directed acyclic graph A and directed acyclic graph B according to one exemplary embodiment of the disclosure Schematic diagram；

Figure 10 shows the structural block diagram of the data processing equipment according to one exemplary embodiment of the disclosure；

Figure 11 shows the knot for being suitable for the computer system for the electronic equipment for being used to realize one exemplary embodiment of the disclosure Structure schematic diagram.

Specific embodiment

Example embodiment is described more fully with reference to the drawings.However, example embodiment can be with a variety of shapes Formula is implemented, and is not understood as limited to example set forth herein；On the contrary, thesing embodiments are provided so that the disclosure will more Fully and completely, and by the design of example embodiment comprehensively it is communicated to those skilled in the art.

In addition, described feature, structure or characteristic can be incorporated in one or more implementations in any suitable manner In example.In the following description, many details are provided to provide and fully understand to embodiment of the disclosure.However, It will be appreciated by persons skilled in the art that can with technical solution of the disclosure without one or more in specific detail, Or it can be using other methods, constituent element, device, step etc..In other cases, it is not shown in detail or describes known side Method, device, realization or operation are to avoid fuzzy all aspects of this disclosure.

Block diagram shown in the drawings is only functional entity, not necessarily must be corresponding with physically separate entity. I.e., it is possible to realize these functional entitys using software form, or realized in one or more hardware modules or integrated circuit These functional entitys, or these functional entitys are realized in heterogeneous networks and/or processor device and/or microcontroller device.

Flow chart shown in the drawings is merely illustrative, it is not necessary to including all content and operation/step, It is not required to execute by described sequence.For example, some operation/steps can also decompose, and some operation/steps can close And or part merge, therefore the sequence actually executed is possible to change according to the actual situation.

The data processing method of one embodiment of the disclosure can be applied to DAG, and DAG refers to that any a line has Direction and the figure that loop is not present, it can be understood as, if set out from some vertex (e.g., first node) of digraph, Wu Fajing It crosses several sides and returns to the vertex, then the digraph is DAG.Oriented cycles are free of in DAG, and DAG is by limited node and side Composition, another node is all directed toward from a node in each side.DAG can be applied to software operation field, e.g., be based on DAG Software model.User can customized DAG according to demand, and execute DAG and obtain as a result, it is to be understood that if one is appointed Business is made of multiple subtasks, user can by way of DAG the multiple subtask of tissue, multiple subtasks point after tissue Not Dui Yingyu each node of DAG execute multiple subtask according to the node execution sequence in the DAG after tissue in turn, can To obtain data processed result.

In software field, it usually needs carry out data cleansing to the data that user behavior generates, user behavior is generated Data be converted to convenient for computer call, calculate and storage valid data.Data cleansing may include that multiple business needs It asks, and usually there is dependence between business demand, above-mentioned multiple business demand can be usually managed using DAG. Off-line data cleaning in, generally use topological sorting sequence execute mode execute DAG, i.e., according to the collating sequence of node into The execution of row business demand.For example, it searches, first carries out if there is the zero padding of business demand null value and business demand median Null value zero padding executes median again and searches and first carry out median and search that execute the result that null value zero padding obtains again different.Therefore, In order to obtain correctly as a result, terminal device or server can execute the business section for having dependence according to topological sorting sequence Point.But in DAG, other than the service node there are dependence, it is also possible to there is the business section of no dependence Point (e.g., there are the service nodes of coordination), if the service node to no dependence still uses topological sorting sequence to hold Capable mode then will lead to the problem that data processing time is longer, data-handling efficiency is lower and resource utilization is lower.This Disclosed embodiment provides a kind of data processing method, comprising: determines the current state of multiple previous nodes；Wherein, multiple Previous node is corresponding with present node；When current state is dbjective state, the corresponding data file of processing present node； Wherein, multiple latter nodes are corresponding with present node for the corresponding data file of the multiple latter nodes of parallel processing, with Data processing time is reduced by the service node of parallel processing coordination, promotes data-handling efficiency and the utilization of resources Rate.

Shown referring to Fig. 1, Fig. 1 is shown according to a kind of process of data processing method of one exemplary embodiment of the disclosure It is intended to, which can be realized by server or terminal device.

As shown in Figure 1, including the following steps S110, step according to the data processing method of one embodiment of the disclosure S120 and step S130, in which:

Step S110: the current state of multiple previous nodes is determined；Wherein, multiple previous nodes are opposite with present node It answers.

Step S120: when current state is dbjective state, the corresponding data file of processing present node.

Step S130: the corresponding data file of the multiple latter nodes of parallel processing；Wherein, multiple latter nodes with Present node is corresponding.

The data processing method of one embodiment of the disclosure can be applied to DAG, carry out specifically to each step below It is bright:

In step s 110, present node can be understood as present node for any node in DAG, previous node Previous node, that is, the direction on the side between previous node and present node is to be directed toward present node by previous node.

In an exemplary embodiment of the disclosure, current state may include executable next node state and can not The state of next node is executed, dbjective state can be the state of executable next node.The state of executable next node is used In indicating that the corresponding data file of the node is processed at can carry out the data documents disposal of next node；It not can be performed The state of next node not can be carried out the data text of next node for indicating the untreated completion of the corresponding data file of the node Part processing.

In an exemplary embodiment of the disclosure, the quantity of previous node can be one or more.If previous node Quantity be one, and the current state of the previous node be dbjective state, terminal device or server can execute processing and work as The step of front nodal point corresponding data file；If the quantity of previous node is multiple, and the current state of multiple previous nodes It is dbjective state, the step of terminal device or server can execute processing present node corresponding data file, that is, It says, if the non-targeted state of the current state in multiple previous nodes there are at least one node, if terminal device or server Do not execute the operation of the corresponding data file of processing present node.

In an exemplary embodiment of the disclosure, optionally, the side of the current state of each previous node of above-mentioned determination Formula is specifically as follows: if detecting previous node as sky, determining that the corresponding current state of previous node is dbjective state；If Detecting previous node not is sky, detects whether the corresponding data file of each previous node handles completion, if detected every The corresponding data file of a previous node handles completion, it is determined that the current state of each previous node is dbjective state； If detecting the presence of the previous node of the untreated completion of its data file, it is determined that its it is untreated complete data file it is previous The non-targeted state of the current state of node, and determine in addition to the untreated previous node for completing data file other are previous The current state of node is dbjective state.It is wherein, above-mentioned to detect previous node for sky, it can be understood as, it detects previous Corresponding service logic is not present in node, service logic can be for one section for handling the code of data file.Into one Step is optional, if detecting previous node as sky, can also comprise steps of determining that present node is first node.As it can be seen that In the optional embodiment, present node can be any node (e.g., first node) in directed acyclic graph, terminal device Or it is corresponding to execute processing present node when all previous nodes corresponding with present node are in dbjective state for server The operation of data file, to guarantee the smooth execution of directed acyclic graph to a certain extent.

In an exemplary embodiment of the disclosure, another optional, before the current state for determining each previous node, It can be the following steps are included: determining first node according to the corresponding identification information of first node in target directed acyclic graph and inciting somebody to action First node triggers as present node and executes step S110；Wherein, present node can be to remove in target directed acyclic graph Any node except first node.It should be noted that if present node is the next node of first node, previous node It can be first node.As it can be seen that implement the optional embodiment, it can be according to the corresponding mark of first node in directed acyclic graph Information determines first node, and other nodes in directed acyclic graph are executed using first node as starting point.

In the step s 120, data file can be the file of the data generated comprising user behavior, or data History data file in library, embodiment of the disclosure are not construed as limiting.For example, if previous node is first node, and it is preceding The current state of one node is the state of executable next node, and it is corresponding that terminal device or server can handle present node Data file, wherein service logic can be not present in first node, that is, user data can be transferred directly to present node, As the corresponding data file of present node；In turn, terminal device or server can be according to the service logics pair of present node Data file is handled, and data file is transferred to latter node by treated.

In an exemplary embodiment of the disclosure, if there is multiple previous nodes, terminal device or server can be When detecting that each previous node is in dbjective state, the operation of the corresponding data file of processing present node is executed, it can be with It is interpreted as, present node may exist multiple upper nodes, that is, there are multiple summits by each previous node and be directed toward present node；Such as A upper node for fruit present node is in the state of pending next node, then it represents that the corresponding data file of a upper node is equal It is processed at, that is, previous node is in dbjective state.

In step s 130, the data file that data file can generate for user behavior.For example, if node B Relationship with node C is coordination, then can be with parallel processing node B and the corresponding data file of node C.

In an exemplary embodiment of the disclosure, optionally, it is respectively corresponded in the above-mentioned multiple latter nodes of parallel processing Data file before, can with the following steps are included:

Detect whether present node is tail node, if it is, the prompt information that output is finished for indicating data processing, Target directed acyclic graph where prompt information is used to indicate present node is finished；If not, thening follow the steps S130.

It is further alternative, after detecting present node not and being tail node, detect whether there are multiple latter nodes, If so, thening follow the steps S130；If it is not, then handling the corresponding data file of latter node.

It, can be in the non-tail node of present node and present node corresponds to later section as it can be seen that implement the optional embodiment When the quantity of point is multiple, the corresponding data file of the multiple latter nodes of parallel processing is compared traditional topological order and is held The corresponding data file (that is, serially executing the corresponding data file of multiple latter nodes) of the multiple latter nodes of row, this public affairs The embodiment opened can be improved data-handling efficiency, promote the utilization rate for computer resource.

As it can be seen that implementing data processing method shown in FIG. 1, the corresponding number of node of parallel processing coordination can be passed through According to file, data-handling efficiency is promoted；And it can be mentioned by the corresponding data file of node of parallel processing coordination Rise the utilization rate for server resource.

Property embodiment as an example, the data processing method can be the following steps are included: according to the first rule texts Part determines target directed acyclic graph from multiple directed acyclic graphs；Wherein, target directed acyclic graph includes present node, and first It include the identification information of target directed acyclic graph in rule file.

In an exemplary embodiment of the disclosure, the first rule file can be used for from multiple directed acyclic graphs determining Target directed acyclic graph, optionally, the corresponding program code of the first rule file can be with are as follows:

Specifically, in the corresponding program code of the first rule file, When:Condition is for indicating have from multiple The condition of target directed acyclic graph is determined into acyclic figure；DAGid is for indicating the corresponding identification information of DAG, it is possible to understand that For the label of DAG, the corresponding identification information of each DAG is different, that is, if the identification information of current directed acyclic graph has for target To the identification information of acyclic figure, it is determined that current directed acyclic graph is target directed acyclic graph；Then:Action is held for indicating Row DAG, it can be understood as DAG starts to work, and corresponding program code can be (DAG.run ()).As it can be seen that working as terminal device Or server calls are when being directed toward certain directed acyclic graph business, since the corresponding identification information of directed acyclic graph is unique, if Condition is consistent, then executes the business of the directed acyclic graph.Specifically, it is determined that the first node of the DAG, holds first node as starting point The triggering of row chain type.

For example, the corresponding program code of the first rule file are as follows:

Wherein, if the current corresponding identification information of directed acyclic graph (e.g., DAGid-A) is corresponding for target directed acyclic graph Identification information (e.g., DAGid-A), it is determined that current directed acyclic graph (e.g., DAG-A) is target directed acyclic graph (e.g., DAG- A)；In turn, DAG-A, i.e. DAG-A.run () are executed.If the first node in DAG-A is node A, using node A as starting point Execute DAG-A, i.e. Node-A.execute ().

Therefore, embodiment of the disclosure can determine that target has from multiple directed acyclic graphs according to the first rule file To acyclic figure.In addition, it is optional, multiple directed acyclic graphs can also be executed according to the first rule file.Research staff can lead to It crosses and constructs multiple directed acyclic graphs and write corresponding first node and the execution code of other nodes, when business demand changes When change, the dynamic of directed acyclic graph can be may be implemented by the identification information of the directed acyclic graph in the first rule file of modification State switching.Referring to Fig. 2, Fig. 2 shows the dynamics according to a kind of directed acyclic schematic diagram of one exemplary embodiment of the disclosure Switch schematic diagram.As shown in Fig. 2, including node A, node B, node C, node D, node E and node F in directed acyclic graph A； Wherein, node A is directed toward node B and node C, and node B is directed toward node D and node E, and node C is directed toward node E and node F.Oriented nothing It include node A ', node B ', node C ', node D ', node E ' and node F ' in ring figure A '；Wherein, node A ' is directed toward node B ' and node C ', node C ' are directed toward node D ', node E ' and node F '.Specifically, when receiving business demand, if should The identification information of directed acyclic graph A, then execute directed acyclic graph by regulation engine in the corresponding first rule file A of business demand A is executed if the identification information of directed acyclic graph A ' in the corresponding first rule file A ' of the business demand by regulation engine Directed acyclic graph A '.For example, if that executed according to current business demand is directed acyclic graph A, and business demand is at this time It changes and needs to be implemented directed acyclic graph A ', then it can be by the identification information of the directed acyclic graph in the first rule file by having The identification information of directed acyclic graph A ', the directed acyclic graph in the first rule file are changed to the identification information of acyclic figure A Identification information be directed acyclic graph A ' identification information when, first rule file is then corresponding with directed acyclic graph A ', this When, it can be using the first rule file as first rule file A ' corresponding with directed acyclic graph A '.Similarly, the first rule text The identification information of directed acyclic graph in part be directed acyclic graph A identification information when, using the first rule file as with it is oriented The corresponding first rule file A of acyclic figure A.

As it can be seen that a kind of switching at runtime schematic diagram of directed acyclic schematic diagram shown in Fig. 2, it being capable of changing according to business demand The change of the identification information of directed acyclic graph in change and rule-based file, realizes the switching at runtime between directed acyclic graph, Compare it is traditional real-time reception user behavior generate data when, due to the change of business demand by system it is offline so that change Business, embodiment of the disclosure can by the identification information for the directed acyclic graph changed on line in the first rule file, thus Realize directed acyclic graph in switching at runtime, reduce cost of labor, and overcome by system it is offline caused by a certain degree The bad problem of user experience.

As it can be seen that implementing the exemplary embodiment, according to the difference of the first rule file, to realize in directed acyclic graph Switching, reduce cost of labor, overcome the problems, such as by system it is offline caused by a degree of user experience it is bad.

As another exemplary embodiment, the above-mentioned corresponding data file of processing present node, may include following Step: according to the corresponding data file of the corresponding Second Rule file process present node of target directed acyclic graph；Second Rule File includes the processing rule of the corresponding data file of present node.

In an exemplary embodiment of the disclosure, optionally, according to the corresponding Second Rule file of target directed acyclic graph The mode of the corresponding data file of processing present node is specifically as follows: working as prosthomere according to the determination of the identification information of present node Point, and Second Rule file is added in the corresponding previous node of present node and latter node, by Second Rule file It should the corresponding data file of front nodal point.

For example, the corresponding program code of Second Rule file can be with are as follows:

Specifically, in the corresponding program code of Second Rule file, When:Condition is current for indicating to determine Whether corresponding with selected node the corresponding identification information of node identification information be identical, for example, if present node is node A, Selected node is node A, then the corresponding identification information of present node identification information corresponding with selected node is identical, i.e. nodeID ==Node.nodeID；In turn, the corresponding dependence node mapping block of present node and the access of list of target nodes module are advised Then file parameters, wherein relying on includes the corresponding previous node of present node, list of target nodes module in node mapping block In include the corresponding latter node of present node, it can be understood as the corresponding previous node of present node and latter node are accessed In Second Rule file.In addition, cleaning assembly can be understood as the corresponding service logic of present node, executed using cleaning assembly The operation flow of present node can be understood as through the corresponding data of the corresponding business logic processing present node of present node File.It can when the service logic of certain node is directed toward in external call based on the above-mentioned corresponding program code of Second Rule file To determine the node from directed acyclic graph according to node structure, and the node is initialized, and then passes through pre-set number The service logic of the node is executed according to processing component.

In an exemplary embodiment of the disclosure, optionally, which can be the following steps are included: to One rule file and Second Rule file are stored.Further, the first rule file and Second Rule file are deposited The mode of storage is specifically as follows: the first rule file and Second Rule file are stored to the data persistence layer of database.In addition, the One rule file can be DAG level rule file, Second Rule file can be Node level rule file, Node layers The rule file of grade can be understood as the rule file of node level.Due in directed acyclic graph the rule file of DAG level with The Rule of judgment of the rule file of Node level is different and executes method difference, thus can pass through the tables of data in data persistence layer Addition rule ownership layer distinguishes the rule file of DAG level and the rule file of Node level.For example, above-mentioned persistence The tables of data of layer can be with are as follows:

id	ruletype	content	createtime	updatetime
					Unique identification position	Rule ownership layer	Rule content	Creation time	Modification time

Specifically, by the regular loading module in regulation engine, rule file in data persistence layer can be recorded (e.g., First rule file and/or Second Rule file) into system；In turn, then by the rule in regulation engine module is monitored.

In an exemplary embodiment of the disclosure, optionally, the first above-mentioned rule file and Second Rule file are logical Cross what regulation engine was determined.The parallel place for coordination node may be implemented by executing step S110~step S130 Reason still since hard coded content is fixed in the processing mode of node traffic, demand realization, leads to the online dynamic of realization demand It is higher that state changes difficulty.But the regulation engine execution DAG in the exemplary embodiment based on the disclosure can be to a certain extent Overcome the above problem；Wherein, regulation engine can service logic in independent engineering, to promote the flexibility of demand change.Tool Body, regulation engine can disassemble business demand as true object and rule file in run-time memory, apply journey When sort run, the purpose according to the corresponding data file of business logic processing node may be implemented by internal schema matching；Its In, facts object can be understood as DAG, and rule file can be understood as the first above-mentioned rule file.For example, work as detection To user behavior generate data when (when can be understood as detecting business demand), terminal device or server can be by business Demand, facts object and rule file carry out pattern match, so that the data that user behavior generates pass through target directed acyclic Figure, and data processing is carried out to the data that user behavior generates, wherein the data file obtained after data processing can be mould The matched output result of formula.

Referring to Fig. 3, Fig. 3 shows the pattern match frame of the rule-based engine according to one exemplary embodiment of the disclosure Figure.As shown in figure 3, including business demand 301, facts object 302, pattern match in the pattern match block diagram of rule-based engine 303, rule file 304 and output result 305.Specifically, regulation engine can disassemble business demand 301 for facts object 302 and rule file 304, in turn, terminal device or server can combine business demand when receiving business demand 301 301, facts object 302 and rule file 304 carry out pattern match 303, and then obtain output result 305.Wherein, true Object 302 can be understood as directed acyclic graph, and directed acyclic graph corresponds to the first rule file, and the node in directed acyclic graph is corresponding Second Rule file, rule file 304 may include the first rule file, or including the first rule file and Second Rule text Part.

As it can be seen that the pattern match block diagram of rule-based engine shown in Fig. 3, can determine pending according to business demand Directed acyclic graph, to realize processing for data file, and then promote data-handling efficiency.

It is cut referring to Fig. 4, Fig. 4 is shown according to the dynamic of another directed acyclic graph of one exemplary embodiment of the disclosure Change schematic diagram.As shown in figure 4, including node A, node B, node C, node D, node E and node F in Fig. 4；Wherein, node A It is directed toward node B and node C, node B is directed toward node D and node E, and node C is directed toward node E and node F.Packet in directed acyclic graph A ' Include node A ', node B ', node C ', node D ', node E ' and node F '；Wherein, node A ' is directed toward node B ' and node C ', Node C ' is directed toward node D ', node E ' and node F '.Wherein, node A, node B, node C, node D, node E and node F There are corresponding rule files, and similarly, node A ', node B ', node C ', node D ', node E ' and node F ' are also deposited In corresponding rule file, Second Rule file may include above-mentioned rule file corresponding with each node respectively.

Specifically, when detecting business demand, according to the identification information of the corresponding directed acyclic graph of business demand from having The directed acyclic graph that comes into force is determined into acyclic figure A and directed acyclic graph A ', and executes the directed acyclic graph that comes into force, wherein is come into force Directed acyclic graph is directed acyclic graph A or directed acyclic graph A '；In turn, first node is determined from the directed acyclic graph that comes into force, add Rule file identical with the identification information of first node in Second Rule file, and the node structure of incoming first node are carried, to hold The service logic of row first node, and trigger the node for including in the list of target nodes module for executing first node；Wherein, target section The node for including in point list module can be the corresponding latter node of present node；In turn, according to first node, chain type triggering is every A node triggers present node if the marker of the dependence node mapping block of present node is all ready, can also To be interpreted as, if the current state of the corresponding previous node of present node is that (next node e.g., can be performed in dbjective state State), then handle the corresponding data file of present node；Wherein, present node can be any node；In turn, from the second rule Rule file corresponding with present node is then loaded in file, so that terminal device or server according to node structure and are worked as The corresponding data file of the corresponding rule file processing present node of front nodal point, until all nodes in the directed acyclic graph that comes into force Until corresponding data documents disposal finishes.It needs to hold in conclusion business demand is determined by DAG layers of rule file first Capable DAG, and then the first node of the DAG is called, and chain type triggers each node, wherein each node is right by the Node layers The rule file answered carries out the statement of node structure and executes the business of node, to trigger next node, and then realizes final industry Business logic.

As it can be seen that the switching at runtime schematic diagram of directed acyclic graph shown in Fig. 4, can be executed according to business demand has accordingly To acyclic figure, to realize the processing for data file, and then data-handling efficiency and data process effects are promoted.

As it can be seen that implement the exemplary embodiment, corresponding directed acyclic graph can be determined according to business demand, and according to First rule file and Second Rule file execute directed acyclic graph, to realize the processing for data file, and then promote number According to treatment effeciency and data process effects.

As another exemplary embodiment, Second Rule file can also include in target directed acyclic graph for indicating The node structure of node execution sequence.

In an exemplary embodiment of the disclosure, Unified Modeling Language (Unified Modeling Language, UML) It is off-patent third generation modeling and specification language.UML is a kind of method of opening, for illustrating, visualizing, construct and write The opening method of one being developed, object-oriented, denseness system product.

In an exemplary embodiment of the disclosure, the corresponding UML of node structure can be with are as follows:

The corresponding UML of directed acyclic graph can be with are as follows:

In an exemplary embodiment of the disclosure, node structure may include having between target directed acyclic graph interior joint Connection type between the direction (e.g., being directed toward node B by node A) and node of line segment, therefore, node structure can be with table Show that node executes sequence, terminal device or server can be according to the nodes in node execution sequence performance objective directed acyclic graph Corresponding data file.

For example, optionally, if in target directed acyclic graph including node A, node B, node C, node D, node E, node F and node G, then, it may include the node structure for indicating node execution sequence in Second Rule file.Its In, node structure may include: that node A is directed toward node B, node A direction node C, node A is directed toward node D, node A and is directed toward section Point E, node D are directed toward node F, node F and are directed toward node G, node B direction node G, node C direction node G and node E direction Node G.

According to above-mentioned node structure and combination embodiment of the disclosure it is found that if present node is node A, node A's A upper node is sky, i.e., previous node is sky, and therefore, node A is the first node in target directed acyclic graph, and node A is corresponding Service logic is empty service logic, it can be understood as, it is empty since node A is corresponding after the corresponding data file of processing node A Service logic, therefore, the data file do not change；In addition, since the next node of node A is node B, node C, saves Point D and node E, therefore, after the corresponding data file of processing node A, terminal device or server can be with parallel processing sections Point B, node C, node D and the corresponding data file of node E.In addition, if present node is node B, previous section Point be node A, latter node is then node G, when node A current state be dbjective state, e.g., can be performed next node shape State, then terminal device or server can handle the corresponding data file of node B, and then handle the corresponding data file of node G. Similarly, if present node is node C, previous node is node A, and latter node is node G；If present node is node D, then previous node is node A, and latter node is node F；If present node is node E, previous node is node A, after One node is node G；If present node is node F, previous node is node D, and latter node is node G.In addition, if Present node be node G, then previous node be it is multiple, that is, node B, node C, node F and node E, if terminal device or Server determines that the current state of egress B, node C, node F and node E are dbjective state, i.e. node B, node C, section Point F and the corresponding data file of node E handle completion, then can handle the corresponding data file of node G；Due to section Point G is the tail node in target directed acyclic graph, and therefore, latter node is sky, when the corresponding data documents disposal of node G is completed Later, target directed acyclic graph is finished.

For example, another optional, terminal device can be according to the corresponding mark of first node in target directed acyclic graph Know information and determine first node, that is, egress A is determined according to the corresponding identification information of node A, and then it is corresponding to handle node A Data file, since the corresponding service logic of node A is empty service logic, the side of the corresponding data file of processing node A Formula is specifically as follows: passing through the corresponding data file of the corresponding business logic processing node A of node A.Further, due to node The corresponding latter node of A is node B, node C, node D and node E, and therefore, terminal device or server can be with parallel processings Node B, node C, node D and the corresponding data file of node E.In turn, then by embodiment of the disclosure mesh is executed Mark other nodes in directed acyclic graph.As it can be seen that implement the optional embodiment, can determine first node, so convenient for by First node starts performance objective directed acyclic graph.

As it can be seen that implementing the exemplary embodiment, can be carried out in conjunction with node structure and the corresponding service logic of each node The processing of data file is able to ascend the treatment effect for data file and promotes the treatment effeciency for data file.

As another exemplary embodiment, which can be the following steps are included: according to node structure Determine previous node and latter node.

It in an exemplary embodiment of the disclosure, include the connection relationship of each node in node structure.

As it can be seen that implement the exemplary embodiment, can be determined by node structure the corresponding previous node of present node and Latter node can be convenient for the execution of directed acyclic graph, to promote the execution efficiency of directed acyclic graph.

As another exemplary embodiment, which can be the following steps are included: before if it is determined that One node is sky, then determines present node for first node；If it is determined that latter node be sky, then determine present node for periproct Point.

In an exemplary embodiment of the disclosure, if previous node is sky, determine that the dependence node of present node reflects It penetrates without node in module, then, present node is then first node；If latter node is sky, the target of present node is determined Without node in node listing module, then, present node is tail node.

As it can be seen that implement the exemplary embodiment, it can be by the determination of tail node and first node, convenient for directed acyclic graph It executes.

As another exemplary embodiment, which can be the following steps are included: if monitors second The modification time of rule file changes, and is updated according to the corresponding modification content of modification time to Second Rule file.

In an exemplary embodiment of the disclosure, if terminal device or monitoring server repairing into Second Rule file Change time field change, then terminal device or server can be determined that Second Rule file is modified, and then according to modification time Corresponding modification content is updated and saves to Second Rule file, and then it is made to come into force.Optionally, terminal device or service Device can monitor module monitors modification time field according to rule, with the Second Rule file that timely updates.

As it can be seen that implement the exemplary embodiment, it can be according to the monitoring of the modification time to Second Rule file, in time more The content of new Second Rule file, to promote treatment effeciency and treatment effect for data file.

As another exemplary embodiment, which can be the following steps are included: to before update Two rule files and updated Second Rule file are stored.

As it can be seen that implement the exemplary embodiment, can by the storage of the Second Rule file for updating front and back, so as to For update front and back Second Rule file different data processing result comparison, convenient for research staff for rule file into Row improves, to promote the treatment effeciency and treatment effect of data file.

Referring to Fig. 5, Fig. 5 shows the process of another data processing method according to one exemplary embodiment of the disclosure Schematic diagram.As shown in figure 5, the another kind data processing method include step S500, step S502, step S504, step S506, Step S508, step S510, step S512, step S514, step S516, step S518, step S520 and step S522, In:

Step S500: statement directed acyclic graph.

Step S502: directed acyclic graph is executed.

Step S504: it obtains first node and runs first node.

Step S506: open thread and with run this node.

Step S508: whether list of target nodes module includes other nodes, if so, S510 is thened follow the steps, if It is no, then follow the steps S518.

Step S510: other nodes are determined.

Step S512: the node identification relied in node mapping block is updated.

Step S514: whether detection relies on node mapping block ready, if so, S506 is thened follow the steps, if It is no, then follow the steps S516.

Step S516: triggering next time is waited.

Step S518: single node end of run.

Step S520: whole node end of runs.

Step S522: it is finished.

In an exemplary embodiment of the disclosure, after stating directed acyclic graph structures, real time data is flowed into, system quilt Trigger calls DAG.run () to be run, and the method (getStartNode for determining first node is called in run () method ()) it determines first node and triggers execution method (execute ()) the execution business of first node；Wherein, execute () method It is that specific business executes method, separate threads can be opened and executed, to realize the purpose of parallel data processing file.When obtaining Thread can be opened after taking first node to trigger and runs this node, if in the list of target nodes module of the node including other Node then determines other nodes and updates the mark of other nodes relied in node mapping block, if detected updated It is ready to rely on node mapping block, opens the node and runs, until having run all nodes.In addition, if target Do not include other nodes in node listing module, then executes single node operation.

As it can be seen that data processing method shown in fig. 5, is capable of the corresponding data file of node of parallel processing coordination, Promote data-handling efficiency；And it can be promoted by the corresponding data file of node of parallel processing coordination for clothes The utilization rate for device resource of being engaged in.

For example, if raw data format, that is, clear data rule in message queue is defined as follows shown in table:

Wherein, the data file that the raw data format in message queue can generate for user behavior, the data file For pending data file, it is understood that be data file to be cleaned.

Specifically, the mode that the data file generated to user behavior is handled can be through node structure and section The data file that the corresponding service logic of point generates user behavior is handled, wherein being handled data file can also Be interpreted as to cleaning data, data are cleaned by service logic it can be appreciated that by cleaning assembly to data into Row cleaning.

Cleaning assembly may include:

Cleaning assembly a: first node triggers logic, empty service logic；

Cleaning assembly b: detecting certain character string, when being not all number, is set to -1；

Cleaning assembly c: detecting certain field, is used for yyyy-MM-dd HH:mm:ss format specification；

Cleaning assembly d: [numerical value a, numerical value b] standardization is carried out to certain field；

Cleaning assembly e: it when a field is empty, is filled using field b；

Cleaning assembly f: when certain field is -1, this message is abandoned.

Second Rule file may include:

Regular A: when the identification information of node is node A, invocation component a directly carries out triggering destination node triggering and patrols Volume.

Regular B is when the identification information of node is node B, invocation component b, and defining certain field is pin field.(work as pin When field is not all array, pin field is set to -1)

Regular C: when the identification information of node is node C, invocation component c, defining certain field is transaction time field. (i.e. when illegal format, it is used for yyyy-MM-dd HH:mm:ss format specification.)

Regular D: when the identification information of node is node D, invocation component c defines certain field as registration field. (i.e. upon logging between illegal format when, be used for yyyy-MM-dd HH:mm:ss format specification.)

Regular E: when the identification information of node is node E, invocation component d, defining certain field is amount field, numerical value a Field is 0, and numerical value b field is 100000.([0,100000] standardization is carried out to amount field.)

Regular F: when the identification information of node is node F, invocation component e, definition field a are login time field, fixed Adopted field b is registion time field.It (i.e. when the illegal format of login time, is substituted using registion time.)

Regular G: when the identification information of node is node G, invocation component f, defining certain field is pin field.(work as When pin value is -1, message block operation is carried out.)

Node structure in Second Rule file may include:

In the corresponding rule file of node A, the dependence node mapping block of node A is sky, the list of target nodes of node A It include node B, node C, node D and node E in module；

It include node A, the target of node B in the dependence node mapping block of node B in the corresponding rule file of node B It include node G in node listing module；

It include node A, the target of node C in the dependence node mapping block of node C in the corresponding rule file of node C It include node G in node listing module；

It include node A, the target of node D in the dependence node mapping block of node D in the corresponding rule file of node D It include node F in node listing module；

It include node A, the target of node E in the dependence node mapping block of node E in the corresponding rule file of node E It include node G in node listing module；

It include node D, the target of node F in the dependence node mapping block of node F in the corresponding rule file of node F It include node G in node listing module；

It include node B, node C, node F in the dependence node mapping block of node G in the corresponding rule file of node G And the list of target nodes module of node E, node G are sky.

It should be noted that the rule and node structure in above-mentioned Second Rule file can store in regulation engine In data persistence layer.

The rule file (that is, first rule file) of DAG level can be with are as follows:

Specifically, when the identification information that identification information is directed acyclic graph A, then the data cleansing of directed acyclic graph A is triggered Operation, it is understood that execute directed acyclic graph A.

In conjunction with the example above, referring to Fig. 6, Fig. 6 shows the directed acyclic graph according to one exemplary embodiment of the disclosure In demand schematic diagram.As shown in fig. 6, including node A, node B, node C, node D, node E, node F and node G；Its In, node A is directed toward node B, node C, node D and node E, node D and is directed toward node F, node B, node C node E and section Point F is directed toward node G.

Specifically, when in the directed acyclic graph that data enter real-time cleaning system, the rule text of DAG level can be loaded Part, confirms the directed acyclic graph currently to come into force and execution determines the first node A of directed acyclic graph, and loading rule A, root in turn Cleaning assembly a is called according to node structure and triggers node B, node C, node D and node E；In turn, loading rule B, and confirm The corresponding dependence node mapping block of node B only includes node A, and node A is ready (that is, the current state of node A is mesh Mark state), then node B is triggered successfully, and singly burst at the seams the corresponding data file of Cheng Zhihang node B, similarly, due to node C, node D And the corresponding dependence node mapping block of node E only includes node A, therefore, the Cheng Zhihang node C that singly bursts at the seams is corresponding Data file, the corresponding data file of Cheng Zhihang node D that singly bursts at the seams and the corresponding data file of Cheng Zhihang node E that singly bursts at the seams. Specifically, the mode for the corresponding data file of Cheng Zhihang node B that singly bursts at the seams are as follows: loading rule B is called according to node structure and cleaned Component b simultaneously triggers node G, wherein cleaning node B is responsible for field (identification code), that is, direct without operation if identification code is legal Pass through；The mode for the corresponding data file of Cheng Zhihang node C that singly bursts at the seams are as follows: loading rule C calls cleaning group according to node structure Part c simultaneously triggers node G；The mode for the corresponding data file of Cheng Zhihang node D that singly bursts at the seams are as follows: loading rule D, according to node structure It calls cleaning assembly c and triggers node F；The mode for the corresponding data file of Cheng Zhihang node E that singly bursts at the seams are as follows: loading rule E, root Cleaning assembly d is called according to node structure and triggers node G；The mode for the corresponding data file of Cheng Zhihang node F that singly bursts at the seams are as follows: add Rule F is carried, cleaning assembly e is called according to node structure and triggers node G.When node G is triggered for the first time, terminal device or clothes Business device can detecte all nodes of node G relied in node mapping block whether to be ready to complete, if there is any Node is not ready to complete, then without operation, if all nodes are ready for completing, loading rule G, according to node structure Call cleaning assembly f.

If user behavior is captured on line, be passed to real-time stream and is distributed to the cleaning system, and incoming data It is as shown in the table:

Pass through the first above-mentioned rule file, the data of Second Rule file and above-mentioned directed acyclic graph shown in fig. 6 It handles, result shown in available following table:

In an exemplary embodiment of the disclosure, when needing the demand in directed acyclic graph to be modified, Ke Yili Demand is modified with regulation engine frame, and by changing rule file.

For example, the above-mentioned corresponding program code of regular F can be with are as follows:

By the modification to rule file, can change are as follows:

The above-mentioned corresponding program code of regular E can be with are as follows:

By the modification to rule file, can change are as follows:

In turn, the content field that the modification of rule file will be stored in persistence library (e.g., database), and And using the updatetime field automatically updated in persistence library as more new logo；In turn, in terminal device or server Regulation engine can monitor the update of updatetime field, to reload regular E and rule F and it is made to come into force.For repairing The variation for changing rule file front and back directed acyclic graph can please refer to Fig. 7 and Fig. 8, and Fig. 7 shows exemplary according to the disclosure one The demand schematic diagram of another directed acyclic graph A of embodiment, Fig. 8 are shown according to the oriented of one exemplary embodiment of the disclosure The demand schematic diagram of acyclic figure B.

As shown in fig. 7, including node A, node B, node C, node D, node E, node F and node G, node A in Fig. 7 Node B, node C, node D, node E, node F and node G are respectively present corresponding rule file；Wherein, B pairs of node The service logic answered can be with are as follows: illegal identification code is labeled as -1；The corresponding service logic of node C can be with are as follows: when by trading Between format standardize；The corresponding service logic of node D can be with are as follows: by registion time format specification；The corresponding business of node E is patrolled It volume can be with are as follows: be standardized transaction amount；The corresponding service logic of node F can be with are as follows: makes when login time is illegal Use registion time；The corresponding service logic of node G can be with are as follows: intercepts the record that identification code is -1.Node A is directed toward node B, section Point C, node D and node E, node D are directed toward node F, and node B, node C, node F and node E are respectively directed to node G.

As shown in figure 8, including node A, node B, node C, node D, node E, node F and node G, node A in Fig. 8 Node B, node C, node D, node E, node F and node G are respectively present corresponding rule file；Wherein, B pairs of node The service logic answered can be with are as follows: illegal identification code is labeled as -1；The corresponding service logic of node C can be with are as follows: when by trading Between format standardize；The corresponding service logic of node D can be with are as follows: by registion time format specification；The corresponding business of node E is patrolled It volume can be with are as follows: be standardized transaction amount；The corresponding service logic of node F can be with are as follows: makes when login time is illegal Use exchange hour；The corresponding service logic of node G can be with are as follows: intercepts the record that identification code is -1.Node A is directed toward node B, section Point C, node D and node E, node C are directed toward node F, and node B, node D, node F and node E are respectively directed to node G.

As it can be seen that can be by directed acyclic graph A's shown in Fig. 7 by the data processing method that embodiment of the disclosure provides Demand schematic diagram is changed to the demand schematic diagram of directed acyclic graph B shown in Fig. 8, to reduce the cost of change demand.

Referring to Fig. 9, Fig. 9 shows the directed acyclic graph A and directed acyclic graph B according to one exemplary embodiment of the disclosure Switching at runtime schematic diagram.As shown in figure 9, regulation engine can be determined according to the corresponding identification information of message queue initial data Directed acyclic graph A or directed acyclic graph B is executed out.Execute directed acyclic graph A or directed acyclic graph B can be with output data at Reason is as a result, it can be appreciated that data cleansing result.

It wherein, include node A, node B, node C, node D, node E, node F and node G, section in directed acyclic graph A Point A node B, node C, node D, node E, node F and node G are respectively present corresponding rule file；Wherein, node The corresponding service logic of B can be with are as follows: illegal identification code is labeled as -1；The corresponding service logic of node C can be with are as follows: will trade Time format standardization；The corresponding service logic of node D can be with are as follows: by registion time format specification；The corresponding business of node E Logic can be with are as follows: is standardized transaction amount；The corresponding service logic of node F can be with are as follows: when login time is illegal Use registion time；The corresponding service logic of node G can be with are as follows: intercepts the record that identification code is -1.Node A direction node B, Node C, node D and node E, node D are directed toward node F, and node B, node C, node F and node E are respectively directed to node G.

It wherein, include node A, node B, node C, node D, node E, node F and node G, section in directed acyclic graph B Point A node B, node C, node D, node E, node F and node G are respectively present corresponding rule file；Wherein, node The corresponding service logic of B can be with are as follows: illegal identification code is labeled as -1；The corresponding service logic of node C can be with are as follows: will trade Time format standardization；The corresponding service logic of node D can be with are as follows: by registion time format specification；The corresponding business of node E Logic can be with are as follows: is standardized transaction amount；The corresponding service logic of node F can be with are as follows: when login time is illegal Use exchange hour；The corresponding service logic of node G can be with are as follows: intercepts the record that identification code is -1.Node A direction node B, Node C, node D and node E, node C are directed toward node F, and node B, node D, node F and node E are respectively directed to node G.

As it can be seen that the switching at runtime schematic diagram of directed acyclic graph A shown in Fig. 9 and directed acyclic graph B, can draw convenient for rule It holds up and corresponding directed acyclic graph is executed according to different identification informations, also may be performed simultaneously a variety of different directed acyclics Figure, can be further improved directed acyclic graph by the different data processed results obtained, to be promoted at data Manage efficiency and data process effects.

Referring to Fig. 10, Figure 10 shows the structural frames of the data processing equipment according to one exemplary embodiment of the disclosure Figure.The data processing equipment includes: status determining unit 1001 and data processing unit 1002.

Wherein, status determining unit 1001, for determining the current state of multiple previous nodes；Wherein, multiple previous sections Point is corresponding with present node；Data processing unit 1002 is target-like for the current state when multiple previous nodes When state, the corresponding data file of processing present node；Data processing unit 1002 is also used to the multiple latter nodes of parallel processing point Not corresponding data file；Wherein, multiple latter nodes are corresponding with present node.

As it can be seen that implementing data processing equipment shown in Fig. 10, it is capable of the corresponding data of node of parallel processing coordination File promotes data-handling efficiency；And it can be promoted by the corresponding data file of node of parallel processing coordination For the utilization rate of server resource.

Property embodiment as an example, the data processing equipment can also include that directed acyclic graph determination unit (is not schemed Show), in which: directed acyclic graph determination unit, for determining target from multiple directed acyclic graphs according to the first rule file Directed acyclic graph；Wherein, target directed acyclic graph includes present node, includes target directed acyclic graph in the first rule file Identification information.

As it can be seen that implement the exemplary embodiment, it can be according to the difference of the first rule file, to realize directed acyclic graph In switching, reduce cost of labor, overcome the problems, such as by system it is offline caused by a degree of user experience it is bad.

As another exemplary embodiment, data processing unit 1002 handles the side of the corresponding data file of present node Formula is specifically as follows: data processing unit 1002 is according to the corresponding Second Rule file process present node of target directed acyclic graph Corresponding data file；Second Rule file includes the processing rule of the corresponding data file of present node.

As another exemplary embodiment, Second Rule file further includes in target directed acyclic graph for indicating node The node structure of execution sequence.

As another exemplary embodiment, which can also include node determination unit (not shown), Wherein: node determination unit, for determining previous node and latter node according to node structure.

As another exemplary embodiment, which can also include node judging unit (not shown), Wherein: node judging unit, for determining that present node is first node when the previous node determined is empty；Node determines Unit is also used to determine that present node is tail node when the latter node determined is empty.

As another exemplary embodiment, which can also include that modification time monitoring unit (is not schemed Show) and rule file updating unit (not shown), in which: modification time monitoring unit, for monitoring repairing for Second Rule file Change whether the time changes；Rule file updating unit, for monitoring Second Rule file in modification time monitoring unit Modification time change after, Second Rule file is updated according to modification time corresponding modification content.

As another exemplary embodiment, which can also include that rule file storage unit (is not schemed Show), in which: rule file storage unit, for the Second Rule file and updated Second Rule file before update It is stored.

Due to each functional module and above-mentioned data processing method of the data processing equipment of the example embodiment of the disclosure Example embodiment the step of it is corresponding, therefore for those undisclosed details in the apparatus embodiments, please refer in the disclosure The embodiment for the data processing method stated.

Figure 11 is please referred to, Figure 11 shows the calculating for being suitable for the electronic equipment for being used to realize one exemplary embodiment of the disclosure The structural schematic diagram of machine system 1100.The computer system 1100 of electronic equipment shown in Figure 11 is only an example, should not be right The function and use scope of the embodiment of the present disclosure bring any restrictions.

As shown in figure 11, computer system 1100 include central processing unit (CPU) 1101, can according to be stored in only It reads the program in memory (ROM) 1102 or is loaded into random access storage device (RAM) 1103 from storage section 1108 Program and execute various movements appropriate and processing.In RAM 1103, be also stored with various programs needed for system operatio and Data.CPU 1101, ROM 1102 and RAM 1103 are connected with each other by bus 1104.Input/output (I/O) interface 1105 It is also connected to bus 1104.

I/O interface 1105 is connected to lower component: the importation 1106 including keyboard, mouse etc.；Including such as cathode The output par, c 1107 of ray tube (CRT), liquid crystal display (LCD) etc. and loudspeaker etc.；Storage section including hard disk etc. 1108；And the communications portion 1109 of the network interface card including LAN card, modem etc..Communications portion 1109 passes through Communication process is executed by the network of such as internet.Driver 1110 is also connected to I/O interface 1105 as needed.It is detachable to be situated between Matter 1111, such as disk, CD, magneto-optic disk, semiconductor memory etc. are mounted on as needed on driver 1110, so as to In being mounted into storage section 1108 as needed from the computer program read thereon.

Particularly, in accordance with an embodiment of the present disclosure, it may be implemented as computer above with reference to the process of flow chart description Software program.For example, embodiment of the disclosure includes a kind of computer program product comprising be carried on computer-readable medium On computer program, which includes the program code for method shown in execution flow chart.In such reality It applies in example, which can be downloaded and installed from network by communications portion 1109, and/or from detachable media 1111 are mounted.When the computer program is executed by central processing unit (CPU) 1101, executes in the system of the application and limit Above-mentioned function.

It should be noted that computer-readable medium shown in the disclosure can be computer-readable signal media or meter Calculation machine readable storage medium storing program for executing either the two any combination.Computer readable storage medium for example can be --- but not Be limited to --- electricity, magnetic, optical, electromagnetic, infrared ray or semiconductor system, device or device, or any above combination.Meter The more specific example of calculation machine readable storage medium storing program for executing can include but is not limited to: have the electrical connection, just of one or more conducting wires Taking formula computer disk, hard disk, random access storage device (RAM), read-only memory (ROM), erasable type may be programmed read-only storage Device (EPROM or flash memory), optical fiber, portable compact disc read-only memory (CD-ROM), light storage device, magnetic memory device, Or above-mentioned any appropriate combination.In the disclosure, computer readable storage medium can be it is any include or storage journey The tangible medium of sequence, the program can be commanded execution system, device or device use or in connection.And at this In open, computer-readable signal media may include in a base band or as the data-signal that carrier wave a part is propagated, Wherein carry computer-readable program code.The data-signal of this propagation can take various forms, including but unlimited In electromagnetic signal, optical signal or above-mentioned any appropriate combination.Computer-readable signal media can also be that computer can Any computer-readable medium other than storage medium is read, which can send, propagates or transmit and be used for By the use of instruction execution system, device or device or program in connection.Include on computer-readable medium Program code can transmit with any suitable medium, including but not limited to: wireless, electric wire, optical cable, RF etc. are above-mentioned Any appropriate combination.

Flow chart and block diagram in attached drawing are illustrated according to the system of the various embodiments of the disclosure, method and computer journey The architecture, function and operation in the cards of sequence product.In this regard, each box in flowchart or block diagram can generation A part of one module, program segment or code of table, a part of above-mentioned module, program segment or code include one or more Executable instruction for implementing the specified logical function.It should also be noted that in some implementations as replacements, institute in box The function of mark can also occur in a different order than that indicated in the drawings.For example, two boxes succeedingly indicated are practical On can be basically executed in parallel, they can also be executed in the opposite order sometimes, and this depends on the function involved.Also it wants It is noted that the combination of each box in block diagram or flow chart and the box in block diagram or flow chart, can use and execute rule The dedicated hardware based systems of fixed functions or operations is realized, or can use the group of specialized hardware and computer instruction It closes to realize.

Being described in unit involved in the embodiment of the present disclosure can be realized by way of software, can also be by hard The mode of part realizes that described unit also can be set in the processor.Wherein, the title of these units is in certain situation Under do not constitute restriction to the unit itself.

As on the other hand, present invention also provides a kind of computer-readable medium, which be can be Included in electronic equipment described in above-described embodiment；It is also possible to individualism, and without in the supplying electronic equipment. Above-mentioned computer-readable medium carries one or more program, when the electronics is set by one for said one or multiple programs When standby execution, so that the electronic equipment realizes such as above-mentioned data processing method as described in the examples.

For example, the electronic equipment may be implemented as shown in Figure 1: step S110: determining multiple previous nodes Current state；Wherein, multiple previous nodes are corresponding with present node；Step S120: when current state is dbjective state, Handle the corresponding data file of present node；Step S130: the corresponding data file of the multiple latter nodes of parallel processing its In, multiple latter nodes are corresponding with present node.

It should be noted that although being referred to several modules or list for acting the equipment executed in the above detailed description Member, but this division is not enforceable.In fact, according to embodiment of the present disclosure, it is above-described two or more Module or the feature and function of unit can embody in a module or unit.Conversely, an above-described mould The feature and function of block or unit can be to be embodied by multiple modules or unit with further division.

Through the above description of the embodiments, those skilled in the art is it can be readily appreciated that example described herein is implemented Mode can also be realized by software realization in such a way that software is in conjunction with necessary hardware.Therefore, according to the disclosure The technical solution of embodiment can be embodied in the form of software products, the software product can store one it is non-easily In the property lost storage medium (can be CD-ROM, USB flash disk, mobile hard disk etc.) or on network, including some instructions are so that a meter Equipment (can be personal computer, server, touch control terminal or network equipment etc.) execution is calculated according to the embodiment party of the disclosure The method of formula.

Those skilled in the art after considering the specification and implementing the invention disclosed here, will readily occur to its of the disclosure Its embodiment.This application is intended to cover any variations, uses, or adaptations of the disclosure, these modifications, purposes or Person's adaptive change follows the general principles of this disclosure and including the undocumented common knowledge in the art of the disclosure Or conventional techniques.The description and examples are only to be considered as illustrative, and the true scope and spirit of the disclosure are by following Claim is pointed out.

It should be understood that the present disclosure is not limited to the precise structures that have been described above and shown in the drawings, and And various modifications and changes may be made without departing from the scope thereof.The scope of the present disclosure is only limited by the accompanying claims.

Claims

1. a kind of data processing method characterized by comprising

Determine the current state of multiple previous nodes；Wherein, the multiple previous node is corresponding with present node；

When the current state of the multiple previous node is dbjective state, the corresponding data text of the present node is handled Part；

The corresponding data file of the multiple latter nodes of parallel processing；Wherein, the multiple latter node with it is described current Node is corresponding.

2. the method according to claim 1, wherein further include:

Target directed acyclic graph is determined from multiple directed acyclic graphs according to the first rule file；Wherein, the target is oriented Acyclic figure includes the present node, includes the identification information of the target directed acyclic graph in first rule file.

3. according to the method described in claim 2, it is characterized in that, handling the corresponding data file of the present node, comprising:

According to the corresponding data file of present node described in the corresponding Second Rule file process of the target directed acyclic graph；Institute State the processing rule that Second Rule file includes the corresponding data file of the present node.

4. according to the method described in claim 3, it is characterized in that, the Second Rule file further includes the oriented nothing of the target For indicating the node structure of node execution sequence in ring figure.

5. according to the method described in claim 4, it is characterized by further comprising:

The previous node and the latter node are determined according to the node structure.

6. according to the method described in claim 5, it is characterized by further comprising:

If it is determined that the previous node be sky, then determine the present node for first node；

If it is determined that the latter node be sky, then determine the present node for tail node.

7. according to the method described in claim 3, it is characterized by further comprising:

If monitoring, the modification time of the Second Rule file changes, according to the corresponding modification content of the modification time to institute Second Rule file is stated to be updated.

8. the method according to the description of claim 7 is characterized in that further include:

To before update the Second Rule file and the updated Second Rule file store.

9. a kind of data processing equipment characterized by comprising

Status determining unit, for determining the current state of multiple previous nodes；Wherein, the multiple previous node is and currently Node is corresponding；

Data processing unit, it is described current for handling when the current state of the multiple previous node is dbjective state The corresponding data file of node；

The data processing unit is also used to the corresponding data file of the multiple latter nodes of parallel processing；Wherein, described more A latter node is corresponding with the present node.

10. a kind of computer-readable medium, is stored thereon with computer program, which is characterized in that described program is held by processor Such as data processing method according to any one of claims 1 to 8 is realized when row.

11. a kind of electronic equipment characterized by comprising

One or more processors；

Storage device, for storing one or more programs, when one or more of programs are by one or more of processing When device executes, so that one or more of processors realize such as data processing side according to any one of claims 1 to 8 Method.