CN111258547A - Operation processing method, system, device and computer readable medium - Google Patents
Operation processing method, system, device and computer readable medium Download PDFInfo
- Publication number
- CN111258547A CN111258547A CN201811465185.8A CN201811465185A CN111258547A CN 111258547 A CN111258547 A CN 111258547A CN 201811465185 A CN201811465185 A CN 201811465185A CN 111258547 A CN111258547 A CN 111258547A
- Authority
- CN
- China
- Prior art keywords
- expression
- calculation
- arithmetic processing
- processing method
- calculation unit
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
- G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
- G06F7/57—Arithmetic logic units [ALU], i.e. arrangements or devices for performing two or more of the operations covered by groups G06F7/483 – G06F7/556 or for performing logical operations
Abstract
The embodiment of the invention provides an operation processing method, an operation processing system, an operation processing device and a computer readable medium. The method adopts a calculation engine to carry out numerical operation, and the calculation engine comprises the following steps: receiving a first expression; dividing the first expression into a plurality of computational units, each computational unit comprising a left factor, an operator, and a right factor; sorting the plurality of computing elements by priority of the included operators; calculating the plurality of calculation units for multiple times according to the sequence of the priority from high to low, and replacing the left and/or right factors of the calculation unit calculated this time before each calculation until a final result value is obtained based on the calculation unit calculated last; and outputting the final result value. The embodiment of the invention calculates the calculation units for many times according to the priority of the operator, so that the whole calculation process becomes very intuitive, and the research personnel can quickly locate the problem conveniently.
Description
Technical Field
The present invention relates to the field of computer technologies, and in particular, to an operation processing method, system, apparatus, and computer readable medium.
Background
Minor errors in the financial field all contribute to significant losses. When errors occur, workers often spend a great deal of time locating problems. This is because, at the code level, the JAVA system mostly uses the BigDecimal object to process the four fundamental operations with high precision. Although BigDecimal supports floating point number operation with any precision and any length, the calculation process is not intuitive by adopting a method to replace an operator, and research personnel need to add descriptive language to the log in order to enable the log to be more intuitive. This also causes workload to developers, and it is not ensured that each developer outputs logs according to the set specifications.
Therefore, how to enable research and development personnel to quickly locate the problems occurring in the calculation process under the condition of not increasing the workload is a problem worthy of solving in the prior art.
Disclosure of Invention
In view of this, embodiments of the present invention provide an operation processing method, system, apparatus, and computer readable medium to solve the problem that a developer is not easy to locate a problem occurring in a calculation process.
According to a first aspect of the embodiments of the present invention, there is provided an arithmetic processing method including:
receiving a first expression;
dividing the first expression into a plurality of computational units, each computational unit comprising a left factor, an operator, and a right factor;
sorting the plurality of computing elements by priority of the included operators;
calculating the plurality of calculation units for multiple times according to the sequence of the priority from high to low, and replacing the left and/or right factors of the calculation unit calculated this time before each calculation until a final result value is obtained based on the calculation unit calculated last;
and outputting the final result value.
Optionally, the method further comprises:
receiving a second expression;
detecting brackets in the second expression; and
and when the second expression comprises at least one bracket, the bracket is used as a separator to convert the second expression into at least two first expressions.
Optionally, the method further comprises: and obtaining a final result value of the second expression through recursive calculation.
Optionally, the method further comprises: and establishing a data structure for each calculation unit, wherein the data structure comprises a left unit, a left factor, an operator, a right factor and a right unit.
Optionally, the method further comprises: a linked list is used to store a plurality of said data structures.
Optionally, the method further comprises: before calculating a calculation unit each time, if the left unit of the corresponding data structure is not empty, the result value of the adjacent left calculation unit is used for replacing the left factor of the corresponding data structure.
Optionally, the method further comprises: before calculating one calculation unit each time, if the right unit of the corresponding data structure is not empty, the result value of the adjacent right calculation unit is used for replacing the right factor of the corresponding data structure.
Optionally, each computational cell is computed using a BigDecimal object.
Optionally, the first expression is a character string, and the dividing the first expression into a plurality of computing units includes:
dividing the character string into a character string array consisting of numerical values and operators;
and combining the adjacent numerical values and the operators in the character string array into the plurality of computing units.
Optionally, the method further comprises: and if the first expression comprises a variable, replacing the variable by a variable value.
According to a second aspect of the embodiments of the present invention, there is provided an arithmetic processing system including:
a receiving module, configured to receive a first expression;
a first division module that divides the first expression into a plurality of computational units, each computational unit including a left factor, an operator, and a right factor;
the sorting module is used for sorting the plurality of computing units according to the priorities of the contained operators;
the calculation module is used for calculating the calculation units for multiple times according to the sequence of the priority from high to low, and before each calculation, replacing the left and/or right factors of the calculation unit calculated this time until the final result value is obtained based on the calculation unit calculated last;
and the output module is used for outputting the final result value.
Optionally, the method further comprises:
the second dividing module is used for receiving a second expression, detecting brackets in the second expression, and converting the second expression into at least two first expressions by taking the brackets as separators when the second expression contains at least one bracket.
According to a third aspect of embodiments of the present invention, there is provided a computer-readable storage medium storing computer instructions that, when executed, implement any one of the operation processing methods described above.
According to a fourth aspect of the embodiments of the present invention, there is provided an arithmetic processing device including:
a memory for storing computer instructions;
a processor coupled to the memory, the processor configured to perform an arithmetic processing method implementing any of the above based on computer instructions stored by the memory.
One embodiment of the present invention has the following advantages or beneficial effects: the expression is stored into a calculation unit, and the calculation unit is calculated for multiple times according to the priority of an operator, so that the whole calculation process becomes very visual, and the rapid problem positioning by research personnel is facilitated.
In some embodiments, all steps of the operation processing method are included in a single functional module, and when a problem occurs, a developer can concentrate on checking codes of the functional module, so that the problem that problem positioning is not easy due to dispersion of the functional modules is solved.
In some embodiments, the calculation steps of each calculation unit are recorded into a log, so that each calculation step is clearly visible, and the rapid positioning of problems based on the log is facilitated for research and development personnel.
Drawings
The above and other objects, features and advantages of the present invention will become more apparent by describing embodiments of the present invention with reference to the following drawings, in which:
FIG. 1 is a flow chart of an operation processing method according to an embodiment of the invention;
FIGS. 2a-2c are schematic diagrams of computing a computational cell in multiple passes, according to an embodiment of the invention;
3a-3c are schematic diagrams of processing an expression containing parentheses according to an embodiment of the present invention;
FIG. 4 is a block diagram of an arithmetic processing system according to an embodiment of the present invention;
fig. 5 is a structural diagram of a data request management apparatus according to an embodiment of the present invention.
Detailed Description
The present invention will be described below based on examples, but the present invention is not limited to only these examples. In the following detailed description of the present invention, certain specific details are set forth. It will be apparent to one skilled in the art that the present invention may be practiced without these specific details. Well-known methods, procedures, and procedures have not been described in detail so as not to obscure the present invention. The figures are not necessarily drawn to scale.
Fig. 1 is a flowchart of an operation processing method according to an embodiment of the present invention. The operation processing method receives the expression and outputs the result value of the expression. Preferably, all steps of the operation processing method are contained in a single functional module, so that centralized processing of numerical operation is realized, and problem location and troubleshooting are facilitated. In some embodiments, the computing engine executing the arithmetic processing method is deployed on an independent server or server cluster, and the application programs deployed on other servers or server clusters send expressions to the computing engine and receive result values. The staff member checks the result value, and if the result value is found to be inconsistent with the expectation, the staff member checks each calculation step of the calculation engine to determine that the problem is located.
Referring to fig. 1, the arithmetic processing method specifically includes the following steps.
In step S100, an expression is received.
In the present embodiment, the expression is defined to contain only numerical values and operators.
In step S101, the expression is converted into a plurality of calculation units.
The computing units are memory units created in memory, each computing unit containing a left factor, an operator, and a right factor. Both the left and right factors are numerical values. Operators such as add, subtract, multiply, divide. For example, expression 2 x 5-2/3 translates to three calculation units: 2*5,5-2,2/3.
In some embodiments, the expression is a string, the string is first partitioned according to values and operators to form a string array, and if the string array is formed by 2 × 5-2/3: 2, 5, 2, 4, and then manufacturing the three computing units according to the character string array, wherein the manufacturing method comprises the following steps: and positioning the position of each operator, and combining the left and right elements adjacent to one operator with the operator to obtain a computing unit.
In step S102, the calculation units are sorted by the priority of the operator.
In this step, the operators are fetched from the storage units corresponding to the calculation units, and the calculation units are sorted according to the priorities of the operators. For example, the results of the above three calculation unit rankings are 2 × 5, 2/3, 5-2, 2 × 5 and 2/3 with the same priority, so the two are not ranked in order.
In step S103, the calculation units are acquired in order of priority.
In step S104, the acquired calculation unit is calculated.
In step S105, the result value of the current computing unit is used to replace the left or right factor of the corresponding position of the next computing unit.
In step S106, all the calculation units have been completed. If not, S103 is executed, otherwise, step S107 is executed.
Steps S103 to S106 are a loop process in which the calculation units are calculated in the order of priority of operators included in the calculation units, and the result value of the already calculated calculation unit is used to replace the left factor or the right factor of the next calculation unit.
In step S107, the result value is output.
In the embodiment of the invention, the calculation unit is calculated for multiple times according to the priority of the operator, so that the whole calculation process becomes very intuitive.
For steps S103 to S107, the following describes in more detail three calculation units 2 × 5, 5-2, 2/3 obtained by expression 2 × 5-2/3 as an example. Fig. 2a-2c are schematic diagrams of computing a computational cell in multiple passes, according to an embodiment of the invention.
In fig. 2a-2c, 201, 202 and 203 are data structures established for three calculation units, and the data structures are used for describing the attributes of the calculation units and the adjacent relations with other calculation units. The data structure is designed to include an ID, a left element, a left factor, an operator, a right factor, and a right element.
Referring to fig. 2a, structure 201 depicts a computation element 2 x 5 with ID 1, left element empty, i.e. without neighboring computation elements on its left side, left factor 2, operator x, right factor 5, right element: the cell with ID 2, i.e. the adjacent calculation cell on the right side, is: 5-2.
Referring to fig. 2b, according to the priority of the operator, first, calculation unit 1 is calculated, resulting in a result value of 10, the left factor of calculation unit 2 is replaced with 10, and the data structure of calculation unit 1 is removed from the queue.
Referring to fig. 3b, if the calculation unit 3 is calculated again according to the priorities of the operators to obtain a result value of 0.67, the right factor of the calculation unit 2 is replaced with 0.67, and the result value of the calculation unit 3, i.e. the value of (10-0.67), is finally output
In this example, a data structure is generated from each compute unit and the data results are placed in a queue, the computation of each compute unit is completed multiple times according to priority, after the computation of one compute unit is completed, its corresponding data structure is deleted and the result value is used to replace the left or right factor of an adjacent compute unit.
In one embodiment, the data items of the "left cell" and the "right cell" in the above-mentioned node are set as pointers for pointing to the adjacent left cell and right cell, and the pointers are null if there is no responsive left cell or right cell. Thereby converting the computation of the expression into a linked list. And finally, processing the linked list through a program code to obtain a result value of the expression.
It should be noted that, in the above-described embodiments, the case where parentheses are included in the expression is excluded. This is because the calculation of an expression containing parentheses can be handled as the calculation of a plurality of expressions containing no parentheses.
For example, expression 2 × 3+ 2/3 can be processed into expression (3+2) and expression (2 × 5/3), i.e., the value in the parentheses is preferably calculated, and the expression in the original parentheses is replaced with the result value. If for nested brackets, the resulting value of the expression in brackets can be computed multiple times in a recursive computation until the final value is obtained.
3a-3c are schematic diagrams of processing an expression containing parentheses according to an embodiment of the present invention. The present embodiment illustrates how to convert an expression containing parentheses into an expression not containing parentheses, taking the expression (4+3) × 10 as an example.
As shown in fig. 3a, firstly, pushing the numerical value and the operator corresponding to the expression to the main stack 300, then establishing a queue 310, placing the numerical value and the operator in parentheses read from the main stack 300 in the queue 310 as shown in fig. 3b, calculating the queue 310 to obtain a result value 7, placing the result value 7 back in the main stack 300 as shown in fig. 3c, and finally obtaining a final numerical value for the numerical value and the operator in the main stack. If the expression contains nested brackets, the left bracket and the corresponding right bracket which are positioned at the innermost part of the expression are firstly found, the numerical value and the operator are taken out from the left bracket and the right bracket and are put in a queue for calculation, and then the bracket positioned at the innermost part is replaced by the result value. And so on.
It should also be noted that, in order to ensure the calculation accuracy, the BigDecimal method is preferably used for the calculation of each calculation unit. Moreover, the calculation process of each calculation unit is recorded in a log for the convenience of the staff to check each step later. More preferably, the arithmetic processing method records a log when receiving the expression, then records a plurality of logs in the calculation process of each calculation unit, and finally records a log when outputting the final result value.
It should be noted that the received expression may include not only values, operators, brackets, but also variables, and if included, the variables should be replaced with variable values before calculation. Of course, a better way is to replace all variables in an expression before passing it to the compute engine.
FIG. 4 is a block diagram of an arithmetic processing system according to an embodiment of the present invention. The arithmetic processing system 400 includes a receiving module 401, a first partitioning module 402, a sorting module 404, a calculating module 404, and an output module 405.
The receiving module 401 is configured to receive a first expression.
The first partitioning module 402 partitions the first expression into a plurality of computational units, each computational unit including a left factor, an operator, and a right factor.
The sorting module 404 is configured to sort the plurality of computing units by priority of the included operators.
The calculation module 404 is configured to calculate the calculation units multiple times in the order of priority from high to low, and before each calculation, replace the left and/or right factors in the calculation until the calculation unit based on the last calculation obtains the final result value.
The output module 405 is used to output the final result value.
In one embodiment, the arithmetic processing system 400 further comprises: the second dividing module is used for receiving a second expression, detecting brackets in the second expression, and converting the second expression into at least two first expressions by taking the brackets as separators when the second expression contains at least one bracket.
The operation processing system provided by the embodiment of the invention calculates the calculation unit for multiple times according to the priority of the operator, so that the whole calculation process becomes very intuitive. All steps of the operation processing system can be contained in a single functional module, therefore, when problems occur, research personnel can concentrate on checking codes of the functional module, and the problem that problem checking is not easy due to dispersion of the functional module is solved.
Fig. 5 is a structural diagram of a data request management apparatus according to an embodiment of the present invention. The apparatus shown in fig. 5 is only an example and should not limit the functionality and scope of use of embodiments of the present invention in any way.
Referring to fig. 5, the apparatus includes a processor 501, a memory 502, and an input-output device 503, which are connected by a bus. Memory 502 includes Read Only Memory (ROM) and Random Access Memory (RAM), with various computer instructions and data required to perform system functions being stored in memory 502, and with various computer instructions being read by processor 501 from memory 502 to perform various appropriate actions and processes. An input/output device including an input portion of a keyboard, a mouse, and the like; an output section including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section including a hard disk and the like; and a communication section including a network interface card such as a LAN card, a modem, or the like. The memory 502 also stores the following computer instructions to perform the operations specified by the apparatus of an embodiment of the invention: performing numerical operations using a calculation engine, the calculation engine comprising: receiving a first expression; dividing the first expression into a plurality of computational units, each computational unit comprising a left factor, an operator, and a right factor; sorting the plurality of computing elements by priority of the included operators; calculating the plurality of calculation units for multiple times according to the sequence of the priority from high to low, and replacing the left and/or right factors of the calculation unit calculated this time before each calculation until a final result value is obtained based on the calculation unit calculated last; and outputting a final result value.
Accordingly, embodiments of the present invention provide a computer-readable storage medium storing computer instructions that, when executed, implement the operations specified by the above-described method.
The flowcharts and block diagrams in the figures and block diagrams illustrate the possible architectures, functions, and operations of the systems, methods, and apparatuses according to the embodiments of the present invention, and may represent a module, a program segment, or merely a code segment, which is an executable instruction for implementing a specified logical function. It should also be noted that the executable instructions that implement the specified logical functions may be recombined to create new modules and program segments. The blocks of the drawings, and the order of the blocks, are thus provided to better illustrate the processes and steps of the embodiments and should not be taken as limiting the invention itself.
The various modules or units of the system may be implemented in hardware, firmware or software. The software includes, for example, a code program formed using various programming languages such as JAVA, C/C + +/C #, SQL, and the like. Although the steps and sequence of steps of the embodiments of the present invention are presented in method and method diagrams, the executable instructions of the steps implementing the specified logical functions may be re-combined to create new steps. The sequence of the steps should not be limited to the sequence of the steps in the method and the method illustrations, and can be modified at any time according to the functional requirements. Such as by performing certain steps of the features in parallel or in reverse order.
Systems and methods according to the present invention may be deployed on a single server or on multiple servers. For example, different modules may be deployed on different servers, respectively, to form a dedicated server. Alternatively, the same functional module, module or system may be deployed in a distributed fashion across multiple servers to relieve load stress. The server includes but is not limited to a plurality of PCs, PC servers, blades, supercomputers, etc. on the same local area network and connected via the Internet.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (14)
1. An arithmetic processing method, comprising:
receiving a first expression;
dividing the first expression into a plurality of computational units, each computational unit comprising a left factor, an operator, and a right factor;
sorting the plurality of computing elements by priority of the included operators;
calculating the plurality of calculation units for multiple times according to the sequence of the priority from high to low, and replacing the left and/or right factors of the calculation unit calculated this time before each calculation until a final result value is obtained based on the calculation unit calculated last;
and outputting the final result value.
2. The arithmetic processing method according to claim 1, further comprising:
receiving a second expression;
detecting brackets in the second expression; and
and when the second expression comprises at least one bracket, the bracket is used as a separator to convert the second expression into at least two first expressions.
3. The arithmetic processing method according to claim 2, further comprising: and obtaining a final result value of the second expression through recursive calculation.
4. The arithmetic processing method according to claim 1, further comprising: and establishing a data structure for each calculation unit, wherein the data structure comprises a left unit, a left factor, an operator, a right factor and a right unit.
5. The processing method of claim 4, further comprising: a linked list is used to store a plurality of said data structures.
6. The arithmetic processing method according to claim 4, further comprising: before calculating a calculation unit each time, if the left unit of the corresponding data structure is not empty, the result value of the adjacent left calculation unit is used for replacing the left factor of the corresponding data structure.
7. The arithmetic processing method according to claim 4, further comprising: before calculating one calculation unit each time, if the right unit of the corresponding data structure is not empty, the result value of the adjacent right calculation unit is used for replacing the right factor of the corresponding data structure.
8. The arithmetic processing method according to claim 1, wherein each calculation unit is calculated using a BigDecimal object.
9. The arithmetic processing method according to claim 1, wherein the first expression is a character string, and the dividing the first expression into a plurality of calculation units includes:
dividing the character string into a character string array consisting of numerical values and operators;
and combining the adjacent numerical values and the operators in the character string array into the plurality of computing units.
10. The arithmetic processing method according to claim 1, further comprising: and if the first expression comprises a variable, replacing the variable by a variable value.
11. An arithmetic processing system, comprising:
a receiving module, configured to receive a first expression;
a first division module that divides the first expression into a plurality of computational units, each computational unit including a left factor, an operator, and a right factor;
the sorting module is used for sorting the plurality of computing units according to the priorities of the contained operators;
the calculation module is used for calculating the calculation units for multiple times according to the sequence of the priority from high to low, and before each calculation, replacing the left and/or right factors of the calculation unit calculated this time until the final result value is obtained based on the calculation unit calculated last;
and the output module is used for outputting the final result value.
12. The arithmetic processing system of claim 11, further comprising:
the second dividing module is used for receiving a second expression, detecting brackets in the second expression, and converting the second expression into at least two first expressions by taking the brackets as separators when the second expression contains at least one bracket.
13. A computer-readable storage medium storing computer instructions which, when executed, implement the arithmetic processing method according to any one of claims 1 to 10.
14. An arithmetic processing device, comprising:
a memory for storing computer instructions;
a processor coupled to the memory, the processor configured to perform an arithmetic processing method according to any one of claims 1 to 10 based on computer instructions stored by the memory.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811465185.8A CN111258547A (en) | 2018-12-03 | 2018-12-03 | Operation processing method, system, device and computer readable medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811465185.8A CN111258547A (en) | 2018-12-03 | 2018-12-03 | Operation processing method, system, device and computer readable medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111258547A true CN111258547A (en) | 2020-06-09 |
Family
ID=70950536
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811465185.8A Pending CN111258547A (en) | 2018-12-03 | 2018-12-03 | Operation processing method, system, device and computer readable medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111258547A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113689418A (en) * | 2021-09-01 | 2021-11-23 | 北京云蝶智学科技有限公司 | Formula calculation method based on image recognition |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101393516A (en) * | 2008-10-21 | 2009-03-25 | 中兴通讯股份有限公司 | Method and apparatus for implementing arithmetic rule of mobile communication terminal calculator |
| CN105404497A (en) * | 2015-10-26 | 2016-03-16 | 北京锐安科技有限公司 | Logic expression analysis method and apparatus |
| CN105930297A (en) * | 2016-05-11 | 2016-09-07 | Tcl移动通信科技（宁波）有限公司 | Mobile terminal and method and system for computing and processing data of calculator of mobile terminal |
| CN108537183A (en) * | 2018-04-13 | 2018-09-14 | 拉扎斯网络科技（上海）有限公司 | Formula automatic identifying method, device, electronic equipment and storage medium |
-
2018
- 2018-12-03 CN CN201811465185.8A patent/CN111258547A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101393516A (en) * | 2008-10-21 | 2009-03-25 | 中兴通讯股份有限公司 | Method and apparatus for implementing arithmetic rule of mobile communication terminal calculator |
| CN105404497A (en) * | 2015-10-26 | 2016-03-16 | 北京锐安科技有限公司 | Logic expression analysis method and apparatus |
| CN105930297A (en) * | 2016-05-11 | 2016-09-07 | Tcl移动通信科技（宁波）有限公司 | Mobile terminal and method and system for computing and processing data of calculator of mobile terminal |
| CN108537183A (en) * | 2018-04-13 | 2018-09-14 | 拉扎斯网络科技（上海）有限公司 | Formula automatic identifying method, device, electronic equipment and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| DAVID JORDAN 等: "《JDO开发》", 南京：东南大学出版社 , pages: 167 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113689418A (en) * | 2021-09-01 | 2021-11-23 | 北京云蝶智学科技有限公司 | Formula calculation method based on image recognition |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| AU2019213302B2 (en) | Filtering data lineage diagrams | |
| US10127301B2 (en) | Method and system for implementing efficient classification and exploration of data | |
| Logothetis et al. | Stateful bulk processing for incremental analytics | |
| KR102361153B1 (en) | Managing data profiling operations related to data type | |
| US20160085738A1 (en) | Cloud-Based Parallel Computation Using Actor Modules | |
| CN110795455A (en) | Dependency relationship analysis method, electronic device, computer device and readable storage medium | |
| US20150052530A1 (en) | Task-based modeling for parallel data integration | |
| US10437885B2 (en) | Graph modeling of applications for detection of duplicate modules | |
| US20170168779A1 (en) | Automated generation of memory consumption aware code | |
| JP2014525640A (en) | Expansion of parallel processing development environment | |
| KR102237167B1 (en) | System for transform generation | |
| KR102025210B1 (en) | Queue monitoring and visualization | |
| CN108647137B (en) | Operation performance prediction method, device, medium, equipment and system | |
| CN112579586A (en) | Data processing method, device, equipment and storage medium | |
| US20150112917A1 (en) | Case-based reasoning | |
| CN112368675A (en) | Updating executable graphs | |
| US8195645B2 (en) | Optimized bulk computations in data warehouse environments | |
| CN112395333A (en) | Method and device for checking data exception, electronic equipment and storage medium | |
| CN113297057A (en) | Memory analysis method, device and system | |
| US9367307B2 (en) | Staged points-to analysis for large code bases | |
| US9442818B1 (en) | System and method for dynamic data collection | |
| EP3923155A2 (en) | Method and apparatus for processing snapshot, device, medium and product | |
| CN111221698A (en) | Task data acquisition method and device | |
| CN111258547A (en) | Operation processing method, system, device and computer readable medium | |
| Chan et al. | A distributed stream library for Java 8 |
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 |