CN102779044B - The dissection process system of expression formula and analyzing and processing method - Google Patents
The dissection process system of expression formula and analyzing and processing method Download PDFInfo
- Publication number
- CN102779044B CN102779044B CN201210223624.0A CN201210223624A CN102779044B CN 102779044 B CN102779044 B CN 102779044B CN 201210223624 A CN201210223624 A CN 201210223624A CN 102779044 B CN102779044 B CN 102779044B
- Authority
- CN
- China
- Prior art keywords
- expression formula
- expression
- statement
- component object
- self
- 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.)
- Active
Links
Landscapes
- Stored Programmes (AREA)
Abstract
The invention provides a kind of dissection process system of expression formula, comprising: generation unit, for generating expression statement; Converting unit, for changing described expression statement, makes it to meet preset language rule; Compilation unit, for compiling the expression statement meeting described preset language rule, to create the expression formula assembly of described expression statement, and is generated as binary stream by described expression formula assembly; Storage unit, for being stored in database, for use by described binary stream.Correspondingly, the invention allows for a kind of analyzing and processing method of expression formula.By technical scheme of the present invention, effectively can solve the problem that structure dynamic analysis engine complexity is high, the ease for use of service-oriented can also be provided, and support the requirement of complicated business scenario.
Description
Technical field
The present invention relates to field of computer technology, in particular to a kind of dissection process system and analyzing and processing method of expression formula.
Background technology
From business application point, in process business Object Process, often run into following problem:
1) by filtercondition, the results set meeting business rule is filtered out.
2) attribute of certain business object may be determined by other attributes or other multiple attributes are obtained by computing.
Based on the application of above two aspects, need the business model defining the design of a kind of value expression or run, meet the requirement of above-mentioned two aspects.
From technical standpoint, when describing business object attribute, this attribute has and is determined by his attribute sometimes, and namely obtained by calculating by other attributes, the process need of calculating defines in advance, and this definition is exactly the description to expression formula.Business object has many forms, as list, and form and its filtercondition etc.In the prior art, the following two kinds solution is usually had:
1. for explanation type expression formula framework, by constructing a dynamic analysis engine, to the process of expression formula character string dynamic analysis, identify the priority of wherein function (system function and self-defining function), parameter, logical operator and computing, operationally call corresponding function and Parameter Switch dynamically.
2., based on Lamda expression formula engine, by structure Lamda expression tree, after compiling, pass ginseng and call, obtain end value.
The problem of scheme 1 is that expression processing complexity is high.The problem of scheme 2 is that support is comprehensive not, only support C# expression formula at present, such as to generate Sql expression formula then to need to re-construct a set of processing engine, this is the circumscribed aspect of Lamda expression formula, and another aspect is then that dirigibility and extendability cannot meet the business need of complex scene.
Therefore, need a kind of dissection process technology of new expression formula, effectively can solve the problem that structure dynamic analysis engine complexity is high, the ease for use of service-oriented can also be provided, and support the requirement of complicated business scenario.
Summary of the invention
The present invention, just based on the problems referred to above, proposes a kind of dissection process technology of new expression formula, effectively can solve the problem that structure dynamic analysis engine complexity is high, can also provide the ease for use of service-oriented, and support the requirement of complicated business scenario.
In view of this, the present invention proposes a kind of dissection process system of expression formula, comprising: generation unit, for generating expression statement; Converting unit, for changing described expression statement, makes it to meet preset language rule; Compilation unit, for compiling the expression statement meeting described preset language rule, to create the expression formula assembly of described expression statement, and is generated as binary stream by described expression formula assembly; Storage unit, for being stored in database, for use by described binary stream.In this technical scheme, by the conversion of expression statement, reduce compiling difficulty and complexity, and there is higher extendability.
In technique scheme, preferably, also comprise: regular setting unit, for arranging the transformation rule of self-defined element; Described converting unit also for: obtain the self-defined element in described expression statement, and according to the kind of described self-defined element, described self-defined element is changed accordingly, described expression statement to be converted to the expression statement meeting described preset language rule.
In technique scheme, preferably, the self-defined element that described converting unit carries out changing comprises self-defining function and/or custom parameter.
In technique scheme, preferably, also comprise: loading unit, for obtaining described binary stream from database, described binary stream being reflected into corresponding expression formula component object, and described expression formula component object is loaded in buffer memory; Performance element, for calling the executive's interface of described expression formula component object, incoming traffic parameter, to perform described expression formula component object, and returns execution result.
In technique scheme, preferably, also comprise: mark buffer unit, for when loading described expression formula component object, the very first time stamp of expression formula component object described in buffer memory and/or the first mark; Judging unit, before operating at described performance element, obtain the second timestamp and/or second mark of described expression formula component object, and judge that stamp of the described very first time identify with described second timestamp and/or described first and described second identifies and whether change, if, then remove buffer memory, and reload described expression formula component object by described loading unit.
According to another aspect of the invention, also proposed a kind of analyzing and processing method of expression formula, comprising: step 202, generate expression statement, and described expression statement is changed, make it to meet preset language rule; Step 204, compiles the expression statement meeting described preset language rule, to create the expression formula assembly of described expression statement, and described expression formula assembly is generated as binary stream; Step 206, is stored in database, for use by described binary stream.In this technical scheme, by the conversion of expression statement, reduce compiling difficulty and complexity, and there is higher extendability.
In technique scheme, preferably, before described step 202, also comprise: the transformation rule that self-defined element is set; Obtain the self-defined element in described expression statement, and according to the kind of described self-defined element, described self-defined element is changed accordingly, described expression statement to be converted to the expression statement meeting described preset language rule.
In technique scheme, preferably, described self-defined element comprises self-defining function and/or custom parameter.
In technique scheme, preferably, after described step 206, also comprise: step 208, from database, obtain described binary stream, described binary stream is reflected into corresponding expression formula component object, and described expression formula component object is loaded in buffer memory; Step 210, calls the executive's interface of described expression formula component object, incoming traffic parameter, to perform described expression formula component object, and returns execution result.
In technique scheme, preferably, described step 208 also comprises: the very first time stamp of expression formula component object described in buffer memory and/or the first mark; Also comprise before described step 210: the second timestamp and/or the second mark that obtain described expression formula component object, and judge that stamp of the described very first time identify with described second timestamp and/or described first and described second identifies and whether change, if, then remove buffer memory, and return described step 208 to reload described expression formula component object.
By above technical scheme, effectively can solve the problem that structure dynamic analysis engine complexity is high, the ease for use of service-oriented can also be provided, and support the requirement of complicated business scenario.
Accompanying drawing explanation
Fig. 1 shows the block diagram of the dissection process system of expression formula according to an embodiment of the invention;
Fig. 2 shows the process flow diagram of the analyzing and processing method of expression formula according to an embodiment of the invention;
Fig. 3 shows the block diagram of expression editor according to an embodiment of the invention;
Fig. 4 shows the process flow diagram of the analyzing and processing method of expression formula according to another embodiment of the invention;
Fig. 5 is that the module of the expression parsing process of the embodiment shown in Fig. 4 performs schematic diagram.
Embodiment
In order to more clearly understand above-mentioned purpose of the present invention, feature and advantage, below in conjunction with the drawings and specific embodiments, the present invention is further described in detail.It should be noted that, when not conflicting, the feature in the embodiment of the application and embodiment can combine mutually.
Set forth a lot of detail in the following description so that fully understand the present invention; but; the present invention can also adopt other to be different from other modes described here and implement, and therefore, protection scope of the present invention is not by the restriction of following public specific embodiment.
Fig. 1 shows the block diagram of the dissection process system of expression formula according to an embodiment of the invention.
As shown in Figure 1, the dissection process system 100 of expression formula according to an embodiment of the invention, comprising: generation unit 102, for generating expression statement; Converting unit 104, for changing expression statement, makes it to meet preset language rule; Compilation unit 106, for compiling the expression statement meeting preset language rule, to create the expression formula assembly of expression statement, and is generated as binary stream by expression formula assembly; Storage unit 108, for being stored in database by binary stream, for use.In this technical scheme, by the conversion of expression statement, reduce compiling difficulty and complexity, and there is higher extendability.
In technique scheme, preferably, also comprise: regular setting unit 110, for arranging the transformation rule of self-defined element; Converting unit 104 also for: obtain the self-defined element in expression statement, and according to the kind of self-defined element, self-defined element changed accordingly, expression statement to be converted to the expression statement meeting preset language rule.
In technique scheme, preferably, the self-defined element that converting unit 104 carries out changing comprises self-defining function and/or custom parameter.
In technique scheme, preferably, also comprise: loading unit 112, for obtaining binary stream from database, binary stream being reflected into corresponding expression formula component object, and expression formula component object is loaded in buffer memory; Performance element 114, for calling the executive's interface of expression formula component object, incoming traffic parameter, with executable expressions component object, and returns execution result.
In technique scheme, preferably, also comprise: mark buffer unit 116, for when loading expression formula component object, the very first time stamp of buffer memory expression formula component object and/or the first mark; Judging unit 118, before operating at performance element, obtain the second timestamp and/or second mark of expression formula component object, and judge that the very first time stamp identify with the second timestamp and/or first and second identifies and whether change, if, then remove buffer memory, and reload expression formula component object by loading unit 112.
Fig. 2 shows the process flow diagram of the analyzing and processing method of expression formula according to an embodiment of the invention.
As shown in Figure 2, the analyzing and processing method of expression formula according to an embodiment of the invention, comprising: step 202, generates expression statement, and changes expression statement, make it to meet preset language rule; Step 204, compiles the expression statement meeting preset language rule, to create the expression formula assembly of expression statement, and expression formula assembly is generated as binary stream; Step 206, is stored to binary stream in database, for use.In this technical scheme, by the conversion of expression statement, reduce compiling difficulty and complexity, and there is higher extendability.
In technique scheme, preferably, before step 202, also comprise: the transformation rule that self-defined element is set; Obtain the self-defined element in expression statement, and according to the kind of self-defined element, self-defined element is changed accordingly, expression statement to be converted to the expression statement meeting preset language rule.
In technique scheme, preferably, self-defined element comprises self-defining function and/or custom parameter.
In technique scheme, preferably, after step 206, also comprise: step 208, from database, obtain binary stream, binary stream is reflected into corresponding expression formula component object, and expression formula component object is loaded in buffer memory; Step 210, calls the executive's interface of expression formula component object, and incoming traffic parameter with executable expressions component object, and returns execution result.
In technique scheme, preferably, step 208 also comprises: the very first time stamp of buffer memory expression formula component object and/or the first mark; Also comprise before step 210: the second timestamp and/or the second mark that obtain expression formula component object, and judge that the very first time stamp identify with the second timestamp and/or first and second identifies and whether change, if, then remove buffer memory, and return step 208 to reload expression formula component object.
Fig. 3 shows the block diagram of expression editor according to an embodiment of the invention.
As shown in Figure 3, expression editor according to an embodiment of the invention, comprising:
Rule-definition module, arranges the rule processed self-defined element.
Collector, is obtained the expression statement meeting C# grammer, is then compiled into the assembly that can call by the CodeDom Technique dynamic of .NET by modular converter, and stores in a database with binary form.
Rule treatments module when described self-defined element is self-defining function, according to described rule, using the function of .NET class corresponding for described self-defining function process as described result, or obtain described self-defining function call result as described result.
Modular converter, changes expression formula and meets the expression statement (character string) of C# syntactic structure.By Rule Information, character string seen by user is changed into the actual self-defined element in backstage from according with string.When if self-defined element is self-defining function, be converted into " class name. function name " form; If during custom parameter, by by its turnover number group objects being the input item in current expression, such as args [2], simultaneously in order to make function have strongly-typed feature, and according to the type of parameter current, be the form of TypeConvertor.Convert<T> (args [2]) in the expression formula of reality, wherein T can be string, int, char, DateTime and Dictionary etc.
Execution module, by calling expression formula assembly based on the dynamic compression and decompression of binary stream, thus realizes the hot plug of assembly, thus when meeting system and run time concurrent working business scenario.
Loader, is loaded and instantiation expression formula assembly by binary stream.
Assembly buffer, caching component, assembly indicate and timestamp, the change of dynamic monitoring assembly.
The emptier of assembly, unloads the assembly be loaded in internal memory as required.
Fig. 4 shows the process flow diagram of the analyzing and processing method of expression formula according to another embodiment of the invention.
As shown in Figure 4, the analyzing and processing method of expression formula according to another embodiment of the invention, comprising:
Step 402, arranges the rule processed self-defined element;
Step 404, carrying out conversion process to the expression formula of user's design, finally inputting out the expression statement for meeting C# syntactic structure;
Step 406, compiles expression statement, obtains and can call component binaries stream;
Step 408, can call expression formula assembly by the dynamic compression and decompression of binary stream, obtains the perform bulk object of expression formula.
Below in conjunction with the module of the expression parsing process shown in the analyzing and processing method of the expression formula shown in Fig. 4 and Fig. 5, technical scheme of the present invention is described in detail:
Whole process can be divided into expression formula design phase, translate phase, compilation phase and execute phase.
1, expression formula design process, user by double-clicking or pull function node on interface or Parameter nodes, by function or the parameter display position at editing machine mouse place.The information that user sees is all the information relevant to business, be easily understood, the year angle value such as got Date, example $ < > ($ < current date >), meet the use habit of user, and easy to understand, user is without the need to understanding computerese.
2, translate phase, converter 502, the expression formula ($ < > ($ < current date >)) of design carries out conversion process, convert the expression statement meeting C# syntactic structure to, first we need wherein function and parameter identify and replace, C# specification whether is met, completely by collector process as grammer.Identifying is different from the identification of conventional analytics engine to function and parameter, only need to identify function " $ < > " and replace to conventional function $ <DateFunction.Year>, and parameter $ < current date > is replaced to $ <currentDate>.In the converter, having carried out twice process to expression formula is actual, is the first step of conversion in above-mentioned, and this step is done the work wanted and function display Name corresponding in expression formula is converted to actual function name, and parameter display name is converted to the coding of parameter.This expression formula is persisted in database, has different displays when the multi-lingual display of user.Second step conversion be actually into the compilation phase prepare, this step can by the first step transform expression formula be converted to the expression statement meeting C# syntactic structure, mainly do following work:
■ $ <DateFunction.Year> can be converted to DateFunction.Year.Wherein DateFunction represents class object, and Year represents the public static function of DateFunction.
■ $ <currentDate> can be converted to TypeConverter.Convert<DateTimeGreatT.GreaT. GT (args [0]), args [0] derive from parameter currentDate be positioned at the order that whole expression argument occurs first, wherein identical parameter can use a position scalar.Such as a, b, c, b, d.The wherein parametric form args [1] of last b.
Whole transfer process is as follows:
$ < > ($ < current date >)=> $ <DateFunction.Year> ($ <currentDate>)=>DateFunction.Year (
TypeConverter.Convert<DateTime>(args[0]))
3, the compilation phase, compiler 504, by translate phase, editing machine obtains complete C# expression statement, and is organized into " the return expression statement of standard; " C# statement.Construct actuator class by CodeDom, and this statement is compiled in the execution function of actuator, create out expression formula assembly, and be converted into binary stream and be persisted in database.
4, the execute phase, actuator 506, simple description is exactly from database, extracts the binary stream of current expression.And being loaded in internal memory by loader, and this expression formula assembly of instantiation.Then by the expression formula component object that buffer buffer memory is current, and the timestamp of buffer memory current expression and sign, all to contrast before each loading, detect expression formula and whether change.If changed, then need, by emptier, the expression formula component object in current cache is carried out unloading process.Reenter loading procedure afterwards.Finally, directly call the excuse of this assembly, service parameter is inputed to the expression formula executive's interface of current component.When so achieving operation and design time non-interfering business scenario.
When this process is actually the operation of expression formula, system by interface during the operation of editing machine, can obtain the dictionary that expression formula needs the parameter imported into, and carries out assignment operation for each parameter by its type, to the executive's interface of editing machine be called, perform this expression formula.Implementation is carried out as follows:
Whether first ■ checks the object of the assembly that whether there is this expression formula in current cache, if existed, then verify its timestamp and change, if changed, perform second step.Otherwise directly skip second step, carry out the 3rd.
■ reads the binary stream of the assembly of expression formula from storehouse by loader, and is reflected into actuator assembly object, and is cached in current global buffer.
■ actuator executable operations, according to the Parameter Dictionary that user provides, is organized into parameter array in order by it, imports in the execution function of this actuator, and draws final result.If period makes a mistake, system can directly return null value or default value.
By above technical scheme, a kind of design of value expression and the method for dissection process can be realized, effectively can solve the problem of the high complexity of self-defined analytics engine, the ease for use of service-oriented can also be provided, and support complicated statement to a certain extent.
More than be described with reference to the accompanying drawings technical scheme of the present invention, consider in correlation technique, analytics engine is complicated, extendability is poor, therefore, the dissection process system and method that the invention provides a kind of expression formula effectively can solve the high problem of structure dynamic analysis engine complexity, the ease for use of service-oriented can also be provided, and support the requirement of complicated business scenario.
The foregoing is only the preferred embodiments of the present invention, be not limited to the present invention, for a person skilled in the art, the present invention can have various modifications and variations.Within the spirit and principles in the present invention all, any amendment done, equivalent replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (6)
1. a dissection process system for expression formula, is characterized in that, comprising:
Generation unit, for generating expression statement;
Converting unit, for changing described expression statement, makes it to meet preset language rule;
Compilation unit, for compiling the expression statement meeting described preset language rule, to create the expression formula assembly of described expression statement, and is generated as binary stream by described expression formula assembly;
Storage unit, for being stored in database, for use by described binary stream;
Loading unit, for obtaining described binary stream from database, being reflected into corresponding expression formula component object, and being loaded in buffer memory by described expression formula component object by described binary stream;
Performance element, for calling the executive's interface of described expression formula component object, incoming traffic parameter, to perform described expression formula component object, and returns execution result;
Mark buffer unit, for when loading described expression formula component object, the very first time stamp of expression formula component object described in buffer memory and/or the first mark;
Judging unit, before operating at described performance element, obtain the second timestamp and/or second mark of described expression formula component object, and judge that stamp of the described very first time identify with described second timestamp and/or described first and described second identifies and whether change, if, then remove buffer memory, and reload described expression formula component object by described loading unit.
2. the dissection process system of expression formula according to claim 1, is characterized in that, also comprise:
Rule setting unit, for arranging the transformation rule of self-defined element;
Described converting unit also for: obtain the self-defined element in described expression statement, and according to the kind of described self-defined element, described self-defined element is changed accordingly, described expression statement to be converted to the expression statement meeting described preset language rule.
3. the dissection process system of expression formula according to claim 2, is characterized in that, the self-defined element that described converting unit carries out changing comprises self-defining function and/or custom parameter.
4. an analyzing and processing method for expression formula, is characterized in that, comprising:
Step 202, generates expression statement, and changes described expression statement, make it to meet preset language rule;
Step 204, compiles the expression statement meeting described preset language rule, to create the expression formula assembly of described expression statement, and described expression formula assembly is generated as binary stream;
Step 206, is stored in database, for use by described binary stream;
Step 208, obtains described binary stream from database, described binary stream is reflected into corresponding expression formula component object, and is loaded in buffer memory by described expression formula component object;
Step 210, calls the executive's interface of described expression formula component object, incoming traffic parameter, to perform described expression formula component object, and returns execution result;
Described step 208 also comprises:
The very first time stamp of expression formula component object described in buffer memory and/or the first mark;
Also comprise before described step 210:
Obtain the second timestamp and/or second mark of described expression formula component object, and judge that stamp of the described very first time identify with described second timestamp and/or described first and described second identifies and whether change, if, then remove buffer memory, and return described step 208 to reload described expression formula component object.
5. the analyzing and processing method of expression formula according to claim 4, is characterized in that, before described step 202, also comprises:
The transformation rule of self-defined element is set;
Obtain the self-defined element in described expression statement, and according to the kind of described self-defined element, described self-defined element is changed accordingly, described expression statement to be converted to the expression statement meeting described preset language rule.
6. the analyzing and processing method of expression formula according to claim 5, is characterized in that, described self-defined element comprises self-defining function and/or custom parameter.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210223624.0A CN102779044B (en) | 2012-06-28 | 2012-06-28 | The dissection process system of expression formula and analyzing and processing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210223624.0A CN102779044B (en) | 2012-06-28 | 2012-06-28 | The dissection process system of expression formula and analyzing and processing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102779044A CN102779044A (en) | 2012-11-14 |
| CN102779044B true CN102779044B (en) | 2016-01-20 |
Family
ID=47123965
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210223624.0A Active CN102779044B (en) | 2012-06-28 | 2012-06-28 | The dissection process system of expression formula and analyzing and processing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102779044B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103914027B (en) * | 2013-01-07 | 2016-07-06 | 上海宝信软件股份有限公司 | Utilize the method that expression parsing realizes industry spot underlying device monitoring management |
| CN109032654B (en) * | 2017-06-08 | 2022-06-07 | 北京京东尚科信息技术有限公司 | Method and apparatus for configuring parameters in server, server and storage medium |
| CN108197093A (en) * | 2017-12-28 | 2018-06-22 | 重庆南华中天信息技术有限公司 | Across language across the unlimited data source of frame Visual Report Forms design method and system |
| CN108491207B (en) * | 2018-03-02 | 2020-11-17 | 平安科技（深圳）有限公司 | Expression processing method, device, equipment and computer readable storage medium |
| CN111444221B (en) * | 2020-05-18 | 2022-02-18 | 江苏电力信息技术有限公司 | Optimization method for flexible parameter transmission of SAP HANA and ABAP |
| CN113516412A (en) * | 2021-08-06 | 2021-10-19 | 上海中通吉网络技术有限公司 | Business assessment method |
| CN114675831B (en) * | 2022-03-09 | 2023-10-31 | 韩济澎 | Compiling system and method for programming language |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1881208A (en) * | 2005-06-14 | 2006-12-20 | 联想(北京)有限公司 | Construction method for dynamic structured query language statement |
| CN101000615A (en) * | 2006-12-31 | 2007-07-18 | 华为技术有限公司 | Service processing method and device based on data base |
| CN101754325A (en) * | 2009-12-25 | 2010-06-23 | 中兴通讯股份有限公司 | Forward power overload control method and device |
-
2012
- 2012-06-28 CN CN201210223624.0A patent/CN102779044B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1881208A (en) * | 2005-06-14 | 2006-12-20 | 联想(北京)有限公司 | Construction method for dynamic structured query language statement |
| CN101000615A (en) * | 2006-12-31 | 2007-07-18 | 华为技术有限公司 | Service processing method and device based on data base |
| CN101754325A (en) * | 2009-12-25 | 2010-06-23 | 中兴通讯股份有限公司 | Forward power overload control method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102779044A (en) | 2012-11-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102779044B (en) | The dissection process system of expression formula and analyzing and processing method | |
| CN103942228B (en) | Regulation engine, computational methods, operation system and call method | |
| Kang et al. | FORM: A feature-; oriented reuse method with domain-; specific reference architectures | |
| US20100175049A1 (en) | Scope: a structured computations optimized for parallel execution script language | |
| CN105426394B (en) | Based on cross-platform mobile report form generation method and system | |
| CN104298496B (en) | data analysis type software development framework system | |
| Combemale et al. | Concern-oriented language development (COLD): Fostering reuse in language engineering | |
| Reimann et al. | SIMPL–A Framework for Accessing External Data in Simulation Workflows | |
| US20130332449A1 (en) | Generating data processing code from a directed acyclic graph | |
| CN103441900A (en) | Centralization cross-platform automated testing system and control method thereof | |
| CN112199086A (en) | Automatic programming control system, method, device, electronic device and storage medium | |
| CN106951305B (en) | Method for generating midCore script from QVT-R language based on model conversion | |
| US9880815B2 (en) | SQL visualizer | |
| CN110673854A (en) | SAS language compiling method, device, equipment and readable storage medium | |
| CN110196888A (en) | Data-updating method, device, system and medium based on Hadoop | |
| CN115639980A (en) | Draggable front-end logic arrangement method and device for low-code platform | |
| Van Kempen et al. | Towards proving preservation of behaviour of refactoring of UML models | |
| Rademacher et al. | Deriving microservice code from underspecified domain models using DevOps-enabled modeling languages and model transformations | |
| CN113806429A (en) | Canvas type log analysis method based on large data stream processing framework | |
| US10831784B2 (en) | Integration of relational calculation views into a relational engine | |
| CN113204593A (en) | ETL job development system and computer equipment based on big data calculation engine | |
| CN105556504A (en) | Generating a logical representation from a physical flow | |
| Wenger et al. | Transformation of IEC 61131-3 to IEC 61499 based on a model driven development approach | |
| Frey et al. | MAMBA: A measurement architecture for model-based analysis | |
| CN109933622A (en) | A kind of data visualisation system and implementation method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20160215 Address after: 100094 Beijing City, North Road, Haidian District, No. 68, building 2, floor 2 Patentee after: You Pu Information Technology Co., Ltd of UFSOFT Address before: 100094 Beijing city Haidian District North Road No. 68, UFIDA Software Park Patentee before: UFIDA Software Co., Ltd. |