CN110019365A - A method of data processing sequence is generated using stack - Google Patents
A method of data processing sequence is generated using stack Download PDFInfo
- Publication number
- CN110019365A CN110019365A CN201711392535.8A CN201711392535A CN110019365A CN 110019365 A CN110019365 A CN 110019365A CN 201711392535 A CN201711392535 A CN 201711392535A CN 110019365 A CN110019365 A CN 110019365A
- Authority
- CN
- China
- Prior art keywords
- node
- data processing
- stack
- data
- dependence
- 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
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Devices For Executing Special Programs (AREA)
Abstract
A method of data processing sequence being generated using stack, step includes establishing data processing model and executing data processing model, and the step of executions data processing model includes data processing node layout and the execution of data model node.The beneficial effect of the application is: can pre-generate node and execute sequence, implementation procedure is not required to judge that it relies on node；The logic for simplifying data model execution, improves the speed of execution.
Description
Technical field
The application belongs to technical field of data processing, specifically, being related to a kind of generating data processing sequence using stack
Method.
Background technique
The data processing of data processing software generally carries out specific data processing algorithm by data processing node mode.
User may include multiple nodes when designing a data handling procedure, and there are dependences between these nodes.Such as one
Part data, need the train value of some character string modifying its value type, then again divided by 100, just need to design two at this time
A data processing node, A (modification column type), B (train value is divided by 100), wherein B relies on A.Therefore a data processing is being executed
Process and when go to some node, whether the node for needing to judge that it is relied on is finished, when the execution of front nodal
When accident occurs, will lead to a series of node cannot be executed, and execution efficiency is low.
Summary of the invention
In view of this, generating data processing sequence using stack the technical problem to be solved by the application is to provide a kind of
Method can pre-generate node and execute sequence, and implementation procedure is not required to judge that it relies on node.
In order to solve the above-mentioned technical problem, this application discloses a kind of methods for generating data processing sequence using stack, and
It is realized using following technical scheme.
A method of data processing sequence being generated using stack, step includes establishing data processing model and executing at data
The step of reason model, the execution data processing model includes that data processing node layout and data model node execute.
Further, the data processing node layout specific steps include:
S1, each node in the data processing model is traversed, judges the dependence between each node；
Node without dependence between S2, determination；
S3, to each, the node without dependence establishes stack respectively each other, and the node for building stack is put into
In corresponding stack；
S4, each node for building stack is searched for by dependence upwards respectively, successively each dependence node is put into corresponding stack；
S5, since being searched for upwards in turn a node to be searched according to the node sequence in corresponding stack, and will execute
The node crossed is marked；
S6, since being executed upwards in turn other pending nodes according to the node sequence in corresponding stack, and will execute
The node crossed is marked, and encounters the node executed and skips.
Further, in the S4 and/or S5, multi input node is such as encountered when search upwards, first according to one
Branch is searched for upwards, returns to the multi input node to other branch search, until whole branches have been searched for after meeting top
At.
Compared with prior art, the application can be obtained including following technical effect: it is suitable can to pre-generate node execution
Sequence, implementation procedure are not required to judge that it relies on node；The logic for simplifying data model execution, improves the speed of execution.
Certainly, any product for implementing the application must be not necessarily required to reach all the above technical effect simultaneously.
Detailed description of the invention
The drawings described herein are used to provide a further understanding of the present application, constitutes part of this application, this Shen
Illustrative embodiments and their description please are not constituted an undue limitation on the present application for explaining the application.In the accompanying drawings:
Fig. 1 is the data processing module handling principle general diagram of the application one embodiment.
Fig. 2 is each node dependence schematic diagram of data processing of the application one embodiment.
Specific embodiment
Presently filed embodiment is described in detail below in conjunction with accompanying drawings and embodiments, how the application is applied whereby
Technological means solves technical problem and reaches the realization process of technical effect to fully understand and implement.
A method of using stack generate data processing sequence, as shown in Figure 1, step include establish data processing model and
Data processing model is executed, executing data processing model includes that data processing node layout and data model node execute.
Present invention is generally directed to " execute data processing model " to optimize, the step of " data processing node layout " is increased
Suddenly, node state is judged for solving the problems, such as that the executive plan of not layout can constantly recall node.
Such as: data processing needs to handle two parts of the first original tables of data D1, the second tables of data D2 data.
First tables of data D1 data lesson data table as shown in table D1, the second tables of data D2 data as shown in table D2 at
Achievement tables of data.
| Course name | Total class hour |
| Higher mathematics | 22 |
| English | 22 |
| Computer | 18 |
Table D1 lesson data table
| Student number | Higher mathematics | English | Computer |
| 201701 | 80 | 85 | 75 |
| 201702 | 88 | 88 | 90 |
Table D2 achievement data table
The structured data request of treated third tables of data D3 is as shown in table D3:
| Student number | Course name | Achievement | Class hour |
| 201701 | Higher mathematics | 80 | 22 |
| 201701 | English | 85 | 22 |
| 201701 | Computer | 75 | 18 |
| 201702 | Higher mathematics | 88 | 22 |
| 201702 | English | 88 | 22 |
| 201702 | Computer | 90 | 18 |
First tables of data after table D3 processing
The structured data request of treated the 4th tables of data D4 is as shown in table D4:
| Student number | Class hour |
| 201701 | 62 |
| 201702 | 62 |
Second tables of data after table D4 processing
First tables of data D1 and the second tables of data D2 are handled, the number of third tables of data D3 and the 4th that obtains that treated
It is as shown in Figure 2 according to each node and its relationship of the process of table D4.Need first to read D1 and D2 respectively, then to the first tables of data
D1 carries out arranging processing of changing one's profession, then the second tables of data D2 for arranging the D1 after changing one's profession and reading is associated.Data one after association
Aspect can directly export third tables of data D3, on the other hand be grouped the processing summarized.Data after being grouped aggregation process can
Directly export the 4th tables of data D4.Wherein line arrow direction represents dependence, i.e. node " column are changed one's profession " depends on node
" reading D1 "；Node " association " is dependent on node " reading D2 " and node " column are changed one's profession "；" grouping converges for node " output D3 " and node
Always " all rely on node " association "；Node " output D4 " depends on node " grouping summarizes ".
The step of handling above data include:
S1, all nodes without dependence each other are determined；
As can be seen from Figure 2, the dependence of each node is layering, as node " output D4 " depends not only upon node
" grouping summarizes ", also recessive depends on node " association ", node " column are changed one's profession ", node " reading D1 " and node " reading D2 ".
It is each other " output D3 " and " output D4 " without the node of any dependence.
S2, stack is established respectively to the node each other without dependence；
S3, each stack is searched for upwards respectively, successively by each dependence node stacking；
For example, D3 stack is as shown in table 5, even higher level of node is " association ":
| ... |
| Association |
| Export D3 |
Table 5
Upwards when search, multi input node is such as encountered, is first searched for upwards according to a branch, such as shown in table 6:
| Read D1 |
| Column are changed one's profession |
| Association |
| Export D3 |
Table 6
The multi input node for searching for return top layer after meeting top upwards according to a branch is searched for an other branch.
If being three or three or more multi input directions at multi input node, successively search for, until search for one completely
Input direction.It thus generates one and executes sequence.Specific example is as shown in table 7:
| Read D2 |
| Read D1 |
| Column are changed one's profession |
| Association |
| Export D3 |
Table 7
Similarly, the stack of " output D4 " is produced, as shown in table 8.It should be noted that can also first search node " reading D2 ",
Search again for node " column are changed one's profession " and node " reading D1 ".
| Read D2 |
| Read D1 |
| Column are changed one's profession |
| Association |
| Grouping summarizes |
| Export D4 |
Table 8
S4, upward execution is carried out to the node needed to be implemented in stack, and the node executed is marked；
By above " data processing node layout " generate two for execution sequence stack, in " data model execution "
In the process, arbitrarily the sequence of stack first carries out one in sequence, is " execution " by the vertex ticks traversed in implementation procedure.
S5, upward execution is carried out to a node other in the stack, the node crossed such as foregoing tags is then skipped
It does not execute.
When executing another again, the node encountered labeled as " execution " then skips execution.Such as above-mentioned output
Two stacks, are first carried out D3 stack, then the node labeled as " execution " is respectively as follows: " reading D2 " -> " reading D1 " -> " column turn
Row " -> " association " -> " output D3 ".When executing D4 stack again, since the above node is the node of " execution ", then only
It needs to execute " grouping summarizes " and " output D4 ".The section that some scripts need to execute again is just saved in such implementation procedure
Point improves the speed of data processing.
The beneficial effect of the application is: can pre-generate node and execute sequence, implementation procedure is not required to judge that it relies on section
Point；The logic for simplifying data model execution, improves the speed of execution.
Above to a kind of method for generating data processing sequence using stack provided by the embodiment of the present application, carry out in detail
It introduces.The description of the example is only used to help understand the method for the present application and its core ideas；Meanwhile for this field
Those skilled in the art, according to the thought of the application, there will be changes in the specific implementation manner and application range, to sum up
Described, the contents of this specification should not be construed as limiting the present application.
As used some vocabulary to censure specific components in the specification and claims.Those skilled in the art answer
It is understood that hardware manufacturer may call the same component with different nouns.This specification and claims are not with name
The difference of title is as the mode for distinguishing component, but with the difference of component functionally as the criterion of differentiation.Such as logical
"comprising", the " comprising " of specification and claim mentioned in are open language, thus should be construed to " include but not
It is defined in "." substantially " refer within the acceptable error range, those skilled in the art can solve within a certain error range
The technical problem basically reaches the technical effect.Specification subsequent descriptions are to implement the better embodiment of the application, so
The description is being not intended to limit the scope of the present application for the purpose of the rule for illustrating the application.The protection of the application
Range is as defined by the appended claims.
It should also be noted that, the terms "include", "comprise" or its any other variant are intended to nonexcludability
Include, so that commodity or system including a series of elements not only include those elements, but also including not clear
The other element listed, or further include for this commodity or the intrinsic element of system.In the feelings not limited more
Under condition, the element that is limited by sentence "including a ...", it is not excluded that in the commodity or system for including the element also
There are other identical elements.
Above description shows and describes several preferred embodiments of the present application, but as previously described, it should be understood that the application
Be not limited to forms disclosed herein, should not be regarded as an exclusion of other examples, and can be used for various other combinations,
Modification and environment, and the above teachings or related fields of technology or knowledge can be passed through in application contemplated scope described herein
It is modified.And changes and modifications made by those skilled in the art do not depart from spirit and scope, then it all should be in this Shen
It please be in the protection scope of appended claims.
Claims (3)
1. a kind of method for generating data processing sequence using stack, step includes establishing data processing model and execution data processing
Model, it is characterised in that: the step of execution data processing model includes data processing node layout and data model node
It executes.
2. the method for generating data processing sequence using stack according to claim 1, it is characterised in that:
The data processing node layout specific steps include:
S1, each node in the data processing model is traversed, judges the dependence between each node；
Node without dependence between S2, determination；
S3, to each, the node without dependence establishes stack respectively each other, and the node for building stack is put into correspondence
In stack；
S4, each node for building stack is searched for by dependence upwards respectively, successively each dependence node is put into corresponding stack；
S5, since being searched for upwards in turn a node to be searched according to the node sequence in corresponding stack, and will execute
Node is marked；
S6, since being executed upwards in turn other pending nodes according to the node sequence in corresponding stack, and will execute
Node is marked, and encounters the node executed and skips.
3. the method for generating data processing sequence using stack according to claim 2, it is characterised in that:
In the S4 and/or S5, multi input node is such as encountered when search upwards, is first searched for upwards according to a branch, is met
It returns to the multi input node behind top to search for an other branch, until whole branch's search are completed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711392535.8A CN110019365A (en) | 2017-12-21 | 2017-12-21 | A method of data processing sequence is generated using stack |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711392535.8A CN110019365A (en) | 2017-12-21 | 2017-12-21 | A method of data processing sequence is generated using stack |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110019365A true CN110019365A (en) | 2019-07-16 |
Family
ID=67187036
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711392535.8A Pending CN110019365A (en) | 2017-12-21 | 2017-12-21 | A method of data processing sequence is generated using stack |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110019365A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111861837A (en) * | 2020-07-28 | 2020-10-30 | 安徽新华博信息技术股份有限公司 | Method for rapidly realizing public safety research and judgment model |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1493995A (en) * | 2002-11-02 | 2004-05-05 | 华为技术有限公司 | Method of control system safety management |
| US7984447B1 (en) * | 2005-05-13 | 2011-07-19 | Oracle America, Inc. | Method and apparatus for balancing project shares within job assignment and scheduling |
| CN102640069A (en) * | 2009-12-04 | 2012-08-15 | 尤米科尔股份公司及两合公司 | A system and method for system automation based on interpreting a tree sequence of operations |
| CN103218692A (en) * | 2013-04-27 | 2013-07-24 | 南京理工大学 | Workflow excavating method based on inter-movement dependency relation analysis |
| CN105824746A (en) * | 2015-01-05 | 2016-08-03 | 中国移动（深圳）有限公司 | Method and device for automatically generating test scheduling based on use case dependencies |
| CN106155651A (en) * | 2015-03-31 | 2016-11-23 | 广州四三九九信息科技有限公司 | The method and system that the automation of application version is issued and updated |
-
2017
- 2017-12-21 CN CN201711392535.8A patent/CN110019365A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1493995A (en) * | 2002-11-02 | 2004-05-05 | 华为技术有限公司 | Method of control system safety management |
| US7984447B1 (en) * | 2005-05-13 | 2011-07-19 | Oracle America, Inc. | Method and apparatus for balancing project shares within job assignment and scheduling |
| CN102640069A (en) * | 2009-12-04 | 2012-08-15 | 尤米科尔股份公司及两合公司 | A system and method for system automation based on interpreting a tree sequence of operations |
| CN103218692A (en) * | 2013-04-27 | 2013-07-24 | 南京理工大学 | Workflow excavating method based on inter-movement dependency relation analysis |
| CN105824746A (en) * | 2015-01-05 | 2016-08-03 | 中国移动（深圳）有限公司 | Method and device for automatically generating test scheduling based on use case dependencies |
| CN106155651A (en) * | 2015-03-31 | 2016-11-23 | 广州四三九九信息科技有限公司 | The method and system that the automation of application version is issued and updated |
Non-Patent Citations (2)
| Title |
|---|
| 南楠: "浅谈二叉树的遍历中栈和队列的应用", 《佳木斯教育学院学报》 * |
| 吉冬梅: "数据结构中二叉树的生成及遍历非递归算法浅析", 《办公自动化杂志》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111861837A (en) * | 2020-07-28 | 2020-10-30 | 安徽新华博信息技术股份有限公司 | Method for rapidly realizing public safety research and judgment model |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR102139425B1 (en) | Reuse of extracted layout-dependent effects for circuit design using circuit stencils | |
| US8209644B2 (en) | Hierarchical partitioning | |
| CN112257366B (en) | CNF generation method and system for equivalence verification | |
| EP3387525B1 (en) | Learning from input patterns in programing-by-example | |
| CN104620242A (en) | Relative timing architecture | |
| Gupta et al. | Automated assumption generation for compositional verification | |
| US20220075920A1 (en) | Automated Debug of Falsified Power-Aware Formal Properties using Static Checker Results | |
| Brown et al. | Four-dimensional projective orbifold hypersurfaces | |
| CA2966491A1 (en) | Methods and systems of four-valued simulation | |
| EP3557455A1 (en) | Verifying hardware design for a component that implements a permutation respecting function | |
| CN110019365A (en) | A method of data processing sequence is generated using stack | |
| US7587305B2 (en) | Transistor level verilog | |
| CN106776275A (en) | A kind of testing process automatic generation method based on Packet Multiplexing | |
| CN106200541A (en) | A kind of method that FBD is converted to AOV structure | |
| Sotudeh et al. | Abstraction and approximation in fuzzy temporal logics and models | |
| KR20140134971A (en) | Method of generating semantic models for FMEA documents | |
| US20030187815A1 (en) | Symbolic simulation driven netlist simplification | |
| Angluin et al. | Query learning of derived $\omega $-tree languages in polynomial time | |
| Garrett | SuperHyperBipartite | |
| Garrett | SuperHyperMultipartite | |
| US20140372817A1 (en) | Automated circuit triplication method and system | |
| Kalyonova et al. | Introduction to Multimodal Data Analysis Approach for Creation of Library Catalogues of Heterogeneous Objects | |
| Pradhan | Enhancement of Turing machine to universal Turing machine to halt for recursive enumerable language and its JFLAP simulation | |
| EP4123454A1 (en) | Validating component specifications for industrial automation systems | |
| Garrett | Neutrosophic SuperHyperConnectivities |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20190716 |
|
| WD01 | Invention patent application deemed withdrawn after publication |