CN111444727A - Business rule analysis method - Google Patents
Business rule analysis method Download PDFInfo
- Publication number
- CN111444727A CN111444727A CN202010249622.3A CN202010249622A CN111444727A CN 111444727 A CN111444727 A CN 111444727A CN 202010249622 A CN202010249622 A CN 202010249622A CN 111444727 A CN111444727 A CN 111444727A
- Authority
- CN
- China
- Prior art keywords
- business
- rule
- regular expression
- service
- factor
- 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
- 238000004458 analytical method Methods 0.000 title claims abstract description 12
- 238000000034 method Methods 0.000 claims description 25
- 238000004590 computer program Methods 0.000 claims description 6
- 238000012216 screening Methods 0.000 claims description 6
- 238000013507 mapping Methods 0.000 claims description 3
- 238000012545 processing Methods 0.000 abstract description 3
- 230000008569 process Effects 0.000 description 5
- 239000000047 product Substances 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 3
- 230000002159 abnormal effect Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 239000006227 byproduct Substances 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a business rule analysis method, which relates to the technical field of data processing, and comprises the steps of obtaining a rule expression corresponding to a business rule according to an identification of the business rule, carrying out semantic analysis on the rule expression to obtain a business factor, an operator and a fixed numerical value of the rule expression, obtaining a value corresponding to the business factor, converting the rule expression into a rule expression which can be identified by a machine according to the value corresponding to the business factor, realizing the decoupling of business rule execution and preposed data preparation configuration, directly using each business rule, avoiding the need of an operator to know which query services need to be carried out in advance for each business rule, reducing the configuration difficulty, and improving the flexibility of using the business rules and the efficiency of executing the business rules.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to a business rule analysis method.
Background
At present, the core system of each enterprise and public institution can map a series of business rules through products and obtain expected results. Each product formulates expected results for one or a group of business rules, composition rules and business personnel, and related attributes of the business transaction scene, such as time limit, client age, account state and the like, need to be abstracted based on people, matters and objects in the business transaction scene.
The existing business rule parsing scheme mainly comprises: and the service personnel completes the definition of the service rule and the definition of the expected result according to different service requirements. When the core system runs, the core system can be mapped to one or a group of business rules according to the product, and the content of the business rules is analyzed to obtain an expected result.
This solution has the following drawbacks:
(1) once the configuration of the business rules is completed, one or a group of rules can be mapped according to the dimension of the product, and the desired business rule or rule group cannot be directly used;
(2) the result obtained by executing the business rule only has one item of data, the reason for generating the result and related data cannot be known, and the result obtained by which rule cannot be confirmed;
(3) if one wants to execute a business rule, all the business data that may be used must be prepared in advance. If the relevant service data is not prepared in advance, the output result may be abnormal, and meanwhile, a large amount of unused redundant data is prepared in advance, which seriously affects the efficiency.
How to design a business rule analysis method which is simple and convenient to operate and high in efficiency based on the above situation can improve the flexibility of using the business rule and the efficiency of executing the business rule, and becomes a big pain point of relevant business departments.
Disclosure of Invention
In order to solve the defects in the prior art, an embodiment of the present invention provides a method for analyzing a business rule, where the method includes:
acquiring a rule expression corresponding to a business rule according to an identifier of the business rule;
the rule expression is subjected to semantic analysis to obtain the business factors, operators and fixed numerical values of the rule expression, compared with the existing business rules identified by a machine, the method can configure Chinese business rules, and solves the problems of poor readability and high configuration difficulty of business rules for pure business personnel by semantically analyzing the meanings of the business rules.
Acquiring a value corresponding to the service factor;
and converting the regular expression into a regular expression which can be identified by a machine according to the value corresponding to the service factor, so that the problem that the value corresponding to all the service factors which can be used is required to be prepared in advance when the rule is required to be used in the existing scheme is solved, a large amount of useless expenses of the system are reduced, and the problem that the service rule processing information is incomplete and the final output is abnormal due to the omission of part of the service factors is avoided to a certain extent.
Preferably, after converting the regular expression into a machine-recognizable regular expression, the method further comprises:
executing the regular expression to obtain an execution result;
and obtaining a final expected result or an operation result according to the execution result, realizing the diversity of business rule output, and outputting the expected result when the calculation result is selected to be output or the expected result is selected to meet an expected condition.
Preferably, converting the regular expression into a machine-recognizable regular expression comprises:
and converting the business factors, operators and fixed values in the regular expression from natural language into language which can be recognized by a machine.
Preferably, the obtaining of the value corresponding to the service factor includes:
and respectively analyzing each service factor of the regular expression, establishing a mapping relation between the service factor described by the natural language and the service factor described by the corresponding machine language, and acquiring a value source of the service factor according to the definition of the service factor attribute to obtain the value of the service factor.
Preferably, obtaining the rule expression corresponding to the business rule according to the identifier of the business rule includes:
screening different types of input data for the business rules according to different business transaction scenes; and screening effective universal business rules according to the effective date, the ineffective date, the effective time, the ineffective time and the state of the business rules, realizing diversified use of the business rules, and using the business rules by products and business rules or by independent business rules or business rule sets.
The business rule analysis method provided by the embodiment of the invention has the following beneficial effects:
the decoupling of the execution of the business rules and the preparation configuration of the preposed data is realized, each business rule can be directly used, an operator does not need to know which inquiry services need to be performed in advance for each business rule, and the flexibility of using the business rules and the efficiency of executing the business rules are improved while the configuration difficulty is reduced.
Detailed Description
The present invention will be described in detail with reference to the following embodiments.
The business rule analysis method provided by the embodiment of the invention comprises the following steps:
s101, obtaining a rule expression corresponding to the business rule according to the identification of the business rule.
S102, performing semantic analysis on the regular expression to obtain a business factor, an operator and a fixed numerical value of the regular expression.
As a specific example, the traffic factors are wrapped with symbols "[ ]", operators are in the form of empty rows, operators and empty rows, and the remainder is defaulted to a fixed value. As a regular expression [ age ] is greater than 18 and [ age ] is less than 50 and [ current loan amount ] is less than or equal to [ monthly income ] divided by 2, where "age", "current loan amount", "monthly income" are business factors, "greater than", "less than or equal to", "divided by", "and" are operators, and 18, 50, 2 are fixed values.
S103, obtaining the value corresponding to the service factor.
And S104, converting the regular expression into a regular expression which can be identified by a machine according to the value corresponding to the service factor.
After the business factor is obtained, the value corresponding to the business factor needs to be obtained to participate in the operation.
As a specific embodiment, the business factors are firstly divided into several groups, such as "age", "sex", "occupation" and the like all belong to the customer information group, "the longest loan overdue days in about 12 months", "loan overdue times in about 12 months" and the like all belong to the loan overdue information group, and "applying organization", "applying channel", "applying amount" and the like belong to the parameter group. It can be seen from the above examples that the service factor groups are divided into two major groups, one is the initial parameter group, and the other is the group that needs active query. And (3) putting the high-cohesion business factors in the same group, and inquiring all the business factors when a certain business factor is used by the rule, so that the repeated inquiry condition can be avoided, and the loan overdue information service of the loan module needs to be inquired if the longest loan overdue days of nearly 12 months and the loan overdue times of nearly 12 months are required. Specifically, for each service factor group, the value mode of the service factor is determined according to the actual service logic.
For example, a simple rule expression needs to be computed as follows:
returning a rejection if the age is greater than 65 or less than 18; when age is greater than 18 and age is less than or equal to 65, a pass is returned.
In the regular expression, it is necessary to know what value of age, the business factor, is, for example, age is equal to 25, so that the business expression can obtain the result. To get the age value of 25, it is necessary to query where the age information is obtained, and factor grouping is used.
Optionally, after converting the regular expression into a machine-recognizable regular expression, the method further comprises:
executing the regular expression to obtain an execution result;
and obtaining a final expected result or an operation result according to the execution result.
As a specific embodiment, the rule expression is executed based on the open source application Q L Express, wherein the rule results are divided into two types, one type is Boolean type, the rule of the type is a desired result configured in the rule finally output if the operation result of the expression is true, and no information is output if the operation result of the expression is false.
Optionally, converting the regular expression into a machine-recognizable regular expression comprises:
and converting the business factors, operators and fixed values in the regular expression from natural language into language which can be recognized by a machine.
As a specific example, in the regular expression, the descriptions of age, greater than, and the like cannot be directly analyzed when the system executes, and need to be converted into a language that can be recognized by the corresponding machine, such as "channel is equal to APP" needs to be converted into SOURCE _ TYPE ═ APP. Meanwhile, the SOURCE _ TYPE needs to be converted into a corresponding value such as "MT".
Optionally, the obtaining of the value corresponding to the service factor includes:
and respectively analyzing each service factor of the regular expression, establishing a mapping relation between the service factor described by the natural language and the service factor described by the corresponding machine language, and acquiring a value source of the service factor according to the definition of the service factor attribute to obtain the value of the service factor.
Optionally, obtaining, according to the identifier of the service rule, a rule expression corresponding to the service rule includes:
screening different types of input data for the business rules according to different business transaction scenes; and screening out effective universal business rules according to the effective date, the ineffective date, the effective time, the ineffective time and the state of the business rules.
The business rule parsing method provided by the embodiment of the invention obtains the rule expression corresponding to the business rule according to the identification of the business rule, performs semantic analysis on the rule expression to obtain the business factor, operator and fixed numerical value of the rule expression, obtains the value corresponding to the business factor, and converts the rule expression into the rule expression which can be identified by a machine according to the value corresponding to the business factor, so that the decoupling of business rule execution and preposed data preparation configuration is realized, each business rule can be directly used, an operator does not need to know which query services need to be made in advance for each business rule, and the flexibility of using the business rule and the efficiency of executing the business rule are improved while the configuration difficulty is reduced.
In the foregoing embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
It will be appreciated that the relevant features of the method and apparatus described above are referred to one another.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
The algorithms and displays presented herein are not inherently related to any particular computer, virtual machine, or other apparatus. Various general purpose systems may also be used with the teachings herein. The required structure for constructing such a system will be apparent from the description above. Moreover, the present invention is not directed to any particular programming language. It is appreciated that a variety of programming languages may be used to implement the teachings of the present invention as described herein, and any descriptions of specific languages are provided above to disclose the best mode of the invention.
In addition, the memory may include volatile memory in a computer readable medium, Random Access Memory (RAM) and/or nonvolatile memory such as Read Only Memory (ROM) or flash memory (flash RAM), and the memory includes at least one memory chip.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). The memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in the process, method, article, or apparatus that comprises the element.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The above are merely examples of the present application and are not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.
Claims (6)
1. A business rule parsing method is characterized by comprising the following steps:
acquiring a rule expression corresponding to a business rule according to an identifier of the business rule;
performing semantic analysis on the regular expression to obtain a business factor, an operator and a fixed numerical value of the regular expression;
acquiring a value corresponding to the service factor;
and converting the regular expression into a regular expression which can be identified by a machine according to the value corresponding to the service factor.
2. The business rule parsing method of claim 1, wherein after converting the regular expression into a machine-recognizable regular expression, the method further comprises:
executing the regular expression to obtain an execution result;
and obtaining a final expected result or an operation result according to the execution result.
3. The method of business rule parsing of claim 1, wherein converting the regular expression into a machine recognizable regular expression comprises:
and converting the business factors, operators and fixed values in the regular expression from natural language into language which can be recognized by a machine.
4. The method of claim 1, wherein obtaining the value corresponding to the service factor comprises:
and respectively analyzing each service factor of the regular expression, establishing a mapping relation between the service factor described by the natural language and the service factor described by the corresponding machine language, and acquiring a value source of the service factor according to the definition of the service factor attribute to obtain the value of the service factor.
5. The method for parsing a service rule according to claim 1, wherein obtaining a rule expression corresponding to the service rule according to an identifier of the service rule comprises:
screening different types of input data for the business rules according to different business transaction scenes;
and screening out effective business rules according to the effective date, the ineffective date, the effective time, the ineffective time and the state of the business rules.
6. A computer arrangement comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the steps of claims 1-5 are implemented when the computer program is executed by the processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010249622.3A CN111444727A (en) | 2020-04-01 | 2020-04-01 | Business rule analysis method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010249622.3A CN111444727A (en) | 2020-04-01 | 2020-04-01 | Business rule analysis method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111444727A true CN111444727A (en) | 2020-07-24 |
Family
ID=71651210
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010249622.3A Pending CN111444727A (en) | 2020-04-01 | 2020-04-01 | Business rule analysis method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111444727A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112258311A (en) * | 2020-10-13 | 2021-01-22 | 北京神州数字科技有限公司 | Configuration method and configuration device for collection-hastening policy rules |
| CN114967505A (en) * | 2022-08-03 | 2022-08-30 | 昆仑智汇数据科技(北京)有限公司 | Method, device and equipment for converting industrial model and simulation model |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140282373A1 (en) * | 2013-03-15 | 2014-09-18 | Trinity Millennium Group, Inc. | Automated business rule harvesting with abstract syntax tree transformation |
| CN106649212A (en) * | 2016-09-12 | 2017-05-10 | 济南浪潮高新科技投资发展有限公司 | Business data processing method and device |
| CN106886558A (en) * | 2016-12-28 | 2017-06-23 | 浙江宇视科技有限公司 | A kind of data processing method and server |
| US20170242842A1 (en) * | 2016-02-18 | 2017-08-24 | Sap Se | Dynamic tokens for an expression parser |
| CN108549656A (en) * | 2018-03-09 | 2018-09-18 | 北京百度网讯科技有限公司 | Sentence analytic method, device, computer equipment and readable medium |
| CN109446313A (en) * | 2018-10-31 | 2019-03-08 | 重庆爱思网安信息技术有限公司 | A kind of ordering system and method based on natural language analysis |
| CN109558134A (en) * | 2017-09-27 | 2019-04-02 | 北京京东尚科信息技术有限公司 | The method and apparatus of business datum verification |
| CN110196719A (en) * | 2019-05-20 | 2019-09-03 | 中国工商银行股份有限公司 | A kind of business rule generation method and system based on natural language processing |
| CN110826314A (en) * | 2019-11-07 | 2020-02-21 | 中金智汇科技有限责任公司 | Rule analysis method and device, electronic equipment and storage medium |
-
2020
- 2020-04-01 CN CN202010249622.3A patent/CN111444727A/en active Pending
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140282373A1 (en) * | 2013-03-15 | 2014-09-18 | Trinity Millennium Group, Inc. | Automated business rule harvesting with abstract syntax tree transformation |
| US20170242842A1 (en) * | 2016-02-18 | 2017-08-24 | Sap Se | Dynamic tokens for an expression parser |
| CN106649212A (en) * | 2016-09-12 | 2017-05-10 | 济南浪潮高新科技投资发展有限公司 | Business data processing method and device |
| CN106886558A (en) * | 2016-12-28 | 2017-06-23 | 浙江宇视科技有限公司 | A kind of data processing method and server |
| CN109558134A (en) * | 2017-09-27 | 2019-04-02 | 北京京东尚科信息技术有限公司 | The method and apparatus of business datum verification |
| CN108549656A (en) * | 2018-03-09 | 2018-09-18 | 北京百度网讯科技有限公司 | Sentence analytic method, device, computer equipment and readable medium |
| CN109446313A (en) * | 2018-10-31 | 2019-03-08 | 重庆爱思网安信息技术有限公司 | A kind of ordering system and method based on natural language analysis |
| CN110196719A (en) * | 2019-05-20 | 2019-09-03 | 中国工商银行股份有限公司 | A kind of business rule generation method and system based on natural language processing |
| CN110826314A (en) * | 2019-11-07 | 2020-02-21 | 中金智汇科技有限责任公司 | Rule analysis method and device, electronic equipment and storage medium |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112258311A (en) * | 2020-10-13 | 2021-01-22 | 北京神州数字科技有限公司 | Configuration method and configuration device for collection-hastening policy rules |
| CN114967505A (en) * | 2022-08-03 | 2022-08-30 | 昆仑智汇数据科技(北京)有限公司 | Method, device and equipment for converting industrial model and simulation model |
| CN114967505B (en) * | 2022-08-03 | 2022-09-27 | 昆仑智汇数据科技(北京)有限公司 | Method, device and equipment for converting industrial model and simulation model |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7650344B2 (en) | System and method of managing software product-line customizations | |
| US7958026B2 (en) | Hierarchical transaction filtering | |
| CN111078313A (en) | Service parameter configuration method | |
| CN106557486A (en) | A kind of storage method and device of data | |
| CN107391532B (en) | Data filtering method and device | |
| CN111444727A (en) | Business rule analysis method | |
| CN106529953B (en) | Method and device for risk identification of business attributes | |
| CN110019754A (en) | A kind of method for building up of knowledge base, device and equipment | |
| CN110119401A (en) | Processing method, device, server and the storage medium of user's portrait | |
| CN116401379A (en) | Financial product data pushing method, device, equipment and storage medium | |
| CN115827084A (en) | Data processing method, device, equipment and storage medium | |
| CN116090867A (en) | Index rule generation method and device, electronic equipment and storage medium | |
| CN112150271A (en) | Customer grouping method and system | |
| CN106886546B (en) | Construction method and equipment of data website | |
| CN112988358A (en) | Data middleware for e-commerce platform | |
| CN114168624A (en) | Data analysis method, computing device and storage medium | |
| CN113626415A (en) | Credit data output method, device and medium | |
| CN111723251A (en) | Method, system and equipment for importing data of graph database | |
| CN113129071A (en) | Method and device for analyzing product SKU of merchant | |
| CN112597105A (en) | Processing method of file associated object, server side equipment and storage medium | |
| CN112527792A (en) | Data storage method, device, equipment and storage medium | |
| CN111143546A (en) | Method and device for obtaining recommendation language and electronic equipment | |
| CN113935301B (en) | Report generation method and device, storage medium and electronic equipment | |
| CN112148782B (en) | Market data access method and device | |
| CN114697390A (en) | XML message processing method and device, storage medium and electronic equipment |
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 |
Application publication date: 20200724 |
|
| RJ01 | Rejection of invention patent application after publication |