CN109740916A - Based on the time Series Processing method, apparatus and storage medium for calculating flow graph - Google Patents
Based on the time Series Processing method, apparatus and storage medium for calculating flow graph Download PDFInfo
- Publication number
- CN109740916A CN109740916A CN201811628986.1A CN201811628986A CN109740916A CN 109740916 A CN109740916 A CN 109740916A CN 201811628986 A CN201811628986 A CN 201811628986A CN 109740916 A CN109740916 A CN 109740916A
- Authority
- CN
- China
- Prior art keywords
- node
- degree
- subgraph
- calculating
- flow graph
- 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
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention provides a kind of based on the time Series Processing method, apparatus and storage medium that calculate flow graph.Method includes the following steps: subgraph search is carried out based on the given peripheral node for calculating flow graph, subgraph needed for obtaining the calculating peripheral node；The degree of each node in subgraph is recorded, the degree includes in-degree；According to the in-degree of the node of record, the subgraph is traversed, determines that the calculating of node executes sequence；Based on the determining calculating operation calculated between execution sequence progress node, and store calculated result.The embodiment of the present invention can optimize the execution efficiency of time Series Processing.
Description
Technical field
The present invention relates to field of computer technology, more particularly to based on the time Series Processing method, apparatus for calculating flow graph
And computer storage medium.
Background technique
Time series is the series of values observed at equal intervals some physical quantity.Time series is widely present
In actual life, the fields such as finance, medical treatment, biological and chemical are covered.Time series often refers to the calculating stream of very complicated
Journey, and often there is data dependence between these calculation process.
It calculates flow graph and clearly expresses this data dependence.Each process of time Series Processing indicates an operation,
Node table registration evidence, the side between node describe an operation, and operation is described jointly by one or more of sides, the direction table on side
For registration according to the direction of flowing, constructing one with this has direction but the not figure of winding, i.e. calculating flow graph.Time Series Processing is often
Be it is complicated, its calculating flow graph might have multiple starting points, multiple terminals.Starting point indicates data source, and terminal indicates a son
The operation result of figure.
Although calculating flow graph clearly expresses data dependence relation, existing based on the time series parsing for calculating flow graph
Calculation process redundancy and complexity, can not deconstruct out the data dependence relation of time series, and execution efficiency is low.How the time is optimized
The execution efficiency of series processing is a problem to be solved.
Summary of the invention
In consideration of it, the embodiment of the invention provides a kind of time Series Processing method and apparatus based on calculating flow graph, with
Eliminate or improve one or more defects existing in the prior art.
An aspect of of the present present invention provides a kind of based on the time Series Processing method for calculating flow graph comprising following step
It is rapid:
Based on the given peripheral node for calculating flow graph, subgraph search is carried out, obtains son needed for calculating the peripheral node
Figure；
The degree of each node in subgraph is recorded, the degree includes in-degree；
According to the in-degree of the node of record, the subgraph is traversed, determines that the calculating of node executes sequence；
Based on the determining calculating operation calculated between execution sequence progress node, and store calculated result.
Preferably, the step of given peripheral node based on calculating flow graph, progress subgraph search includes: the first search
Step obtains all upstream nodes for being directed toward peripheral node based on given peripheral node, and is recorded；Second search step
Suddenly, the node in record is accessed one by one, the upstream node for being directed toward accessed node is obtained, and recorded, until having accessed
All nodes in record.
Preferably, second search step includes: to take out node one by one from the node of record, obtains to be directed toward and be taken out
Node upstream node and recorded, until take out all nodes from record.
Preferably, the in-degree of the node according to record, traverses the subgraph, determines the calculating execution sequence of node
Step includes: first step, traverses the in-degree of all nodes in subgraph, returns to the node that in-degree is zero；Second step will return
In-degree be zero the in-degree of descendant node be directed toward of node subtract 1；Third step returns to the section that in-degree is zero in descendant node
Point；Second step and third step are repeated, until traversing node to terminal.
Preferably, the degree further includes out-degree.
Preferably, the calculated result of storage is index with nodename.
Another aspect of the present invention also provides a kind of time Series Processing device based on calculating flow graph, which includes:
Subgraph search module carries out subgraph search based on the given peripheral node for calculating flow graph, obtains the calculating terminal section
Subgraph needed for point, and the degree of each node in subgraph is recorded, the degree includes in-degree；Subgraph spider module, according to record
Node in-degree, traverse the subgraph, determine that the calculating of node executes sequence；And computing module, based on determining meter
The calculating operation between execution sequence progress node is calculated, and stores calculated result.
Another aspect of the present invention also provides a kind of time Series Processing device based on calculating flow graph, which includes depositing
Reservoir, processor and storage on a memory and the computer program that can run on a processor, described in the processor execution
The step of method as previously described is realized when program.
According to another aspect of the present invention, a kind of computer readable storage medium is also provided, computer journey is stored thereon with
The step of sequence, which realizes method as previously described when being executed by processor.
Method and apparatus provided in an embodiment of the present invention are able to carry out the optimization that executes of time Series Processing, optimize the time
The execution efficiency of series processing.
It will be appreciated by those skilled in the art that can be not limited to the objects and advantages that the present invention realizes above specific
It is described, and the above and other purpose that the present invention can be realized will be more clearly understood according to following detailed description.
The one or more embodiments of the detail of the affiliated theme of this specification are illustrated in the accompanying drawings and the following description.Refering to saying
Bright book, drawings and claims, other features, aspect and the advantage of the theme will be evident.It will be appreciated that can be by this
A little aspects and embodiment combination, and the upper and lower feature described in the text of one aspect or embodiment can be in other respects
Or it is realized in the context of embodiment.
Detailed description of the invention
The drawings described herein are used to provide a further understanding of the present invention, constitutes part of this application, not
Constitute limitation of the invention.In the accompanying drawings:
Fig. 1 shows the process flow diagram that time series in one embodiment of the application calculates flow graph.
The flow chart of subgraph search in one embodiment of the application is shown in Fig. 2.
Fig. 3 shows the flow chart of subgraph traversal step in one embodiment of the application.
Fig. 4 shows the process flow diagram that time series in another embodiment of the application calculates flow graph.
Fig. 5 shows time series in one embodiment of the application and calculates flow graph example.
Fig. 6 shows the subgraph search example in one embodiment of the application in time series calculating flow graph processing.
Fig. 7 shows time series in one embodiment of the application and calculates flow graph processing example.
The data that Fig. 8 shows the MMU memory management unit that time series flow graph respectively walks execution in one embodiment of the application are shown
Example.
Specific embodiment
To make the objectives, technical solutions, and advantages of the present invention clearer, right below with reference to embodiment and attached drawing
The present invention is described in further details.Here, exemplary embodiment and its explanation of the invention is used to explain the present invention, but simultaneously
It is not as a limitation of the invention.
Here, it should also be noted that, in order to avoid having obscured the present invention because of unnecessary details, in the accompanying drawings only
Show with closely related structure and/or processing step according to the solution of the present invention, and be omitted little with relationship of the present invention
Other details.
It should be emphasized that term "comprises/comprising" refers to the presence of feature, element, step or component when using herein, but simultaneously
It is not excluded for the presence or additional of one or more other features, element, step or component.
Here, it should also be noted that, in the absence of conflict, the features in the embodiments and the embodiments of the present application
It can be combined with each other.
It is an object of the present invention to provide a kind of based on the time Series Processing method for calculating flow graph, can be efficiently
Realize the processing of time series.The step of this method, is as shown in Figure 1, include step S10-S40.
Subgraph search is carried out, is counted according to the given peripheral node (abbreviation terminal) for calculating flow graph in step S10
Subgraph needed for calculating this terminal.
The step is subgraph search step, can be executed by subgraph search module.Calculating flow graph might have multiple
Point and multiple terminals can use subgraph search block search and obtain calculating the terminal for calculating the given terminal of flow graph
All nodes needed, these nodes constitute a subgraph, that is, subgraph needed for calculating the terminal.
As shown in Fig. 2, the step of executing subgraph search is as follows:
Step S110, for giving terminal, the node of acquisition with the direction terminal is simultaneously recorded.
Step S120 takes out a node from the node of record, obtains the upstream node for being directed toward the node taken out, goes forward side by side
Row record.
Here, upstream node refers to the one or more nodes for the node that direction is taken out in subgraph.
Step S130 illustrates that subgraph search has been completed if node is not present in record.If in record, there is also sections
Point, then repeatedly step S120.
In step S20, the degree of each node in subgraph is recorded.
For example, the degree of each node in subgraph can be recorded during subgraph search, which may include out-degree and in-degree,
Middle out-degree indicates the number of nodes that the node is directed toward, and in-degree indicates that how many node is directed toward the node.In another embodiment of the present invention
In, the degree of each node of record can also only include in-degree information.
Subgraph is traversed, determines that the operation of node executes sequence according to the in-degree of the node of record in step S30.
Operation in heretofore described time Series Processing method, by all sides of direction node in calculating flow graph
It is described with node, is directed toward the input data of other node on behalf of node operation, the side between them describes specifically
Operation content, this operation contains some simple calculations or function, such as addition subtraction multiplication and division, rolling average etc..
This step is subgraph traversal step, can determine that there is no data dependences each other based on the in-degree of the node of record
Node, to the data dependence relation of time series be deconstructed out, to determine the behaviour of node based on data dependence relation
Work executes sequence, such as determination is parallel execution or serially executes operation.
Subgraph traversal step can be executed by subgraph spider module, and the subgraph spider module in the present invention is for being directed to
The in-degree of one given subgraph and subgraph interior joint returns to the node currently without data dependence every time.
As an example, subgraph traverse the step of may include following steps, as shown in Figure 3:
Step S311 traverses the in-degree of the node in subgraph, and the node that in-degree is 0 is returned.
For example, the in-degree of the node in subgraph can be traversed, the node that in-degree is 0 and currently has not visited is accessed, by in-degree
It is returned for 0 node as search result, once returns to one or more node.
In-degree means that no node is directed toward the node for 0, i.e., does not have data dependence between the node that in-degree is 0.No
Operation between the node of data dependence can be carried out simultaneously and concurrently, be independent of each other.
The in-degree for the descendant node that return node is directed toward is subtracted 1 by step S312.
Step S313 returns to the node if there is the in-degree of node to be kept to 0 in these descendant nodes.
In the case where not traversing the terminal in subgraph, return step S311, it is 0 and current for continuing to return in-degree
The node having not visited.If traversing terminal, subgraph traversal step terminates.
In step S40, sequence is executed based on the operation of determining node, one or more node is once taken out and is counted
It calculates, and the result being calculated is saved.
In this step, saved using data of the MMU memory management unit to the intermediate node in subgraph calculating process.
This step can execute in subgraph ergodic process, can also execute after subgraph traversal step.Fig. 4 is shown
The illustrative time series of the present invention one calculates the process flow diagram of flow graph, and in Fig. 4, step S100 is the same as step S10, step S200
With step S20, node calculated result saves step S400 and executes between subgraph traversal step S300, S500.
In a preferred embodiment of the invention, the data of preservation can be also indexed by nodename, so as to fast
Result data is got promptly.
The present invention will be described by taking a specific example as an example below.Fig. 5 is the calculating flow graph an of time series
Example, it includes multiple starting points, multiple terminals, if node d1, d2, d4, d7 are starting point, node d11, d12, d10 are end
Point.In Fig. 5, ts_max (d3,5) indicates to be maximized arithmetic operation with window size to node d3 for 5；ts_min(d5,15)
It indicates to be minimized arithmetic operation with window size to node d5 for 15；ts_add(d1,d2),ts_add(d6,d7),ts_add
(d8, d9) respectively indicates the operation of the add operation between two nodes；Ts_sub (d3, d5) indicates the subtraction between node d3, d5
Arithmetic operation；Ts_corr (d7, d9) indicates the arithmetic operation that related coefficient is sought between node d7, d9；ts_movavg(d7,10)
Indicate that node d7 be 10 arithmetic operations for seeking sliding average with window size.Fig. 7 be acquisition time sequence calculate flow graph in
Determine the example of node (terminal) d10 processing result, as shown in fig. 7, the treatment process the following steps are included:
Step S1: from node d10, flow graph is calculated to time series shown in fig. 5 and carries out subgraph search, obtains Fig. 7
Shown in subgraph, while counting the in-degree and out-degree of each node.
Fig. 6 is the subgraph search example that time series calculates in flow graph processing in an embodiment, as shown in fig. 6, subgraph is searched
The step of rope, is as follows:
Step S11: setting out using terminal d10 as starting point, records lower node d10；
Step S12: the node d8 and d9 of d10 are directed toward in access, and are recorded；
Step S13: access is directed toward the node d7 of d9 and is recorded；
Step S14: access is directed toward the node d7 and d6 of d8 and is recorded；
Step S15: the node d3 and d5 of d6 are directed toward in access, and are recorded；For d7, since there is no the section for being directed toward d7
Point, therefore there is no respective record.
Step S16: access is directed toward the node d4 of d5 and is recorded；
Step S17: the node d1 and d2 of d3 is directed toward in access, is recorded, and so far subgraph search is completed.
Referring back to Fig. 7, in step S2: obtained subgraph is traversed, node d1, d2, d4, d7 that access in-degree is 0,
And return to the node (each node data is put into MMU memory management unit) that in-degree is 0, the example of unit records such as Fig. 8 institute
Show.In Fig. 8, in S11 " NA " expression be recorded as sky, in S22 " 1,2,4,7 " indicate node d1, d2, d4, d7 data, be
With the entitled index of node, result data can be quickly got in search.After the data for obtaining node d1, d2, d4, d7,
Remaining calculative node is as shown in the S2 in Fig. 7.
Step S3: by the in-degree of node d1, d2, d4, d7 that the in-degree of return is 0 descendant node d3, d5 and d9 being directed toward
Subtract 1, and access node d3, d5 and d9 that in-degree is 0, is performed in parallel and calculates d3=ts_add (d1, d2), d5=ts_max
(d3,5) and d9=ts_max (d7,10), and result is put into MMU memory management unit, as shown in the S33 in Fig. 8.Obtain node
After the data of d3, d5 and d9, remaining calculative node is as shown in the S2 in Fig. 7.
Step S4: the in-degree of node d3, d5, d9 that the in-degree of return is 0 descendant node d6 being directed toward are subtracted 1 (this time
1) in-degree of point d10 becomes, and access the node d6 that in-degree is 0, calculates d6=ts_sub (d3, d5), and the result of d6 is put
Enter MMU memory management unit, as shown in the S44 in Fig. 8.
Step 5: the in-degree of the node d6 that the in-degree of return the is 0 descendant node d8 being directed toward being subtracted 1, and accessing in-degree is 0
Node d8, calculate d8=ts_add (d6, d7), the result of d8 is put into MMU memory management unit, as shown in the S55 in Fig. 8.
Step 6: by the in-degree of the node d8 that the in-degree of return the is 0 descendant node d10 being directed toward (the node d10 at this time that subtracts 1
0) in-degree becomes, and access the node d10 that in-degree is 0, calculates d10=ts_add (d8, d9), the result of d10 is put into storage
Administrative unit, obtain terminal d10's as a result, calculate flow graph processing complete.
MMU memory management unit in the present invention saves the data of the intermediate node in subgraph calculating process, passes through
Nodename is indexed, and can quickly get result data.
Time Series Processing method based on calculating flow graph present invention as described above, for holding for time Series Processing
Row optimization, optimizes the execution efficiency of time Series Processing.The subgraph search module that the processing method provides, can be complicated by one
The calculating flow graph of redundancy is parsed into the calculating subgraph of operation needs, reduces many unwanted operations, substantially increases execution
Efficiency.The subgraph spider module of this method provides an optimal node and executes sequence, it is by the data dependence of time series
Destructing comes out, and thus the node of data dependence can not carry out operation simultaneously.The MMU memory management unit of this method provides fastly
The function of fast index node data allows the operation of each node that can quickly and conveniently get input data.
Correspondingly with preceding method, the present invention also provides a kind of based on the time Series Processing system for calculating flow graph, this is
System can subgraph search module, subgraph spider module and computing module.Wherein subgraph search module is based on the given of calculating flow graph
Peripheral node carries out subgraph search, subgraph needed for obtaining the calculating peripheral node, and records each node in subgraph
Degree (may include out-degree and in-degree)；Subgraph spider module traverses the subgraph, determines node according to the in-degree of the node of record
Calculating execute sequence；Computing module stores calculated result based on determining calculating execution sequence calculating operation.
Above-mentioned each module can be realized with computer software or example, in hardware.
For software realization, the present invention also provides a kind of at the present invention also provides a kind of based on the time series for calculating flow graph
Reason system should include processor and memory, and memory is for storing computer instruction, and the processor is for executing in memory
The computer instruction of storage, when computer instruction is executed by processor, the system realizes each method and step as previously described.
The invention further relates to storage mediums, can store computer program code thereon, when program code is performed
It may be implemented the various embodiments of method of the invention, which can be tangible media, such as CD, USB flash disk, soft
Disk, hard disk etc..
Those of ordinary skill in the art should be it will be appreciated that each example described in conjunction with embodiment disclosed herein
The component part of property, system and method can be realized with the combination of hardware, software or the two.Specifically actually with hardware also
It is software mode to execute, the specific application and design constraint depending on technical solution.Professional technician can be to every
A specific application uses different methods to achieve the described function, but this realizes it is not considered that beyond of the invention
Range.When realizing in hardware, it may, for example, be electronic circuit, specific integrated circuit (ASIC), firmware appropriate, insert
Part, function card etc..When being realized with software mode, element of the invention is used to execute program or the generation of required task
Code section.Perhaps code segment can store in machine readable media program or the data-signal by carrying in carrier wave is passing
Defeated medium or communication links are sent." machine readable media " may include any medium for capableing of storage or transmission information.
The example of machine readable media includes electronic circuit, semiconductor memory devices, ROM, flash memory, erasable ROM (EROM), soft
Disk, CD-ROM, CD, hard disk, fiber medium, radio frequency (RF) link, etc..Code segment can be via such as internet, inline
The computer network of net etc. is downloaded.
It should also be noted that, the exemplary embodiment referred in the present invention, is retouched based on a series of step or device
State certain methods or system.But the present invention is not limited to the sequence of above-mentioned steps, that is to say, that can be according in embodiment
The sequence referred to executes step, may also be distinct from that the sequence in embodiment or several steps are performed simultaneously.
In the present invention, feature embodiment description and/or illustrated for one can be in one or more other realities
It applies in mode and uses in the same manner or in a similar manner, and/or combine with the feature of other embodiments or replace other
The feature of embodiment.
It should be noted that each step introduced in above-described embodiment is all not necessary, those skilled in the art
Can carry out according to actual needs it is appropriate accept or reject, replacement, modification etc..
The foregoing is only a preferred embodiment of the present invention, is not intended to restrict the invention, for the skill of this field
For art personnel, the embodiment of the present invention can have various modifications and variations.All within the spirits and principles of the present invention, made
Any modification, equivalent substitution, improvement and etc. should all be included in the protection scope of the present invention.
Claims (10)
1. a kind of based on the time Series Processing method for calculating flow graph, which is characterized in that method includes the following steps:
Based on the given peripheral node for calculating flow graph, subgraph search is carried out, son needed for obtaining the calculating peripheral node
Figure；
The degree of each node in subgraph is recorded, the degree includes in-degree；
According to the in-degree of the node of record, the subgraph is traversed, determines that the calculating of node executes sequence；
Based on the determining calculating operation calculated between execution sequence progress node, and store calculated result.
2. the method according to claim 1, wherein described based on the given peripheral node for calculating flow graph, progress
The step of subgraph search includes:
First search step obtains all upstream nodes for being directed toward peripheral node based on given peripheral node, and is remembered
Record；
Second search step, the node in access record, obtains the upstream node for being directed toward accessed node, and remembered one by one
Record, until having accessed all nodes in record.
3. according to the method described in claim 2, it is characterized in that, second search step includes:
It takes out node one by one from the node of record, obtain the upstream node for being directed toward taken out node and is recorded, until
All nodes are taken out from record.
4. the method according to claim 1, wherein the in-degree of the node according to record, traverses the son
Figure, the step of determining the calculating execution sequence of node include:
First step traverses all nodes in subgraph, returns to the node that in-degree is zero；
The in-degree for the descendant node that the node that the in-degree of return is zero is directed toward is subtracted 1 by second step；
Third step returns to the node that in-degree is zero in descendant node；
Second step and third step are repeated, until traversing node to terminal.
5. the method according to claim 1, wherein the degree further includes out-degree.
6. the method according to claim 1, wherein using nodename as index in the calculated result of storage.
7. the method according to claim 1, wherein the calculating execution sequence of the determination includes: between node
Parallel execution sequence executes sequence with serial.
8. a kind of based on the time Series Processing device for calculating flow graph, which is characterized in that the device includes:
Subgraph search module carries out subgraph search based on the given peripheral node for calculating flow graph, obtains the calculating end
Subgraph needed for point node, and the degree of each node in subgraph is recorded, the degree includes in-degree；
Subgraph spider module traverses the subgraph according to the in-degree of the node of record, determines that the calculating of node executes sequence；
And
Computing module based on determining calculating execution sequence calculating operation, and stores calculated result.
9. a kind of based on the time Series Processing device for calculating flow graph, which includes memory, processor and is stored in storage
On device and the computer program that can run on a processor, which is characterized in that the processor is realized such as when executing described program
The step of any one of claims 1 to 7 the method.
10. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the program is by processor
It realizes when execution such as the step of any one of claims 1 to 7 the method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811628986.1A CN109740916A (en) | 2018-12-28 | 2018-12-28 | Based on the time Series Processing method, apparatus and storage medium for calculating flow graph |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811628986.1A CN109740916A (en) | 2018-12-28 | 2018-12-28 | Based on the time Series Processing method, apparatus and storage medium for calculating flow graph |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109740916A true CN109740916A (en) | 2019-05-10 |
Family
ID=66361956
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811628986.1A Pending CN109740916A (en) | 2018-12-28 | 2018-12-28 | Based on the time Series Processing method, apparatus and storage medium for calculating flow graph |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109740916A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111190918A (en) * | 2019-12-25 | 2020-05-22 | 中科驭数（北京）科技有限公司 | Database access method and device based on computational flow graph |
| CN111190768A (en) * | 2019-12-25 | 2020-05-22 | 中科驭数（北京）科技有限公司 | Database execution error recovery method, database access method and device |
| WO2021129645A1 (en) * | 2019-12-27 | 2021-07-01 | 深圳鲲云信息科技有限公司 | Method, system and device for parallel processing of data, and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101325601A (en) * | 2008-07-31 | 2008-12-17 | 南京大学 | Method for choosing service based on quality dependency relationship under service composite surroundings |
| CN109063056A (en) * | 2018-07-20 | 2018-12-21 | 阿里巴巴集团控股有限公司 | A kind of data query method, system and terminal device |
-
2018
- 2018-12-28 CN CN201811628986.1A patent/CN109740916A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101325601A (en) * | 2008-07-31 | 2008-12-17 | 南京大学 | Method for choosing service based on quality dependency relationship under service composite surroundings |
| CN109063056A (en) * | 2018-07-20 | 2018-12-21 | 阿里巴巴集团控股有限公司 | A kind of data query method, system and terminal device |
Non-Patent Citations (1)
| Title |
|---|
| 匿名: "怎么构建一个有向无环图中某个节点所依赖的所有节点组成的子图", 《WWW.MYEXCEPTION.CN/CPP/285026.HTML》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111190918A (en) * | 2019-12-25 | 2020-05-22 | 中科驭数（北京）科技有限公司 | Database access method and device based on computational flow graph |
| CN111190768A (en) * | 2019-12-25 | 2020-05-22 | 中科驭数（北京）科技有限公司 | Database execution error recovery method, database access method and device |
| CN111190768B (en) * | 2019-12-25 | 2020-10-16 | 中科驭数（北京）科技有限公司 | Database execution error recovery method, database access method and device |
| WO2021129645A1 (en) * | 2019-12-27 | 2021-07-01 | 深圳鲲云信息科技有限公司 | Method, system and device for parallel processing of data, and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109740916A (en) | Based on the time Series Processing method, apparatus and storage medium for calculating flow graph | |
| Tardos | A strongly polynomial algorithm to solve combinatorial linear programs | |
| EP3072070B1 (en) | Callpath finder | |
| Van Dongen et al. | Aligning modeled and observed behavior: A compromise between computation complexity and quality | |
| CN105474172B (en) | The efficient directed acyclic graph pattern match for dividing for realizing code and being executed on heterogeneous processor kernel | |
| US9286032B2 (en) | Automated software composition | |
| CN111506900B (en) | Vulnerability detection method and device, electronic equipment and computer storage medium | |
| Trummer et al. | Multi-objective quality-driven service selection—A fully polynomial time approximation scheme | |
| CN101751333A (en) | Method, computer program and computer system for assisting in analyzing program | |
| US8793673B2 (en) | Algorithm complexity identification | |
| EP3665593A2 (en) | Inclusion dependency determination in a large database for establishing primary key-foreign key relationships | |
| US20190303266A1 (en) | String transformation based trace classification and analysis | |
| US9256411B2 (en) | Strength reduction compiler optimizations | |
| CN112965710B (en) | Calculation graph processing method, device and system | |
| US8103674B2 (en) | E-matching for SMT solvers | |
| US8769515B2 (en) | Semantic intensity based decomposition of software systems | |
| Gleixner et al. | Papilo: A parallel presolving library for integer and linear optimization with multiprecision support | |
| CN113407752B (en) | Graph database memory management method, system, electronic device and storage medium | |
| CN113157720B (en) | Query statement processing method, device, equipment and medium | |
| US20180074794A1 (en) | Selecting cobol perform statements for inlining | |
| Romeijn et al. | Computational complexity of finding Pareto efficient outcomes for biobjective lot‐sizing models | |
| US8739114B2 (en) | Using infeasible nodes to select branching variables | |
| CN116340461A (en) | Knowledge graph massive data graph query method and system with knowledge graph massive data graph query method | |
| CN117271586A (en) | Data processing method, device, server and medium supporting configuration | |
| Boissinot et al. | Liveness |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190510 |