WO2018014814A1 - 终端规则引擎装置、终端规则运行方法 - Google Patents

终端规则引擎装置、终端规则运行方法 Download PDF

Info

Publication number
WO2018014814A1
WO2018014814A1 PCT/CN2017/093212 CN2017093212W WO2018014814A1 WO 2018014814 A1 WO2018014814 A1 WO 2018014814A1 CN 2017093212 W CN2017093212 W CN 2017093212W WO 2018014814 A1 WO2018014814 A1 WO 2018014814A1
Authority
WO
WIPO (PCT)
Prior art keywords
rule
module
tree
terminal
running
Prior art date
Application number
PCT/CN2017/093212
Other languages
English (en)
French (fr)
Inventor
夏巨鹏
高雪瑶
马绍青
田贝
黄翀民
Original Assignee
阿里巴巴集团控股有限公司
夏巨鹏
高雪瑶
马绍青
田贝
黄翀民
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 阿里巴巴集团控股有限公司, 夏巨鹏, 高雪瑶, 马绍青, 田贝, 黄翀民 filed Critical 阿里巴巴集团控股有限公司
Priority to PL17830448T priority Critical patent/PL3490193T3/pl
Priority to SG11201900538VA priority patent/SG11201900538VA/en
Priority to MYPI2019000365A priority patent/MY202337A/en
Priority to ES17830448T priority patent/ES2809169T3/es
Priority to JP2019503320A priority patent/JP6709574B2/ja
Priority to KR1020197005200A priority patent/KR102158435B1/ko
Priority to EP17830448.1A priority patent/EP3490193B1/en
Publication of WO2018014814A1 publication Critical patent/WO2018014814A1/zh
Priority to US16/254,493 priority patent/US20190156228A1/en
Priority to US16/725,728 priority patent/US20200143272A1/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5003—Managing SLA; Interaction between SLA and QoS
    • H04L41/5019—Ensuring fulfilment of SLA
    • H04L41/5022—Ensuring fulfilment of SLA by giving priorities, e.g. assigning classes of service
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computing arrangements using knowledge-based models
    • G06N5/04—Inference or reasoning models
    • G06N5/046—Forward inferencing; Production systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/901—Indexing; Data structures therefor; Storage structures
    • G06F16/9027—Trees
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computing arrangements using knowledge-based models
    • G06N5/01—Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computing arrangements using knowledge-based models
    • G06N5/02—Knowledge representation; Symbolic representation
    • G06N5/022—Knowledge engineering; Knowledge acquisition
    • G06N5/025—Extracting rules from data
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0893—Assignment of logical groups to network elements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design
    • H04L41/142—Network analysis or design using statistical or mathematical methods
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/16—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks using machine learning or artificial intelligence
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0894—Policy-based network configuration management

Definitions

  • the present application relates to the field of computer technologies, and in particular, to a terminal rule engine device and a terminal rule operation method.
  • the rules for running the service on the server end are globally applied to all the terminals corresponding to the server, and the results of the rules of the server are sent to the corresponding terminals, and the terminals are further according to the rules. Run the results and decide how to perform subsequent business processing actions.
  • the embodiment of the present application provides a terminal rule engine device, which is used to solve the problem that the global operation of the rule running mode in the prior art leads to a high risk when the rule is run or the rule is updated.
  • the embodiment of the present application further provides a terminal rule running method, which is used to solve the problem that the global operation of the rule running mode in the prior art leads to a high risk when the rule is run or the rule is updated.
  • a terminal rule engine device provided by an embodiment of the present application, where the device is located in a terminal, including an interface module, a management module, and an operation module;
  • the interface module receives a rule running request for a service
  • the management module from the service according to the device identifier and/or the user identifier corresponding to the terminal The rule set of the business obtained by the terminal is managed;
  • the running module in response to the request received by the interface module, obtaining a rule corresponding to the request from the rule set managed by the management module, generating a rule tree according to the obtained rule, and obtaining The service data related to the rule tree determines the running result of the rule according to the rule tree and the service data.
  • the embodiment of the present application further provides a method for operating a terminal rule, including:
  • the terminal receives a rule running request for the service
  • the terminal generates a rule tree according to the obtained rule, and obtains service data related to the rule tree;
  • the terminal determines an operation result of the rule and the service data according to the rule tree.
  • the rule engine device is deployed in the terminal, and the device identifier and/or the user identifier of the terminal are implemented, and the rule set of the device level and/or the user level is managed, so that The rules in the rule set are run on the terminal, and the processes such as rule running and updating of different terminals are isolated from each other, which reduces the risk when running the rules or updating the rules. Therefore, the problems in the prior art can be partially or completely solved.
  • FIG. 1 is a schematic structural diagram of a terminal rule engine apparatus according to an embodiment of the present application
  • FIG. 2 is a schematic structural diagram of a rule tree according to an embodiment of the present application.
  • FIG. 3 is a schematic diagram of a first detailed structure of the terminal rule engine apparatus of FIG. 1 according to an embodiment of the present disclosure
  • FIG. 4 is a second detailed structural diagram of the terminal rule engine apparatus of FIG. 1 according to an embodiment of the present disclosure
  • FIG. 5 is a third detailed structural diagram of the terminal rule engine apparatus of FIG. 1 according to an embodiment of the present disclosure
  • FIG. 6 is a schematic flowchart of a method for operating a terminal rule according to an embodiment of the present disclosure.
  • the rule operation mode in the prior art has a problem of high risk, and not only the prior art, but also has more problems in the prior art.
  • the server since the operation of the rule occurs on the server, the server needs to consume a large amount of computing resources, and the server is under pressure; the process of the server running the rules for multiple terminals may affect each other and increase the stability risk of the service.
  • the result of the rule running on the server has a global impact on the service.
  • the result of the unreliable rule will be obtained, and the service will be global. The adverse effects.
  • the solution of the present application provides a terminal rule engine device placed on the terminal, and the rule can be run on each terminal instead of on the server side, and the above problem can be partially or completely solved.
  • the scheme of the present application will be described below.
  • FIG. 1 is a terminal rule engine device according to an embodiment of the present disclosure, where the device is located at a terminal.
  • the terminal may be a mobile phone, a tablet computer, a smart watch, a smart bracelet, a mobile station, or a personal computer.
  • the terminal has its corresponding server, and the server can generally be one or the one mounted on the terminal.
  • the server side of multiple applications (such as mobile app). Any server can correspond to multiple terminals, and each terminal can have its own terminal rule engine device, and can run the rules of the service independently of each other.
  • the device in FIG. 1 includes: an interface module 101, a management module 102, and an operation module 103;
  • the interface module 101 receives a rule running request for a service
  • the management module 102 manages a rule set of the service obtained by the server according to the device identifier and/or the user identifier corresponding to the terminal;
  • the running module 103 in response to the request received by the interface module 101, obtains a rule corresponding to the request from the rule set managed by the management module 102, and generates a rule tree according to the obtained rule. And obtaining service data related to the rule tree, and determining a running result of the rule according to the rule tree and the service data.
  • the service content is not limited, and may be any service that can be performed on the network, for example, an e-commerce service, a financial service, a communication service, a risk control service, a video monitoring service, etc., and these services may be independently Providing services to users, and also providing services to users with mutual assistance.
  • the terminal rule engine device may belong to a certain type of service and is used only for such a service, and may also be used for more than one type of service.
  • the relevant function module of the service can call the terminal rule engine device to run the corresponding rule by sending a rule running request to the interface module 101.
  • the interface module 101 in addition to receiving the rule running request, other interactions performed by the terminal rule engine device with the outside may also be performed by the interface module 101, for example, returning a rule running result, granting a calling right, acquiring related business data, and the like.
  • the terminal rule engine device may obtain a rule set of the service from the server.
  • the obtaining process may be initiated by the terminal rule engine device, for example, the terminal rule engine device requests the server to obtain, etc., or may be initiated by the server, for example, the server pushes the terminal rule engine device.
  • the process of obtaining the rule set of the service is generally performed in advance. In this case, when the rule needs to be run, the rule set is already saved in the terminal. Up, therefore, you can directly run the corresponding rules in the rule set without interacting with the server.
  • the obtaining process may be specifically performed by the management module 102, or may be performed by other modules of the terminal rules engine device.
  • the management of the rule set by the management module 102 may specifically include: updating and maintaining management of the rule set, making decisions about what rules should be run, and the like.
  • the management module 102 can also manage other data involved in the terminal rule engine device, such as business data related to the rule tree.
  • each terminal can not only run rules independently of each other, but also can operate the rules differently or run differentiated rules even for the same service. These differentiating can be implemented based on the differentiated device identification and/or user identification corresponding to different terminals.
  • the server may provide different rule sets to each terminal according to different device identifiers and/or user identifiers provided by each terminal.
  • the server may also provide the same rule set to each terminal.
  • the management module 102 and the running module 103 of each terminal may separately manage the rule set according to the device identifier and/or the user identifier corresponding to the terminal. And running. For example, only the rules for matching the device identifier and the user identifier corresponding to the terminal in the rule set are run, and so on.
  • the representation of the rules in the rule set is not limited, and may be expressed in a code form (such as a script statement, a regular expression, etc.), may be expressed in a text form (such as a pseudo code), or may be Expressed in a special data structure (such as a tree, linked list, graph, etc.), and so on.
  • a code form such as a script statement, a regular expression, etc.
  • a text form such as a pseudo code
  • a special data structure such as a tree, linked list, graph, etc.
  • the rule is run in a manner of a rule tree.
  • the running module 103 can generate a rule tree for running the rule according to the rules to be run in the rule set.
  • the rules in the rule set itself can be represented in the form of a rule tree.
  • the running module 103 does not need to generate a rule tree, but directly obtains a corresponding rule tree from the rule set for use in Run the rules.
  • the structure of the rule tree is characterized by distinct layers, easy to split, orderly, and good visibility. These features can facilitate the management, analysis, and tuning of R&D personnel, operation and maintenance personnel, or preset machine logic.
  • the whole rule can improve the efficiency of R&D operation and maintenance and reduce the cost of R&D operation and maintenance.
  • the rule tree can be used to manage rules conveniently. It is possible to perform fine-grained rule adjustment based on node location exchange and reorganization, so as to improve the efficiency of the rules and improve the fineness of the rules.
  • the rule tree it is more efficient to use the rule tree to run the rules.
  • the reason is that in the process of running the rule, the data of each node in the rule tree needs to be read, and the hierarchical structure in the rule tree cooperates with the pointer of the non-leaf node to effectively improve the reading speed of each node data, thereby making the efficiency of running the rule Higher.
  • the running rule requires not only the rule tree but also the service data involved in the rule tree, and the service data reflects the specific service scenario corresponding to the current rule to be run.
  • the service data related to the rule tree may be directly obtained from the related function module of the service by the management module 102 or the running module 103.
  • the running module 103 may not directly interact with the related function module of the service, but may The management module 102 obtains the service data related to the rule tree, thereby facilitating the security of the running module 103.
  • connection manner between the modules in FIG. 1 is only an example, and is not limited to the application.
  • Each module may have other connection manners as long as the modules can directly or indirectly communicate with each other. Just fine.
  • the rule engine device is deployed on the terminal, and the device identifier and/or the user identifier of the terminal are implemented, and the rule set at the device level and/or the user level is managed, so that the rules in the rule set run on the terminal, and may also be different.
  • the rules running and updating of the terminal are isolated from each other, which reduces the risk when the rules are run or updated. Therefore, the risky problems in the prior art can be partially or completely solved.
  • the embodiment of the present application further provides some specific implementation manners and expansion schemes of the foregoing solutions, which are described below.
  • Each module in FIG. 1 may further be a fine molecular module, and each of the sub-modules subdivided may specifically implement some functions of its corresponding parent module.
  • the running module 103 may include a rule tree calculation sub-module for generating and calculating a rule tree. Specifically, the foregoing execution module 103 generates a rule tree according to the obtained rule, and may include: the rule tree calculation submodule determines, according to the obtained rule, an expression for reflecting the rule and/ Or a logical operator that generates a rule tree based on the determined expression and/or logical operator.
  • the determined expression may be used to reflect the determination condition in the rule, and the determined logical operator may be used to logically combine the plurality of determination conditions.
  • the expression includes but is not limited to a logical expression, and the value of the expression is generally true (TRUE) or false (FALSE); the logical operators include but are not limited to (AND), or (OR), non (NOT), XOR logical operator.
  • rule tree may also be constructed by using characters or other characters.
  • the rule tree can be constructed in a variety of ways. Considering the computational efficiency, the leaf nodes in the rule tree can be determined expressions, and the non-leaf nodes in the rule tree can be determined logical operators, which is convenient for achieving high computational efficiency.
  • FIG. 2 For ease of understanding, the embodiment of the present application provides a schematic structural diagram of a rule tree, as shown in FIG. 2 .
  • the rule tree in Figure 2 is a multi-fork tree.
  • the multi-fork tree has three layers.
  • the first layer contains one root node (belonging to a non-leaf node), and the second layer contains two non-leaf nodes, one leaf node, and the third layer. Contains 5 leaf nodes.
  • the root node is the "AND” logical operator and the two non-leaf nodes of the second layer They are the "OR” logical operator and the "AND” logical operator.
  • the structure of the rule tree in FIG. 2 is only an example.
  • the present application does not limit the number of layers of the rule tree, the number of forks, and the specific expression or logical operator of each node.
  • the running module 103 determines the running result of the rule according to the rule tree and the service data, and specifically includes: the running module traversing the rule tree in a subsequent order.
  • the root node of the rule tree is evaluated according to the service data in the post-order traversal process, and the evaluation result is determined as the running result of the rule.
  • the running result is generally TRUE or FALSE.
  • the running result may not be a logical operation result.
  • the running result may also be a numerical value for characterizing one of two or more cases.
  • the decision conditions (expressions) corresponding to the rules are distributed at the end of the branch of the rule tree.
  • the logical combination of each decision condition should be very clear and very orderly (to logically combine all the child nodes of each parent node). , wherein the logical combination closer to the end of the branch has a higher priority); accordingly, when determining the running result of the rule, the post-order traversal is performed, and the traversal is performed from the end of the branch, which is naturally preferred to the end of the branch.
  • the logical combination value is calculated, from bottom to top until the value of the root node is obtained, in accordance with the desired priority order, and no additional logic is required to intervene, which is beneficial to efficiently determine the running result of the rule.
  • the rule tree in addition to the post-order traversal, the rule tree may be calculated based on the middle order traversal or the pre-order traversal.
  • the efficiency of determining the running result of the rule is generally not as good as the subsequent order traversal;
  • the structure of the rule tree and the meaning of each node may also change.
  • the leaf node is not necessarily an expression.
  • the non-leaf node is not necessarily a logical operator, and it is not necessarily the result of evaluating the evaluation of the root node as a rule. .
  • the running module 103 may further include an expression calculation submodule for calculating the value of the expression;
  • the business data involved in the rule tree includes the business data required to calculate the expression.
  • the operation module 103 is configured to evaluate the root node of the rule tree, and specifically includes: the expression calculation sub-module calculates a value of each of the expressions according to the obtained service data required to calculate the expression;
  • the rule tree calculation sub-module calculates, according to the expression, the value of each of the expressions calculated by the sub-module and the determined logical operator according to the expression, and the root of the rule tree Node evaluation.
  • the embodiment of the present application provides a first detailed structural diagram of the terminal rule engine device in FIG. 1, as shown in FIG.
  • the execution module 103 in FIG. 3 includes a rule tree calculation sub-module 1031 and an expression calculation sub-module 1032.
  • the sub-modules of the running module 103 are not limited to the two sub-modules in FIG. 3, and other sub-modules that the running module 103 can include are further analyzed below.
  • the running module 103 may return the running result to the requester. Further, in order to facilitate the analysis of the running result, the running information related to the running result may also be generated and output, and the running The information may be: a traversal path when calculating the rule tree, and intermediate results, and the like.
  • the run module 103 may also include a result backtracking path sub-module for completing the work in the previous paragraph.
  • the result backtracking path sub-module performs backtracking path record on the evaluation result, so as to output corresponding operation information.
  • the information provided by the backtracking path sub-module can help the R&D or operation and maintenance personnel monitor the running status of the rules, predict or locate the running problems of the rules, and thus help to improve the terminal rules engine.
  • the rule tree calculation sub-module 1031 and the expression calculation module 1032 undertake most of the calculation work in the rule running process. In practical applications, some optimization algorithms may be used for these calculations. The actual execution of the work is optimized to improve computational efficiency. In order to facilitate the optimization of the function of the sub-module, the operation module 103 may also include a special optimization sub-module.
  • the running module 103 may further include a tree optimization submodule; the tree optimization submodule adopts The optimization algorithm optimizes the rule tree calculation sub-module.
  • the running module 103 can further include an expression optimization sub-module; the expression optimization sub-module optimizes the expression calculation sub-module by using an optimization algorithm.
  • the foregoing optimization operation may be performed offline; or may be performed online.
  • the optimization submodule (the tree optimization submodule and the expression optimization submodule) may be connected to the cloud and directly obtained from the cloud.
  • the latest optimization algorithm is used to optimize the calculation sub-module (the rule tree calculation sub-module 1031, the expression calculation module 1032), or the historical data or real-time data of the rule operation may be uploaded to the cloud, and the backward optimization optimizer is analyzed by the cloud.
  • the module provides suitable optimization algorithms for optimizing computational submodules, and so on.
  • optimization sub-module can make the calculation sub-module easier to improve and easier to expand; not only that, the optimization sub-module also reduces the direct interaction between the calculation sub-module and the outside world, and is beneficial to the calculation sub-module to focus on the calculation work. It is also beneficial to improve the security of the computing sub-module.
  • FIG. 3 Based on the above analysis of the sub-module of the running module 103, the embodiment of the present application is based on FIG. 3, and further provides a second detailed structural diagram of the terminal rule engine device in FIG. 1, as shown in FIG.
  • the running module 103 in FIG. 4 further includes a result backtracking path sub-module 1033, a tree optimization sub-module 1034, and an expression optimization sub-module 1035.
  • the management module 102 can be responsible for the work of updating the rule set in addition to managing the existing rule set. Specifically, the management module 102 further updates the rule set obtained from the server according to the device identifier and/or the user identifier corresponding to the management module. Further, the data that can be managed by the management module 102 is not limited to the existing rule set and the update data of the rule set. For example, the management module 102 can also manage the obtained service data related to the rule tree, and the like. The data may be obtained through a corresponding data acquisition interface, and further, the management module 102 may also manage the data acquisition interfaces together.
  • the management module 102 can also follow the different functions of the fine molecular module. According to the above analysis of the function of the management module 102, a corresponding sub-module subdivision mode is provided as an example:
  • the management module 102 may include: a data acquisition interface management sub-module and a rule set management sub-module; the data acquisition interface management sub-module manages the obtained service data related to the rule tree; the rule set management sub-manager A module that manages the set of rules.
  • FIG. 4 the embodiment of the present application is based on FIG. 4, and further provides a third detailed structure diagram of the terminal rule engine device in FIG. 1, as shown in FIG. 5.
  • the management module 102 in FIG. 5 includes a data acquisition interface management sub-module 1021 and a rule set management sub-module 1022.
  • the structure and detailed structure of the terminal rule engine device are not limited to the above examples, and the module division manner and the sub-module division manner may also be changed as long as the function of the terminal rule engine device can be implemented.
  • the terminal rule engine device provided by the embodiment of the present application is described in detail above. Based on the same idea, the embodiment of the present application further provides a method for operating a terminal rule, as shown in FIG. 6.
  • FIG. 6 is a schematic flowchart of a method for operating a terminal rule according to an embodiment of the present disclosure.
  • the execution body of the method may be a terminal.
  • the execution subject may be the above-mentioned terminal rule engine device located at the terminal, or other devices having similar functions.
  • the process in Figure 6 can include the following steps:
  • S601 The terminal receives a rule running request for a service.
  • the terminal obtains a rule corresponding to the request from a rule set of the service, where the rule set is obtained from a server according to a device identifier and/or a user identifier corresponding to the terminal.
  • S603 The terminal generates a rule tree according to the obtained rule, and obtains service data related to the rule tree.
  • S604 The terminal determines, according to the rule tree and the service data, a running result of the rule.
  • the method provided by the present application is corresponding to the device provided by the present application, and the method also has the above device Similar beneficial technical effects, since the beneficial technical effects of the above device have been described in detail above, the beneficial technical effects of the method will not be described herein.
  • the embodiments of the present application further provide some specific implementations and extensions of the method, which have been analyzed in detail in the description of the above device, and therefore, only a brief description will be given here.
  • the terminal generates a rule tree according to the obtained rule, which may include: the terminal determining, according to the obtained rule, an expression for reflecting the rule and / or logical operator; the terminal generates a rule tree according to the determined expression and / or logical operator.
  • the leaf node in the rule tree may be the determined expression, and the non-leaf node in the rule tree may be the determined logical operator.
  • step S604 the terminal determines, according to the rule tree and the service data, a result of the running of the rule, which may include: the terminal traversing the rule tree in a post-order, and traversing the post-order The root node of the rule tree is evaluated according to the service data, and the evaluation result is determined as the running result of the rule.
  • the service data related to the rule tree includes the service data required for the calculation of the expression; and the evaluation of the root node of the rule tree in the foregoing paragraph may specifically include: calculating according to the obtained Calculating the value of each of the expressions in the business data required by the expression; in the post-order traversal process, according to the calculated value of each of the expressions and the determined logical operator, The root node of the rule tree is evaluated.
  • the update data of the rule set obtained by the terminal from the server according to the device identifier and/or the user identifier corresponding to the terminal may also be performed periodically or irregularly.
  • the terminal rule engine device and the terminal rule running method provided by the embodiments of the present application are described in detail above. In practical applications, considering that rules have a greater impact on the business, therefore, for rules
  • the operation process can also provide some security protection measures as much as possible to improve the security, stability and reliability of the business. These protections may also be part of the solution of the present application, which may include protection measures in software or hardware.
  • code processing protection logic for rule execution can be appropriately protected, for example, shelling and code virtualization can be used.
  • Code protection technologies such as sandboxes are protected.
  • the terminal rule engine device or the terminal rule running method may be deployed on a highly secure hardware (for example, a trusted execution environment TEE, a security environment TE, etc.), thereby providing a more secure rule running process. environment of.
  • a highly secure hardware for example, a trusted execution environment TEE, a security environment TE, etc.
  • the solution of the present application has been implemented in the scenario of the risk control service, and has achieved good results.
  • the running rule is a risk control rule, and the corresponding risk control object includes a payment process and an authentication process.
  • the solution of the present application can also be implemented in a scenario other than the risk control service, and a similar effect can be obtained.
  • embodiments of the present invention can be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or a combination of software and hardware. Moreover, the invention can 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, etc.) including computer usable program code.
  • computer-usable storage media including but not limited to disk storage, CD-ROM, optical storage, etc.
  • the computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that it is stored in the computer readable memory.
  • the instructions produce an article of manufacture comprising an instruction device that implements the functions specified in a block or blocks of a flow or a flow and/or a block diagram of the flowchart.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device.
  • the instructions provide steps for implementing the functions specified in one or more of the flow or in a block or blocks of a flow diagram.
  • a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
  • processors CPUs
  • input/output interfaces network interfaces
  • memory volatile and non-volatile memory
  • the memory may include non-persistent memory, random access memory (RAM), and/or non-volatile memory in a computer readable medium, such as read only memory (ROM) or flash memory.
  • RAM random access memory
  • ROM read only memory
  • Memory is an example of a computer readable medium.
  • Computer readable media includes both permanent and non-persistent, removable and non-removable media.
  • Information storage can be implemented by any method or technology.
  • the information can be computer readable instructions, data structures, modules of programs, 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 disk read only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, Magnetic tape cartridges, magnetic tape storage or other magnetic storage devices or any other non-transportable media can be used to store information that can be accessed by a computing device.
  • computer readable media does not include temporary storage of computer readable media, such as modulated data signals and carrier waves.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Artificial Intelligence (AREA)
  • Evolutionary Computation (AREA)
  • Data Mining & Analysis (AREA)
  • Mathematical Physics (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Computing Systems (AREA)
  • Computational Linguistics (AREA)
  • Databases & Information Systems (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Medical Informatics (AREA)
  • Algebra (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Probability & Statistics with Applications (AREA)
  • Pure & Applied Mathematics (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Information Transfer Between Computers (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Telephonic Communication Services (AREA)
  • Stored Programmes (AREA)
  • Computer And Data Communications (AREA)
  • User Interface Of Digital Computer (AREA)

Abstract

本申请公开了一种终端规则引擎装置、一种终端规则运行方法，用以解决现有技术中的规则运行方式的全局性导致运行规则或更新规则时的风险较高的问题。所述装置位于终端，包括接口模块、管理模块、运行模块；所述接口模块，接收针对业务的规则运行请求；所述管理模块，对根据所述终端对应的设备标识和/或用户标识，从服务端获得的所述业务的规则集进行管理；所述运行模块，响应于所述接口模块接收的所述请求，从所述管理模块管理的所述规则集内获得所述请求对应的规则，根据获得的所述规则，生成规则树，并获得所述规则树涉及的业务数据，根据所述规则树和所述业务数据，确定所述规则的运行结果。

Description

终端规则引擎装置、终端规则运行方法 技术领域
本申请涉及计算机技术领域，尤其涉及一种终端规则引擎装置、一种终端规则运行方法。
背景技术
随着计算机技术和互联网技术的迅速发展，很多业务都可以在网上进行。网上业务的正常进行需要依赖于预设的业务的规则，比如，支付业务的规则、风险控制业务的规则，等等。
在现有技术中，在服务端运行业务的规则，所运行的规则全局性地作用于该服务端对应的所有终端，服务端的规则运行结果会发送给其对应的各终端，各终端再根据规则运行结果，决定如何执行后续业务处理动作。
但是，上述现有技术中的规则运行方式的全局性导致运行规则或更新规则时的风险较高，一旦出现问题会对各终端都产生不利影响。
发明内容
本申请实施例提供一种终端规则引擎装置，用以解决现有技术中的规则运行方式的全局性导致运行规则或更新规则时的风险较高的问题。
本申请实施例还提供一种终端规则运行方法，用以解决现有技术中的规则运行方式的全局性导致运行规则或更新规则时的风险较高的问题。
本申请实施例采用下述技术方案：
本申请实施例提供的一种终端规则引擎装置，所述装置位于终端，包括接口模块、管理模块、运行模块；
所述接口模块，接收针对业务的规则运行请求；
所述管理模块，对根据所述终端对应的设备标识和/或用户标识，从服务 端获得的所述业务的规则集进行管理；
所述运行模块，响应于所述接口模块接收的所述请求，从所述管理模块管理的所述规则集内获得所述请求对应的规则，根据获得的所述规则，生成规则树，并获得所述规则树涉及的业务数据，根据所述规则树和所述业务数据，确定所述规则的运行结果。
本申请实施例还提供一种终端规则运行方法，包括：
终端接收针对业务的规则运行请求；
所述终端从所述业务的规则集内获得所述请求对应的规则，所述规则集是根据所述终端对应的设备标识和/或用户标识从服务端获得的；
所述终端根据获得的所述规则，生成规则树，并获得所述规则树涉及的业务数据；
所述终端根据所述规则树，确定所述规则的运行结果和所述业务数据。
本申请实施例采用的上述至少一个技术方案能够达到以下有益效果：在终端部署规则引擎装置，实现了通过终端的设备标识和/或用户标识，管理设备级和/或用户级的规则集，使得规则集内的规则运行在终端，也可以使得不同终端的规则运行、更新等处理相互隔离，降低了运行规则或更新规则时的风险，因此，可以部分或全部地解决现有技术中的问题。
附图说明
此处所说明的附图用来提供对本申请的进一步理解，构成本申请的一部分，本申请的示意性实施例及其说明用于解释本申请，并不构成对本申请的不当限定。在附图中：
图1为本申请实施例提供的一种终端规则引擎装置的结构示意图；
图2为本申请实施例提供的一种规则树的结构示意图；
图3为本申请实施例提供的图1中的终端规则引擎装置的第一种详细结构示意图；
图4为本申请实施例提供的图1中的终端规则引擎装置的第二种详细结构示意图；
图5为本申请实施例提供的图1中的终端规则引擎装置的第三种详细结构示意图；
图6为本申请实施例提供的一种终端规则运行方法的流程示意图。
具体实施方式
为使本申请的目的、技术方案和优点更加清楚，下面将结合本申请具体实施例及相应的附图对本申请技术方案进行清楚、完整地描述。显然，所描述的实施例仅是本申请一部分实施例，而不是全部的实施例。基于本申请中的实施例，本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例，都属于本申请保护的范围。
如背景技术所述，现有技术中的规则运行方式存在风险高的问题，不仅如此，现有技术还存在更多的问题。具体地，由于规则的运行发生在服务端，因此，需要耗费服务端大量的计算资源，服务端压力大；服务端为多个终端所运行规则的过程可能会相互影响，增加业务的稳定性风险；服务端的规则运行结果对业务有全局性的影响，当服务端的规则出现问题时或者规则运行过程中发生操作错误时，会得到不可靠的规则运行结果，相应地也会对业务带来全局性的不利影响。
本申请的方案提供了置于终端上的终端规则引擎装置，可以将规则运行在各终端上，而不是在服务端上，可以部分或全部地解决上述问题。下面对本申请的方案进行说明。
图1为本申请实施例提供的一种终端规则引擎装置，该装置位于终端。
在本申请实施例中，终端可以是手机、平板电脑、智能手表、智能手环、车载移动台、或个人计算机等设备。
终端有其对应的服务端，所述服务端一般可以是搭载于该终端上的一个或 多个应用(比如手机App)的服务端。任一服务端可以对应多个终端，每个终端上可以分别有自己的终端规则引擎装置，并可以相互独立地运行业务的规则。
图1中的装置包括：接口模块101、管理模块102、运行模块103；
所述接口模块101，接收针对业务的规则运行请求；
所述管理模块102，对根据所述终端对应的设备标识和/或用户标识，从服务端获得的所述业务的规则集进行管理；
所述运行模块103，响应于所述接口模块101接收的所述请求，从所述管理模块102管理的所述规则集内获得所述请求对应的规则，根据获得的所述规则，生成规则树，并获得所述规则树涉及的业务数据，根据所述规则树和所述业务数据，确定所述规则的运行结果。
在本申请实施例中，对业务内容不做限定，可以是任意可在网上进行的业务，比如，电子商务业务、金融业务、通信业务、风险控制业务、视频监控业务等，这些业务可以独立地为用户提供服务，也可以相互协助地为用户提供服务。
在本申请实施例中，终端规则引擎装置可以属于某一类业务并仅为该类业务所用，也可以为不止一类业务使用。
业务的相关功能模块可以通过向接口模块101发送规则运行请求，调用终端规则引擎装置运行相应的规则。对于接口模块101，除了可以接收规则运行请求以外，终端规则引擎装置与其外部进行的其他交互也可以通过接口模块101进行，比如，返回规则运行结果、授予调用权限、获取相关的业务数据等。
在本申请实施例中，终端规则引擎装置可以从服务端获得业务的规则集。获得过程可以由终端规则引擎装置主动发起，比如，终端规则引擎装置向服务端请求获得等；也可以由服务端主动发起，比如，服务端向终端规则引擎装置推送等。在实际应用中，为了提高规则运行效率，业务的规则集的获得过程一般是预先执行的，在这种情况下，在需要运行规则时，规则集已经保存在终端 上了，因此，无需与服务端交互即可以直接运行规则集内的相应规则。
进一步地，该获得过程具体可以由管理模块102参与执行，也可以由终端规则引擎装置的其他模块参与执行。管理模块102对于规则集的管理具体可以包括：对于规则集的更新和维护管理、对于应当运行什么规则进行决策等。除了规则集以外，管理模块102也可以对终端规则引擎装置涉及的其他数据进行管理，比如，所述规则树涉及的业务数据等。
在本申请实施例中，各终端不仅可以相互独立地运行规则，而且即使是对于同一种业务，也可以差异化地运行规则，或者运行差异化的规则。这些差异化可以基于不同终端所对应的设备标识和/或用户标识的差异化实现。
例如，服务端可以根据各终端提供的不同的设备标识和/或用户标识，提供不同的规则集给各终端。
又例如，服务端也可以给各终端提供相同的规则集，但是，各终端的管理模块102和运行模块103可以根据本终端对应的设备标识和/或用户标识，对规则集进行差异化地管理以及运行。比如，只运行规则集内与本终端对应的设备标识和用户标识匹配的规则，等等。
在本申请实施例中，对规则集内的规则的表示形式并不做限定，可以以代码形式(如脚本语句、正则表达式等)表示、可以以文字形式(如伪代码)表示、也可以以特殊数据结构形式(如树、链表、图等)表示，等等。
在本申请实施例中，采用规则树的方式运行规则。运行模块103可以根据规则集内待运行的规则，生成规则树，以用于运行规则。如前所述，规则集内的规则本身可以以规则树的形式所表示，在这种情况下，运行模块103无需生成规则树，而是直接从规则集内获得对应的规则树，以用于运行规则。
需要说明的是，之所以采用规则树的方式运行规则，是出于以下两方面的考虑。
第一方面，规则树的结构具有层次分明、易拆分、有序性、可视性好等特点，这些特点可以便于研发人员、运维人员或预设的机器逻辑管理、分析和调 整规则，可以提高研发运维效率，降低研发运维成本。比如，采用规则树可以很方便地管理规则，可以基于节点位置交换、重新组织等方式进行细粒度的规则调整以追求更优，进而也有利于提高规则的运行效率，以及提高规则的精细程度。
第二方面，采用规则树的方式运行规则的效率较高。原因在于：运行规则过程中需要读取规则树中各节点数据，而规则树中的层次结构配合非叶子节点的指针可以有效地提高对各节点数据的读取速度，进而可以使运行规则的效率较高。
在本申请实施例中，运行规则不仅需要用到规则树，还需要规则树涉及的业务数据参与，所述业务数据反映了当前所要运行的规则对应的具体业务场景。所述规则树涉及的业务数据可以由管理模块102或运行模块103从业务的相关功能模块直接获得，对于前一种情况，运行模块103可以不与业务的相关功能模块直接交互，而是可以从管理模块102获得所述规则树涉及的业务数据，从而有利于提高运行模块103的安全性。
需要说明的是，图1中各模块之间的连接方式只是一种示例，并非对本申请的限定，各模块也可以有其他的连接方式，只要能够使得各模块相互之间可以直接或间接地通信即可。
通过上述方案，在终端部署规则引擎装置，实现了通过终端的设备标识和/或用户标识，管理设备级和/或用户级的规则集，使得规则集内的规则运行在终端，也可以使得不同终端的规则运行、更新等处理相互隔离，降低了运行规则或更新规则时的风险，因此，可以部分或全部地解决现有技术中风险较高的问题。
不仅如此，通过上述方案，还可以部分或全部地解决现有技术中的其他问题。具体地，由于运行规则的工作由服务端分散转移到各终端，因此，也可以减少服务端计算资源的耗费量，降低服务端压力；由于各终端可以相互独立地运行规则，一般不会相互影响，因此，可以降低业务的稳定性风险，而且各终 端上的规则运行结果一般只影响本终端，即使某终端的规则出现问题时或者规则运行过程中发生操作错误时，得到了不可靠的规则运行结果，一般也只对该终端的业务带来不利影响，而不会影响到其他终端。
基于上述方案，本申请实施例还提供了上述方案的一些具体实施方案，以及扩展方案，下面进行说明。
图1中的各模块可以进一步地细分子模块，细分出的每个子模块可以具体地实现其对应的父模块的部分功能。
在本申请实施例中，运行模块103可以包括用于生成以及计算规则树的规则树计算子模块。具体地，上述的所述运行模块103根据获得的所述规则，生成规则树，可以包括：所述规则树计算子模块根据获得的所述规则，确定用于反映所述规则的表达式和/或逻辑运算符，根据确定的所述表达式和/或逻辑运算符，生成规则树。
在本申请实施例中，确定的表达式可以用于反映规则中的判定条件，而确定的逻辑运算符可以用于对多个判定条件进行逻辑组合。其中，表达式包括但不限于逻辑表达式，表达式的值一般为真(TRUE)或假(FALSE)；逻辑运算符包括但不限于与(AND)、或(OR)、非(NOT)、异或(XOR)逻辑运算符。
需要说明的是，表达式、逻辑运算符是规则树的构成元素的示例，在实际应用中，也可以用文字或其他字符构成规则树。
进一步地，规则树的构成方式可以有多种。考虑到计算效率，规则树中的叶子节点可以为确定的表达式，规则树中的非叶子节点可以为确定的逻辑运算符，如此便于实现较高的计算效率。
为了便于理解，本申请实施例提供了一种规则树的结构示意图，如图2所示。
图2中的规则树为多叉树，该多叉树共有三层，第一层包含一个根节点(属于非叶子节点)，第二层包含两个非叶子节点、一个叶子节点，第三层包含5个叶子节点。其中，根节点为“AND”逻辑运算符、第二层的两个非叶子节点 分别为“OR”逻辑运算符、“AND”逻辑运算符。
需要说明的是，图2中的规则树的结构只是示例，本申请对规则树的层数、分叉数目、各节点具体是怎样的表达式或逻辑运算符等并不做限定。
进一步地，在计算规则树时需要根据规则树的具体结构进行。以图2中的规则树为例，上述的运行模块103根据所述规则树和所述业务数据，确定所述规则的运行结果，具体可以包括：所述运行模块后序遍历所述规则树，在所述后序遍历过程中根据所述业务数据对所述规则树的根节点求值，将求值结果确定为所述规则的运行结果。运行结果一般为TRUE或FALSE，当然，在实际应用中，运行结果也可能不是一个逻辑运算结果，比如，运行结果也可以是用于表征两种以上情况中的一种情况的数值等。
需要说明是的，这里采用后序遍历是与上面列举的规则树结构(叶子节点为表达式、非叶子节点为逻辑运算符)相匹配的，两者的匹配带来了如下优点：
规则对应的各判定条件(表达式)分布在规则树的分支末端，各判定条件相互之间应当如何进行逻辑组合非常清晰，也非常有序(要对每一个父节点的所有子节点进行逻辑组合，其中，越靠近分支末端的逻辑组合的优先级越高)；相应地，在确定规则的运行结果时，采用后序遍历，会从分支末端出发进行遍历，很自然地优先对靠近分支末端的逻辑组合值进行计算，从下至上直至求得根节点的值，符合期望的优先级顺序，也无需加入额外的逻辑进行干预，有利于高效地确定规则的运行结果。
在本申请实施例中，除了后序遍历以外，也可以基于中序遍历或前序遍历计算规则树，但是，在后者的情况下，确定规则的运行结果的效率一般不如后序遍历；不仅如此，规则树的结构和各节点的意义也可能改变，叶子节点未必是表达式，非叶子节点未必是逻辑运算符，也未必是将对根节点求值的求值结果确定为规则的运行结果。
在本申请实施例中，要实现规则树计算，需要计算规则树中包含的表达式的值，运行模块103还可以包括用于计算表达式的值的表达式计算子模块；所 述规则树涉及的业务数据包括计算所述表达式所需的业务数据。上述的运行模块103对所述规则树的根节点求值，具体可以包括：所述表达式计算子模块根据获得的计算所述表达式所需的业务数据，计算各所述表达式的值；所述规则树计算子模块在所述后序遍历过程中，根据所述表达式计算子模块计算出的各所述表达式的值与确定的所述逻辑运算符，对所述规则树的根节点求值。
根据以上对运行模块103的子模块的分析，本申请实施例提供了图1中的终端规则引擎装置的第一种详细结构示意图，如图3所示。
图3中的运行模块103中包括了规则树计算子模块1031和表达式计算子模块1032。
在实际应用中，运行模块103的子模块并不限于图3中的两个子模块，下面继续对运行模块103可以包含的其他一些子模块进行分析。
在本申请实施例中，运行模块103在确定规则的运行结果后，可以将运行结果返回请求者，进一步地，为了便于分析运行结果，还可以生成运行结果相关的运行信息并输出，所述运行信息可以是：计算规则树时的遍历路径以及各中间结果等。
因此，运行模块103中还可以包括用于完成上一段中的工作的结果回溯路径子模块。所述结果回溯路径子模块，对所述求值结果进行回溯路径记录，以便于输出相应的运行信息。在实际应用中，结果回溯路径子模块所提供的信息可以帮助研发或运维人员监控规则运行状态，预测或定位规则运行问题，进而也有助于对终端规则引擎进行改进。
在本申请实施例中，根据上面的分析可知，规则树计算子模块1031和表达式计算模块1032承担了规则运行过程中的大部分计算工作，在实际应用中，可以采用一些优化算法针对这些计算工作的实际执行过程进行优化，以提高计算效率。为了便于优化子模块的功能，运行模块103中还可以包括专门的优化子模块。
例如，运行模块103还可以包括树优化子模块；所述树优化子模块，采用 优化算法对所述规则树计算子模块进行优化。
又例如，运行模块103还可以包括表达式优化子模块；所述表达式优化子模块，采用优化算法对所述表达式计算子模块进行优化。
在本申请实施例中，上述的优化操作可以是离线执行的；也可以是在线执行的，比如，优化子模块(树优化子模块、表达式优化子模块)可以与云端连接，从云端直接获得最新的优化算法以用于优化计算子模块(规则树计算子模块1031、表达式计算模块1032)，或者，也可以将规则运行的历史数据或实时数据上传至云端，由云端分析后向优化子模块提供适用的优化算法，以用于优化计算子模块，等等。
优化子模块的存在可以使得计算子模块更容易改进，也更容易扩展；不仅如此，优化子模块一定程度上也减少了计算子模块与外界的直接交互，有利于计算子模块专注于完成计算工作，也有利于提高计算子模块的安全性。
根据上面对运行模块103的子模块的进一步分析，本申请实施例基于图3，还提供了图1中的终端规则引擎装置的第二种详细结构示意图，如图4所示。
相比于图3，图4中的运行模块103还包括了结果回溯路径子模块1033、树优化子模块1034、表达式优化子模块1035。
在本申请实施例中，前面已经提到，管理模块102除了负责管理已有的规则集以外，还可以负责规则集更新的工作。具体地，所述管理模块102，还根据自身对应的设备标识和/或用户标识，从服务端获得的所述规则集的更新数据。进一步地，管理模块102可以管理的数据也不不限于已有的规则集及规则集的更新数据，比如，管理模块102还可以对获得的所述规则树涉及的业务数据进行管理等，这些业务数据可以是通过相应的数据获取接口获得的，那么更进一步地，管理模块102还可以对这些数据获取接口一并管理。
在本申请实施例中，与运行模块103类似，管理模块102也可以按照其不同功能细分子模块。根据上面对管理模块102的功能的分析，提供了一种对应的子模块细分方式作为示例：
所述管理模块102可以包括：数据获取接口管理子模块、规则集管理子模块；所述数据获取接口管理子模块，对获得的所述规则树涉及的业务数据进行管理；所述规则集管理子模块，对所述规则集进行管理。
相应地，本申请实施例基于图4，还提供了图1中的终端规则引擎装置的第三种详细结构示意图，如图5所示。
相比于图4，图5中的管理模块102包括了数据获取接口管理子模块1021、规则集管理子模块1022。
以上列举了一种终端规则引擎装置的一种结构，以及基于该结构的三种详细结构作为示例。当然，终端规则引擎装置的结构及详细结构并不限于以上示例，其模块划分方式和子模块划分方式也是可以改变的，只要能够实现该终端规则引擎装置的功能即可。
以上对本申请实施例提供的一种终端规则引擎装置进行了详细说明。基于同样的思路，本申请实施例还对应地提供了一种终端规则运行方法，如图6所示。
图6为本申请实施例提供的一种终端规则运行方法的流程示意图。该方法的执行主体可以为终端，具体地，执行主体可以为位于终端的上述终端规则引擎装置，或其他具有类似功能的装置等。
图6中的流程可以包括以下步骤：
S601：终端接收针对业务的规则运行请求。
S602：所述终端从所述业务的规则集内获得所述请求对应的规则，所述规则集是根据所述终端对应的设备标识和/或用户标识从服务端获得的。
S603：所述终端根据获得的所述规则，生成规则树，并获得所述规则树涉及的业务数据。
S604：所述终端根据所述规则树和所述业务数据，确定所述规则的运行结果。
本申请提供的方法是与本申请提供的装置对应的，方法也具有与上述装置 类似的有益技术效果，由于上面已经对上述装置的有益技术效果进行了详细说明，因此，这里不再赘述该方法的有益技术效果。
基于该方法，本申请实施例还提供了该方法的一些具体实施方案，以及扩展方案，这些方案在对上述装置说明时已经进行了详细的分析，因此，这里仅进行简单说明。
在本申请实施例中，对于步骤S603，所述终端根据获得的所述规则，生成规则树，具体可以包括：所述终端根据获得的所述规则，确定用于反映所述规则的表达式和/或逻辑运算符；所述终端根据确定的所述表达式和/或逻辑运算符，生成规则树。
在本申请实施例中，所述规则树中的叶子节点可以为确定的所述表达式，所述规则树中的非叶子节点可以为确定的所述逻辑运算符。
进一步地，对于步骤S604，所述终端根据所述规则树和所述业务数据，确定所述规则的运行结果，具体可以包括：所述终端后序遍历所述规则树，在所述后序遍历过程中根据所述业务数据对所述规则树的根节点求值，将求值结果确定为所述规则的运行结果。
更进一步地，所述规则树涉及的业务数据包括计算所述表达式所需的业务数据；对于上一段中所述的对所述规则树的根节点求值，具体可以包括：根据获得的计算所述表达式所需的业务数据，计算各所述表达式的值；在所述后序遍历过程中，根据计算出的各所述表达式的值与确定的所述逻辑运算符，对所述规则树的根节点求值。
在本申请实施例中，在获得求值结果后，还可以执行：对所述求值结果进行回溯路径记录，以便于输出相应的运行信息。
在本申请实施例中，还可以定期或不定期地执行：所述终端根据自身对应的设备标识和/或用户标识，从服务端获得的所述规则集的更新数据。
以上对本申请实施例提供的终端规则引擎装置、终端规则运行方法进行了详细说明。在实际应用中，考虑到规则对于业务的影响较大，因此，对于规则 运行过程也可以尽可能地提供一些安全方面的保护措施，以提高业务的安全性、稳定性和可靠性。这些保护措施也可以作为本申请的方案的一部分，其可以包括软件或硬件方面的保护措施。
例如，在软件方面，可以适当地对规则运行的处理逻辑进行代码混淆保护，比如，可以使用加壳、代码虚拟化。沙箱等代码保护技术进行保护。
又例如，在硬件方面，可以在安全性较高的硬件(比如，可信执行环境TEE、安全环境TE等)上部署终端规则引擎装置或者终端规则运行方法，从而为规则运行过程提供了更安全的环境。
需要说明的是，本申请的方案已经在风险控制业务的场景下进行了实施，取得了很好的效果，所运行的规则是风险控制规则，对应的风险控制对象包括支付流程、认证流程等。当然，本申请的方案同样也可以在风险控制业务以外的其他业务的场景下实施，并可以取得类似的效果。
本领域内的技术人员应明白，本发明的实施例可提供为方法、系统、或计算机程序产品。因此，本发明可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且，本发明可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。
本发明是参照根据本发明实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中 的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
在一个典型的配置中，计算设备包括一个或多个处理器(CPU)、输入/输出接口、网络接口和内存。
内存可能包括计算机可读介质中的非永久性存储器，随机存取存储器(RAM)和/或非易失性内存等形式，如只读存储器(ROM)或闪存(flash RAM)。内存是计算机可读介质的示例。
计算机可读介质包括永久性和非永久性、可移动和非可移动媒体可以由任何方法或技术来实现信息存储。信息可以是计算机可读指令、数据结构、程序的模块或其他数据。计算机的存储介质的例子包括，但不限于相变内存(PRAM)、静态随机存取存储器(SRAM)、动态随机存取存储器(DRAM)、其他类型的随机存取存储器(RAM)、只读存储器(ROM)、电可擦除可编程只读存储器(EEPROM)、快闪记忆体或其他内存技术、只读光盘只读存储器(CD-ROM)、数字多功能光盘(DVD)或其他光学存储、磁盒式磁带，磁带磁磁盘存储或其他磁性存储设备或任何其他非传输介质，可用于存储可以被计算设备访问的信息。按照本文中的界定，计算机可读介质不包括暂存电脑可读媒体(transitory media)，如调制的数据信号和载波。
还需要说明的是，术语“包括”、“包含”或者其任何其他变体意在涵盖非排他性的包含，从而使得包括一系列要素的过程、方法、商品或者设备不仅包括那些要素，而且还包括没有明确列出的其他要素，或者是还包括为这种过程、方法、商品或者设备所固有的要素。在没有更多限制的情况下，由语句“包括一个……”限定的要素，并不排除在包括所述要素的过程、方法、商品或者设 备中还存在另外的相同要素。
以上所述仅为本申请的实施例而已，并不用于限制本申请。对于本领域技术人员来说，本申请可以有各种更改和变化。凡在本申请的精神和原理之内所作的任何修改、等同替换、改进等，均应包含在本申请的权利要求范围之内。

Claims (18)

  1. 一种终端规则引擎装置，其特征在于，所述装置位于终端，包括接口模块、管理模块、运行模块；
    所述接口模块，接收针对业务的规则运行请求；
    所述管理模块，对根据所述终端对应的设备标识和/或用户标识，从服务端获得的所述业务的规则集进行管理；
    所述运行模块，响应于所述接口模块接收的所述请求，从所述管理模块管理的所述规则集内获得所述请求对应的规则，根据获得的所述规则，生成规则树，并获得所述规则树涉及的业务数据，根据所述规则树和所述业务数据，确定所述规则的运行结果。
  2. 如权利要求1所述的装置，其特征在于，所述运行模块包括规则树计算子模块；
    所述运行模块根据获得的所述规则，生成规则树，具体包括：
    所述规则树计算子模块根据获得的所述规则，确定用于反映所述规则的表达式和/或逻辑运算符，根据确定的所述表达式和/或逻辑运算符，生成规则树。
  3. 如权利要求2所述的装置，其特征在于，所述规则树中的叶子节点为确定的所述表达式，所述规则树中的非叶子节点为确定的所述逻辑运算符。
  4. 如权利要求3所述的装置，其特征在于，所述运行模块根据所述规则树和所述业务数据，确定所述规则的运行结果，具体包括：
    所述运行模块后序遍历所述规则树，在所述后序遍历过程中根据所述业务数据对所述规则树的根节点求值，将求值结果确定为所述规则的运行结果。
  5. 如权利要求4所述的装置，其特征在于，所述运行模块还包括表达式计算子模块；所述规则树涉及的业务数据包括计算所述表达式所需的业务数据；
    所述运行模块对所述规则树的根节点求值，具体包括：
    所述表达式计算子模块根据获得的计算所述表达式所需的业务数据，计算各所述表达式的值；
    所述规则树计算子模块在所述后序遍历过程中，根据所述表达式计算子模 块计算出的各所述表达式的值与确定的所述逻辑运算符，对所述规则树的根节点求值。
  6. 如权利要求4所述的装置，其特征在于，所述运行模块还包括结果回溯路径子模块；
    所述结果回溯路径子模块，对所述求值结果进行回溯路径记录，以便于输出相应的运行信息。
  7. 如权利要求1所述的装置，其特征在于，所述管理模块，还根据自身对应的设备标识和/或用户标识，从服务端获得的所述规则集的更新数据。
  8. 如权利要求2所述的装置，其特征在于，所述运行模块还包括树优化子模块；
    所述树优化子模块，采用优化算法对所述规则树计算子模块进行优化。
  9. 如权利要求5所述的装置，其特征在于，所述运行模块还包括表达式优化子模块；
    所述表达式优化子模块，采用优化算法对所述表达式计算子模块进行优化。
  10. 如权利要求5所述的装置，其特征在于，所述管理模块，还对获得的所述规则树涉及的业务数据进行管理。
  11. 如权利要求10所述的装置，其特征在于，所述管理模块包括：数据获取接口管理子模块、规则集管理子模块；
    所述数据获取接口管理子模块，对获得的所述规则树涉及的业务数据进行管理；
    所述规则集管理子模块，对所述规则集进行管理。
  12. 一种终端规则运行方法，其特征在于，包括：
    终端接收针对业务的规则运行请求；
    所述终端从所述业务的规则集内获得所述请求对应的规则，所述规则集是根据所述终端对应的设备标识和/或用户标识从服务端获得的；
    所述终端根据获得的所述规则，生成规则树，并获得所述规则树涉及的业务数据；
    所述终端根据所述规则树和所述业务数据，确定所述规则的运行结果。
  13. 如权利要求12所述的方法，其特征在于，所述终端根据获得的所述规则，生成规则树，具体包括：
    所述终端根据获得的所述规则，确定用于反映所述规则的表达式和/或逻辑运算符；
    所述终端根据确定的所述表达式和/或逻辑运算符，生成规则树。
  14. 如权利要求13所述的方法，其特征在于，所述规则树中的叶子节点为确定的所述表达式，所述规则树中的非叶子节点为确定的所述逻辑运算符。
  15. 如权利要求14所述的方法，其特征在于，所述终端根据所述规则树和所述业务数据，确定所述规则的运行结果，具体包括：
    所述终端后序遍历所述规则树，在所述后序遍历过程中根据所述业务数据对所述规则树的根节点求值，将求值结果确定为所述规则的运行结果。
  16. 如权利要求15所述的方法，其特征在于，所述规则树涉及的业务数据包括计算所述表达式所需的业务数据；
    对所述规则树的根节点求值，具体包括：
    根据获得的计算所述表达式所需的业务数据，计算各所述表达式的值；
    在所述后序遍历过程中，根据计算出的各所述表达式的值与确定的所述逻辑运算符，对所述规则树的根节点求值。
  17. 如权利要求15所述的方法，其特征在于，所述方法还包括：
    对所述求值结果进行回溯路径记录，以便于输出相应的运行信息。
  18. 如权利要求12所述的方法，其特征在于，所述方法还包括：
    所述终端根据自身对应的设备标识和/或用户标识，从服务端获得的所述规则集的更新数据。
PCT/CN2017/093212 2016-07-22 2017-07-17 终端规则引擎装置、终端规则运行方法 WO2018014814A1 (zh)

Priority Applications (9)

Application Number Priority Date Filing Date Title
PL17830448T PL3490193T3 (pl) 2016-07-22 2017-07-17 Urządzenie silnika regułowego terminala i sposób wykonania reguły w terminalu
SG11201900538VA SG11201900538VA (en) 2016-07-22 2017-07-17 Terminal rule engine device and terminal rule operation method
MYPI2019000365A MY202337A (en) 2016-07-22 2017-07-17 Terminal rule engine device and terminal rule operation method
ES17830448T ES2809169T3 (es) 2016-07-22 2017-07-17 Dispositivo de motor de reglas de terminal y método de operación de regla de terminal
JP2019503320A JP6709574B2 (ja) 2016-07-22 2017-07-17 端末規則エンジンデバイス及び端末規則運用方法
KR1020197005200A KR102158435B1 (ko) 2016-07-22 2017-07-17 단말기 룰 엔진 디바이스 및 단말기 룰 연산 방법
EP17830448.1A EP3490193B1 (en) 2016-07-22 2017-07-17 Terminal rule engine device and terminal rule operation method
US16/254,493 US20190156228A1 (en) 2016-07-22 2019-01-22 Terminal rule operation device and method
US16/725,728 US20200143272A1 (en) 2016-07-22 2019-12-23 Terminal rule operation device and method

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610587576.1 2016-07-22
CN201610587576.1A CN107645403B (zh) 2016-07-22 2016-07-22 终端规则引擎装置、终端规则运行方法

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/254,493 Continuation US20190156228A1 (en) 2016-07-22 2019-01-22 Terminal rule operation device and method

Publications (1)

Publication Number Publication Date
WO2018014814A1 true WO2018014814A1 (zh) 2018-01-25

Family

ID=60991940

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/093212 WO2018014814A1 (zh) 2016-07-22 2017-07-17 终端规则引擎装置、终端规则运行方法

Country Status (11)

Country Link
US (2) US20190156228A1 (zh)
EP (1) EP3490193B1 (zh)
JP (1) JP6709574B2 (zh)
KR (1) KR102158435B1 (zh)
CN (1) CN107645403B (zh)
ES (1) ES2809169T3 (zh)
MY (1) MY202337A (zh)
PL (1) PL3490193T3 (zh)
SG (1) SG11201900538VA (zh)
TW (1) TWI752038B (zh)
WO (1) WO2018014814A1 (zh)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110347708A (zh) * 2019-06-28 2019-10-18 深圳市元征科技股份有限公司 一种数据处理方法以及相关设备
CN110489965A (zh) * 2018-07-14 2019-11-22 北京数安鑫云信息技术有限公司 一种深度威胁识别实时引擎的实现方法及系统
CN112508440A (zh) * 2020-12-18 2021-03-16 深圳市赛为智能股份有限公司 数据质量评估方法、装置、计算机设备及存储介质
CN115934702A (zh) * 2023-03-14 2023-04-07 青岛安工数联信息科技有限公司 流程工业中数据处理方法、装置、存储介质及处理器
WO2024131990A1 (zh) * 2022-12-20 2024-06-27 天翼物联科技有限公司 基于物联网平台的海量规则处理方法、系统及存储介质

Families Citing this family (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109118353B (zh) * 2018-07-20 2022-03-15 中国邮政储蓄银行股份有限公司 风控模型的数据处理方法和装置
CN109189393A (zh) * 2018-07-24 2019-01-11 中国联合网络通信集团有限公司 业务处理方法及装置
CN109325150B (zh) * 2018-08-06 2020-09-29 京东数字科技控股有限公司 基于表达式的大数据处理方法、装置、电子设备、存储介质
CN109358874B (zh) * 2018-09-26 2023-08-04 中国平安人寿保险股份有限公司 业务规则更新方法、装置、计算机设备和存储介质
CN109445797A (zh) * 2018-10-24 2019-03-08 北京奇虎科技有限公司 处理任务执行方法及装置
CN109977009B (zh) * 2019-02-27 2023-04-25 深圳云步互娱网络科技有限公司 一种基于规则引擎的开关状态控制方法及系统
CN110109661A (zh) * 2019-05-09 2019-08-09 深圳美美网络科技有限公司 一种业务逻辑的开发方法及开发系统
CN112150091B (zh) * 2019-06-28 2024-09-20 华为技术有限公司 一种业务规则的处理方法及装置
CN111104779B (zh) * 2019-11-13 2023-09-29 泰康保险集团股份有限公司 理赔业务处理方法、装置、介质及电子设备
CN111126622B (zh) * 2019-12-19 2023-11-03 中国银联股份有限公司 一种数据异常检测方法与装置
CN111222942B (zh) * 2019-12-27 2024-03-19 北京懿医云科技有限公司 一种数据处理方法、装置、可读介质及电子设备
CN111311094B (zh) * 2020-02-14 2022-05-24 上海东普信息科技有限公司 供应链项目分析方法、装置、设备及存储介质
CN111563178A (zh) * 2020-04-28 2020-08-21 深圳壹账通智能科技有限公司 规则逻辑图对比方法、装置、介质及电子设备
CN111861382B (zh) * 2020-06-28 2024-04-09 微民保险代理有限公司 业务资格认证方法、装置、系统、计算机设备和存储介质
CN111815467A (zh) * 2020-08-20 2020-10-23 支付宝(杭州)信息技术有限公司 审核方法以及装置
CN113065656B (zh) * 2021-03-26 2022-09-30 龙马智芯（珠海横琴）科技有限公司 一种规则引擎配置方法、装置、服务器及可读存储介质
CN113986384A (zh) * 2021-10-28 2022-01-28 数字天堂(北京)网络技术有限公司 基于客户端和云端的处理装置、方法、设备和存储介质
CN116012123B (zh) * 2023-03-27 2023-07-04 湖南三湘银行股份有限公司 一种基于Rete算法的风控规则引擎方法及系统

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102024234A (zh) * 2010-06-04 2011-04-20 西本新干线股份有限公司 电子交易服务平台
US20150160938A1 (en) * 2013-12-10 2015-06-11 Fmr Llc Automation in rule engine in an integration development environment
CN105450705A (zh) * 2014-08-29 2016-03-30 阿里巴巴集团控股有限公司 业务数据处理方法及设备
CN105630797A (zh) * 2014-10-29 2016-06-01 阿里巴巴集团控股有限公司 数据处理方法及系统
CN105630617A (zh) * 2015-12-28 2016-06-01 山东中创软件工程股份有限公司 一种基于规则引擎的业务处理方法及系统

Family Cites Families (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS6293731A (ja) * 1985-10-21 1987-04-30 Hitachi Ltd ル−ル型システムの演算方式
US4809219A (en) * 1985-06-26 1989-02-28 International Business Machines Corporation Method for processing an expert system rulebase on a system having limited memory
FI946209A0 (fi) * 1994-12-30 1994-12-30 Nokia Telecommunications Oy Foerfarande foer jaemfoerande av attributvaerden hos kontrollerbara objektuttryck i ett naetelement
US20040024888A1 (en) * 2002-08-01 2004-02-05 Micron Technology, Inc. Systems and methods for managing web content and behavior rules engine
US7203744B1 (en) * 2002-10-07 2007-04-10 Ipolicy Networks, Inc. Rule compiler for computer network policy enforcement systems
AU2002952648A0 (en) * 2002-11-14 2002-11-28 Softlaw Corporation Limited Forward-chaining inferencing
US8234309B2 (en) * 2005-01-31 2012-07-31 International Business Machines Corporation Method for automatically modifying a tree structure
JP2006350464A (ja) * 2005-06-13 2006-12-28 Nec Corp データ収集システム、データ抽出サーバ、データ収集方法及びデータ収集プログラム
CN1924908A (zh) * 2005-08-30 2007-03-07 国际商业机器公司 规则遵守状况检测方法以及相关检测系统
US8191124B2 (en) * 2006-09-06 2012-05-29 Devicescape Software, Inc. Systems and methods for acquiring network credentials
CN101431430B (zh) * 2007-11-07 2011-09-21 中兴通讯股份有限公司 策略执行系统及其执行方法
US8112377B2 (en) * 2008-05-15 2012-02-07 Sap Ag Client-side rule engine for executing business rules in rich internet applications
US9021083B2 (en) * 2008-11-26 2015-04-28 Red Hat, Inc. Service oriented architecture with dynamic policy enforcement points
US9003387B2 (en) * 2009-09-25 2015-04-07 Fisher-Rosemount Systems, Inc. Automated deployment of computer-specific software updates
US20130247222A1 (en) * 2011-09-16 2013-09-19 Justin Maksim Systems and Methods for Preventing Access to Stored Electronic Data
DE112011105915T5 (de) * 2011-12-22 2014-09-11 Hewlett-Packard Development Company, L.P. Ermöglichen der Ausführung von entfernt gehosteten Anwendungen mithilfe von Anwendungsmetadaten und Client-Updates
US20140122396A1 (en) * 2012-10-29 2014-05-01 Qualcomm Incorporated Rules engine as a platform for mobile applications
US9549047B1 (en) * 2013-03-14 2017-01-17 Google Inc. Initiating a client-side user model
US9420002B1 (en) * 2013-03-14 2016-08-16 Mark McGovern Authorization server access system
CN104731800B (zh) * 2013-12-20 2018-10-23 中国银联股份有限公司 数据分析装置
JP6275542B2 (ja) * 2014-05-08 2018-02-07 株式会社野村総合研究所 分析装置およびコンピュータプログラム
US10402735B2 (en) * 2015-03-30 2019-09-03 The Nielsen Company (Us), Llc Methods and apparatus to improve decision tree execution
US10380334B2 (en) * 2015-11-06 2019-08-13 Sap Se Data access rules in a database layer
EP3425550B1 (en) * 2016-03-30 2020-09-30 Huawei Technologies Co., Ltd. Transaction method, transaction information processing method, transaction terminal and server

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102024234A (zh) * 2010-06-04 2011-04-20 西本新干线股份有限公司 电子交易服务平台
US20150160938A1 (en) * 2013-12-10 2015-06-11 Fmr Llc Automation in rule engine in an integration development environment
CN105450705A (zh) * 2014-08-29 2016-03-30 阿里巴巴集团控股有限公司 业务数据处理方法及设备
CN105630797A (zh) * 2014-10-29 2016-06-01 阿里巴巴集团控股有限公司 数据处理方法及系统
CN105630617A (zh) * 2015-12-28 2016-06-01 山东中创软件工程股份有限公司 一种基于规则引擎的业务处理方法及系统

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3490193A4 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110489965A (zh) * 2018-07-14 2019-11-22 北京数安鑫云信息技术有限公司 一种深度威胁识别实时引擎的实现方法及系统
CN110347708A (zh) * 2019-06-28 2019-10-18 深圳市元征科技股份有限公司 一种数据处理方法以及相关设备
CN110347708B (zh) * 2019-06-28 2023-06-30 深圳市元征科技股份有限公司 一种数据处理方法以及相关设备
CN112508440A (zh) * 2020-12-18 2021-03-16 深圳市赛为智能股份有限公司 数据质量评估方法、装置、计算机设备及存储介质
CN112508440B (zh) * 2020-12-18 2024-06-07 深圳市赛为智能股份有限公司 数据质量评估方法、装置、计算机设备及存储介质
WO2024131990A1 (zh) * 2022-12-20 2024-06-27 天翼物联科技有限公司 基于物联网平台的海量规则处理方法、系统及存储介质
CN115934702A (zh) * 2023-03-14 2023-04-07 青岛安工数联信息科技有限公司 流程工业中数据处理方法、装置、存储介质及处理器

Also Published As

Publication number Publication date
CN107645403A (zh) 2018-01-30
EP3490193B1 (en) 2020-06-17
CN107645403B (zh) 2020-07-03
SG11201900538VA (en) 2019-02-27
JP6709574B2 (ja) 2020-06-17
EP3490193A1 (en) 2019-05-29
TWI752038B (zh) 2022-01-11
KR102158435B1 (ko) 2020-09-22
TW201804393A (zh) 2018-02-01
KR20190033576A (ko) 2019-03-29
US20190156228A1 (en) 2019-05-23
JP2019525333A (ja) 2019-09-05
EP3490193A4 (en) 2019-05-29
ES2809169T3 (es) 2021-03-03
PL3490193T3 (pl) 2020-11-30
US20200143272A1 (en) 2020-05-07
MY202337A (en) 2024-04-24

Similar Documents

Publication Publication Date Title
WO2018014814A1 (zh) 终端规则引擎装置、终端规则运行方法
KR102226257B1 (ko) 서비스 데이터를 블록체인 시스템에 기입하기 위한 방법 및 디바이스
US11799741B2 (en) Systems and methods for enterprise information technology (IT) monitoring
JP6696001B2 (ja) リスク情報を出力し、リスク情報を構築するための方法及びデバイス
US9256657B1 (en) Tracking data communicated between services
US20210334876A1 (en) Data-analysis-based validation of product review data and linking to supply chain record data
CN112241506A (zh) 用户行为的回溯方法、装置、设备及系统
CN107018174A (zh) 一种单元化系统服务处理的方法、装置及业务处理系统
TW201828212A (zh) 調整風險參數的方法、風險識別方法及裝置
US20210374761A1 (en) Systems and methods for quantum based optimization of stress testing
Jeong et al. Anomaly teletraffic intrusion detection systems on hadoop-based platforms: A survey of some problems and solutions
CN104346365A (zh) 确定与特定业务相关的关联日志的方法和装置
Nazir et al. Cloud computing applications: a review
US11615074B2 (en) System and methods for intelligent path selection of enhanced distributed processors
CN110955685A (zh) 一种大数据基数估计方法、系统、服务器和存储介质
Garcia Bringas et al. BlockChain platforms in financial services: current perspective
Karumanchi et al. Cloud based supply chain management system using blockchain
US11151269B2 (en) Regulation-compliant processing of queries and storing of data in an on-demand environment
CN113159956A (zh) 账户数据处理方法、装置、设备及存储介质
US20170344454A1 (en) Determining dynamic statistics based on key value patterns
Zhou [Retracted] Regional Financial Data Processing Based on Distributed Decoding Technology
CN110060128B (zh) 一种数据管理方法及系统
US20230297550A1 (en) Dynamic data views
US20240127332A1 (en) Secure Decentralized System and Method
US11882124B1 (en) Account integration with an event-driven application programing interface call manager

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 17830448

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2019503320

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 20197005200

Country of ref document: KR

Kind code of ref document: A

ENP Entry into the national phase

Ref document number: 2017830448

Country of ref document: EP

Effective date: 20190222