Patent Grant
12118373
One or more implementations relate to the field of rules engines; and more specifically, to metadata driven guided rules editor.
A business rules engine is a software system that executes one or more business rules in a runtime production environment. Each rule comprises a set of the conditions followed by the set of actions. Any “if-then” statement that appears in traditional business logic may qualify as a business rule. The rules represent logic of represented from, for example, company policies, legal regulation, or other sources. A business rule system enables these company policies and other operational decisions to be defined, tested, executed and maintained separately from application code. Rule engine software is commonly provided as a component of a business rule management system, which may provide the ability to register, define, classify, and manage all the rules, verify consistency of rules definitions, define the relationships between different rules.
Given a rule engine and a rule language such as Drools (DRL), a user in an organization can write any rule, but conventional rule engine tools allow users to create rules that will end up being invalidated either at compile or run time because the tools do not determine if the rule is valid for the type of data used within the organization. For example, there are conventional guided rule editors to help users create and edit rules. The conventional guided rule editors may display options that enables the user to set attributes during rule creation. For example, it may be possible for the user to limit field values to items selected from a pre-configured list displayed via a drop down list. However, the range of field values may include values that make the rule invalid based on other aspects of the rule. In addition, conventional guided rule editors may also display text fields that enable the user to enter free form text as part of the rule. As such, users of the rule engine may spend significant time and expense creating rules that have mistakes, which also results in invalidated rules.
The following figures use like reference numbers to refer to like elements. Although the following figures depict various example implementations, alternative implementations are within the spirit and scope of the appended claims. In the drawings:
Guided Rules Editor
The following description describes implementations for an improved process and architecture for a metadata driven guided rules editor. The described subject matter can be implemented in the context of any cloud-based computing environment including, for example, a multi-tenant database system.
For context,
The rules management system 100 may comprise a set of software services that enable users to create and execute one or more business rules 118 from the database 120 in a runtime production environment to automate complex decision-making. The rules management system 100 enables policies and other operational decisions of particular to each organization 104 to be defined, tested, executed and maintained. The rules management system 100 typically support rules, facts, priority (score), mutual exclusion, preconditions, and other functions. Within the service provider 102, the rules management system 100 includes a rules translator/compiler 114, a rules engine 115, a controller 116, and one or more databases 120. The rules translator/compiler 114 may comprise a rules translator 130 and a rules compiler 134, which are responsible for translating and compiling rules created by the user into executable rules that are stored in a database (e.g., DB 120). During runtime, the rules engine 115 loads and fires off the executable rules.
Typically, customer organizations interact with a rules system by manually writing rules in a given rule language specification (e.g., Drools Rule Language (DRL). The customer organizations that build rules, however, have very different use-cases and some may belong to different industries, resulting in significant differences in metadata between organizations. Because of this, a rule that the rules engine may validate for one organization will not necessarily be validated for another organization. In addition, requiring a user to manually write rules may result in many rule validation errors. Conventional guided rules editors are an improvement over manually written rules, but guided rules editors typically have free-form fields into which the user types data. Consequently, conventional guided rules editors may not significantly reduce the rate of validation errors over manually written rules.
According to disclosed implementations, the system 100 improves over conventional guided rule editors by serving on client devices 125 a guided rules editor 122 that is driven by organization metadata 126 (and associated data). The system provider 102 makes the organization metadata 126 accessible to the guided rules editor 122 by implementing an abstraction layer within the controller 116 called a metadata service 124 between the guided rules editor 122 and both the database 120 and the rules translator/compiler 114.
The guided rules editor 122 presents the user with a dynamic input form that allows the user to create new rules and/or modify existing rules 118 using a point-and-click interaction model. Through the metadata service 124, parts of the rules are automatically populated by the organization metadata 126 and data owned by the organization 104 of the user/rule author. Populating rules with the organization metadata 126 scopes down the data that is displayed by the guided rules editor 122 and selected by the user during rule creation/modification, significantly reducing the amount of validation errors.
In one implementation, the guided rules editor 122 is a web-based application hosted by the service provider 102 and displayed over the network 108 on the client device 125. Additionally or alternatively, the guided rules editor 122 may be implemented as a downloaded executable run on the client device 125.
In some such implementations, the service provider 102 includes application servers configured to implement and execute software applications as well as provide related data, code, forms, renderable web pages and documents and other information to and from client device 125 and to store to, and retrieve from, a database system related data, objects, and Web page content.
The service provider 102 can provide multi-tenant access to multiple hosted (standard and custom) applications, including the guided rules editor 122, through network 108 to the client device 125. The term “server” is meant to refer to a computing device or system, including processing hardware and process space(s), an associated storage medium such as a memory device or database, and, in some instances, a database application (for example, OODBMS or RDBMS) as is well known in the art. Similarly, the database 120 can be implemented as a single database, a distributed database, a collection of distributed databases, a database with redundant online or offline backups or other redundancies, etc., and can include a distributed database or storage network and associated processing intelligence.
The network 108 can be or include any network or combination of networks of systems or devices that communicate with one another. For example, the network 108 can be or include any one or any combination of a LAN (local area network), WAN (wide area network), wireless network, cellular network, point-to-point network, star network, or other appropriate configuration. The network 108 can include a TCP/IP (Transfer Control Protocol and Internet Protocol) network, such as the global internetwork of networks often referred to as the “Internet”.
The client device 125 can communicate with service provider 102 using TCP/IP and, at a higher network level, other common Internet protocols to communicate, such as HTTP, FTP, AFS, WAP, etc. In an example where HTTP is used, the client device 125 can include an HTTP client commonly referred to as a “web browser” or simply a “browser” for sending and receiving HTTP signals to and from an HTTP server of the service provider 102. In some implementations, the compute resources 112 may include a network interface 108 between the service provider 102 and the network 108 having load sharing functionality, such as round-robin HTTP request distributors to balance loads and distribute incoming HTTP requests evenly over a number of servers. In some implementations, each of the servers can have access to the stored data; however, other alternative configurations may be used instead.
The metadata service 124 fetches the metadata of an organization to which the user belongs, uses the metadata to identify which data of the organization is eligible for rule creation and uses attributes of the metadata to determine a layout of the one or more UI selection elements (block 204). In one implementation, the metadata service fetches the metadata of the organization based on the login credentials of the user and/or user account information.
The one or more UI selection elements are rendered in one or more positions in the view according to the layout and at least a portion of the one or more UI selection elements are automatically populated with the data of the organization (block 206). The guided rules editor 122 is configured as a drag and drop application in which components of the user interface (UI) are arranged in desired positions within the view. The guided rules editor 122 allows the user to create rules 118 visually with pre-built UI elements such as forms, tables, lists, maps views, buttons, etc. on a display screen. Rules are created by the user selecting various combinations of expression set elements, where each element in a set from a logical step that runs sequentially.
Responsive to receiving user input of the one or more UI selection elements, one or more organization-specific rules to be executed by the rules engine are generated and saved to a data repository for subsequent rule compilation (e.g., database 120) (block 208). The guided rules editor 122 enables the user to incrementally create rules, and load and save existing rules.
Referring again to
Once the rule author has defined one or more rules, graphical representations of the rules is translated into a specific rule syntax required by the underlying rules engine 115. When the users ready to test/deploy the set of rules, the user clicks a “Compile” or “Deploy” button in the UI of the guided rules editor 122. Responsive to the user clicking on “compile” in the UI of the guided rules editor 122 and selects the set of rules, the compilation API 140 is invoked and emits a “compile rules event” that is received by the compile rules handler 140 (via line 148). The compile rules handler 142 then calls the metadata service 124 to perform syntactical validations on syntax in the rule, and logic-specific validations on certain rule statements based on the organization metadata 126 via line 151. After the metadata service 124 signals a successful validation, the compile rules handler 142 calls the rules translator 130 for rule translation (via line 152).
Rule translation is the process of translating the organization-specific rules defined in the document structure into general-purpose rules and validated syntax according to the rules language specification (e.g., DRL). To accomplish this, the rules translator 130 deserializes the JSON document (i.e., converts strings in the JSON into objects) and creates a model (line 154), such as Java-based abstract syntax tree (AST) or just syntax tree 132. The AST or syntax tree 132 is a tree representation of the abstract syntactic structure of text that will become the final rules language specification, where each node of the tree denotes an element of a rule to be generated from the text of the JSON document.
The rules translator 130 generates the rules language specification 156 required by the rules engine 115 by converting the AST 132. In some implementations, the rules translator 130 may use a template engine (not shown) to convert the AST into the rules language specification 156. At runtime, the template engine replaces variables in a template file with actual values, and transforms the template into the rules language specification 156. The rules language specification is then passed to a rule compiler 134.
Through the UI of the guided rules editor 122, the user can compile(/deploy) rules, and publish an event that triggers rule compilation. For example, responsive to the user clicking a “Compile” UI element in the guided rules editor 122, the guided rules editor 122 may send a message with a compile request through compilation API 140 to a compile rules handler 142 outside of the rules engine 115. The rule compiler 134 takes the rules language specification 156 as input and generates compiled rules, serializes the compiled rules into a serialized knowledgebase (kbase) 136, and writes the kbase 136 to the database 120 (line 158). In one implementation, the kbase 136 may be stored in a binary large object (BLOB) field of the organization 104 for execution at runtime.
On completion of compilation, an event is electronically sent to the user. For example, the UI may indicate whether a rule has been compiled and deployed for subsequent rule execution. Additionally or alternatively, the controller 116 or another component may generate and send an email notification to the user when compilation is complete.
Responsive to the user navigating of the guided rules editor (e.g., via a URL), the guided rules editor may automatically select a domain to which the rules pertain based on the credentials of the user, or receives a selection of a domain from a plurality of displayed domains by the user in the UI (block 302). For example, in the case where the user's organization includes multiple domains, the guided rules editor 122 may display a page with UI elements for each of the domains. The user may then click on one of the domains to create/edit rules for that domain.
Once in the page for the domain, the guided rules editor 122 receives a user selection to edit an existing rule or to create a new rule (block 304). The guided rules editor 122 determines whether the user selected a new rule for an existing rule based on UI input (block 306). Responsive to the user selecting a new rule, the guided rules editor 122 sends a request to the metadata service 124 to fetch only the organization metadata 126 eligible to be made into rules (block 308). The metadata service 124 may use a domain selector and data dictionary 128 to retrieve the organization metadata 126 relevant to the selected domain and return the organization metadata 126 to the guided rules editor 122.
More specifically, the metadata may be used to set a domain for specific languages (e.g., nouns and verbs) to be used for different business or application domains. Such business or application domains may be, for example, Product Validation/Selection (visibility)/Pricing, Transaction Management, Tax Treatment, Asset Management, Revenue Recognition, etc. Additionally or alternatively, the business or application domains may relate to a specific organization (e.g., requests that come from an IP address that shares a common suffix), a type of organization (e.g., private, corporate, government, military, non-profit, etc.). It will be understood that these examples are described here as a non-exhaustive list for the sake of discussion, and domains may relate to additional or alternative criteria in other implementations.
As noted, the defined nouns (e.g., names, objects, etc.) and verbs (e.g., actions) may be specific to a given business or application domain, and may be considered to be unrelated to the specific syntax or elements of the underlying language(s) or AST(s) used by the rules engine 115.
In one example, for the pricing domain, such nouns may be “quotes,” “carts,” “orders,” “discounts,” “promotions, “products,” etc. The associated verbs may include “apply discount,” “calculate line item totals,” “lookup starting unit price,” “apply promotion,” etc.
As another example, for the revenue recognition domain, such nouns may include “invoice,” “payment,” “general ledge,” “revenue,” “legal entity,” etc. The associated verbs may include “recognize revenue,” “defer revenue,” “accrue revenue,” etc.
Similarly to the descriptions of the business domains, the descriptions of such nouns and verbs are intended for the sake of discussion and non-limiting examples. In other implementations, the listed business domains may have more, fewer, or different nouns and/or verbs. Examples of the usage of such nouns and verbs are depicted and described below with respect to
As a result of such nouns and verbs, particularly when used in a guided rules editor such as guided rules editor 122, a business user or analyst that is untrained in writing rules in a programming language may still efficiently generate various business-related rules. This ability to generate one or more business-related rules may be beneficial because it may eliminate the need for a business analyst to communicate with a developer, which may result in quicker rule development, fewer errors due to human misunderstandings, or other benefits.
As one specific example, if the business analyst (or some other rule author) wishes to apply a discount, the underlying system may use an object such as PriceAdjustItem that needs to be created, populated with details of the discount, and then associated with a given cart/quote line item. However, using the domain-specific metadata above, the business analyst may be able to generate a rule (for example, through plaintext or through the use of the guided rules editor) such as “Apply a 10% discount to the current line item.” In this situation, verbs such as “apply” or “to” and a noun such as “10% discount” and “current line item” may be related to the business domain and used to generate such a rule.
Top-level metadata for the sales transaction object includes action overrides, child relationships, fields, names layout information, record type information, and the like. The action overrides describe a list of standard and non-standard actions (e.g., operations such as create, update, delete, clone, etc.) available on the object. The child relationships describe a list of objects that have a reference to the current object (either as a parent or a reference). The fields describe which pieces of data are stored within each record for this object (similar to database columns).
The guided rules editor 122 may display the UI selections elements that control the creation of the rule based on the metadata defined in the data dictionary 128. For example, assume the user selects a top-level object in the UI. The available list of child relationship entities to display for user selection is then limited to the ones defined in the metadata. Similarly, if the user adds a filter on a field value based on a particular object, the UI will only show fields that belong to that object. Furthermore, the type of that field is limited in the UI input as well (e.g. selecting a field of type Date will pop up a Datepicker in the UI, selecting a picklist field will pop up a dropdown list with valid picklist values, and the like).
Referring again to
The guided rules editor 122 then loads UI rule selection elements with the organization metadata 126 and the rule data if any (block 312). Loading the UI rule selection elements with the organization metadata and rule data that are eligible to be made into rules ensures that when the user actually creates/modifies rules, the user is unlikely to create a rule having validation mistakes. With this approach, the user is limited to how rules are created and what the rules contain. For example, the user can write a rule concerning the existence of an object or a field inside a transaction, but the guided rules editor 122 limits the choice of what objects and fields can be added to transaction rules.
Referring to
Referring again to
Each “There is a” phrase is followed by a “With” clause indicating conditions that must be met. Each “With” clause comprises i) a UI selection element 410B that enables to the use to select organization metadata attributes (e.g., Product ID); ii) a UI selection element 410C that enable the user to select mathematical operators (e.g., “equal”, “is not null”, and the like); and iii) an auto-populated data field 412 that is automatically filled with a value from the organization data (e.g., $P2ID) associated with the selected organization metadata attribute.
Notice that auto-populated data field 412 does not include a carat indicating selectable metadata, but instead is auto-populated with the variable name of data. In one implementation, attributes shown with leading and trailing special characters (e.g., “$”, “@”) may indicate rule template variables (e.g., $accountid) that are required when defining a variable within a rule template, where the value of the variable will be automatically retrieved and loaded into to the rule at runtime.
The “Then” condition section 404 of the example rule is performed when the When conditions 402a-402d are met. The “Then” condition section 404 includes one or more Modify consequences 404a, each of which includes a “Modify a” phrase, followed by a UI selection element 410D for selection of an organization metadata object, and a UI selection element 410E for selection of a variable name. Each “Modify a” phrase includes one or more “Set” clauses used to define a consequence. Each “Set” clause includes UI selection element 410F for selection of an object and an auto populated data field 412B containing a value to which the object will be set to. The guided rules editor may also support other actions, such as “Insert” and “Delete”, and domain specific actions such as “Apply Discount” and “Notify User”.
The column of X's along the side of the UI allows the user to assign value of a current row to a variable, and allows the reference of this variable elsewhere in the rule. For example, assume a current row matches against the ID of an Account object. Users can click the X to assign this row to a variable named $accId. Elsewhere in the rule, the user can use $accId to automatically obtain the Account ID.
The existing rules page 400B may also include UI elements for the user to Validate 413, Clone (copy) 414, Save 416, and Delete 418 the rule. Validate 413 causes the single rule displayed to be verified, Clone 414 causes the rule to be cloned or copied, Save 416 saves the rule, and Delete 418 deletes the rule.
Thus, the UI selection elements 410A-410F and auto populated data fields 412A and 412B are rendered in one or more positions in the view according to a layout, and at least a portion of the UI selection elements are populated with the metadata and data of the organization. In some implementations, some of the UI selection elements 410A-410C and auto populated data field 412A may be shown or not depending on what organization metadata 126 is returned and made available for inclusion into the rule. For example, while the number of the “There is a” phrases is controlled the user by adding conditions using UI selection element 406A, the number of “With” clauses may depend on the number of organization metadata attributes that are associated with the selected organization metadata object in the “There is a” phrase.
The guided rules editor 122 ensures the user creates valid rules without manually specifying or pre-configuring metadata files for ingestion by the rules system. For example, a user may write a rule concerning the existence of an object or a field inside a transaction, the user's choice of which objects and fields to choose is limited to what currently exists in their organizations based on their metadata, which is automatically loaded during rule creation. One advantage of the disclosed embodiments is the reduction of potential mistakes a user can make while writing rules, since the user is much more likely to write valid rules through limitations imposed on the data used for input.
Based on the user clicking “Validate” 413 or otherwise periodically, the guided rules editor sends a call to the metadata service to validate the rule via 514. The metadata service validates the rule data and the metadata against the organization metadata in the database 120 via 516. The validation operation validates both that the metadata contained within the rule definition is valid, and that the Rule itself is valid as well (variables are defined correctly; the structure of the rule makes sense, and the like.). The reason for the metadata validation in 516 is that, even though the UI only shows valid metadata options, users can potentially modify the contents of their rule using browser tools directly (e.g., using chrome dev tools). Thus, the validation in 516 is performed to prevent a malicious user from attempting to run something unexpected.
The metadata service also sends a call to the rules translator 130, triggering the rules translator to translate the organization specific rules to a general-purpose rule of the rules language specification 156 required by the rules engine 115 via 518. The rules translator 130 returns a validation result via 520, which is forwarded by the metadata service 124 to the guided rules editor 122 via 522.
Once the user clicks “Compile” 418, the guided rules editor sends a call to the metadata service to compile a selected set of rules via 524. The metadata service validates the rule data and the metadata against the organization metadata in the database via 526. The metadata service also sends a call to the compiler 134, triggering the rules compiler to translate the organization specific rules to a general-purpose rule of the rules language specification 156, validate, and compile the general-purpose rule into the kbase 528 via 518. There are two reasons for a second validation. The first is that the organization metadata 126 may have changed between when the user initially validates the rule and decides to compile the rule (there could be any amount of time between the two operations). The second is that this compilation step may occur across a batch of rules that are all deployed at once, and the validation is performed across all rules (which may be combined into a single, potentially large DRL file and that resulting file is validated). This is also the reason translation is performed a second time—to perform translation across the batch of rules instead of a single rule.
After translation, the compiler 134 sends a call to the metadata service to save the kbase 528 to the database 120 via 529. In another implementation, the compiler 134 may save the kbase 528 to the database 120 directly. The compiler 134 returns a compilation result (success/fail) via 530, which is forwarded by the metadata service 124 to the guided rules editor 122 via 532.
AST-Based Rule Conversion
As previously noted, a rule may be written in accordance with a first rule syntax. For example, a rule may be written using a guided rules editor such as that depicted with respect to
As previously described, the rules translator 130 may then generate an AST such as AST 610 based on the JSON rule 605. In some implementations, each rule that is to be included in a rule set in the rules language (e.g., DRL) may be represented as a separate JSON document. During translation of a rule, e.g., by the rules translator 130, a JSON rule such as rule 605 may be parsed to construct an intermediate JSON tree structure in memory (e.g., a memory of an electronic device of the service provider 102 such as a volatile or non-volatile memory).
The rules translator 130 may then traverse the intermediate JSON tree structure(s) and incrementally construct the AST such as AST 610. More specifically, nodes in the intermediate JSON tree structure may represent various elements of the rule being translated. As the rules translator 130 processes respective ones of the nodes, it may make a call to a specific helper function. The call may include one or more characteristics, elements, parameters, or properties of, or attached to, the node that the rules translator 130 is processing. The helper function may construct an AST tree fragment (which may also be referred to as a “subtree”) that represents or relates to that particular node. The rules translator 130 may then continue traversing the intermediate JSON tree, and thereby incrementally construct the AST 610.
Generally, the AST 610 may be similar to, and include one or more elements of, AST 132 as described herein and/or some other AST. As may be seen, respective nodes of the AST 610 may correspond to a construct that occurs in rule 605. Additionally, as may be seen in
A number of options or parameters of the rule may be indicated in the rule 605 at 657. Such parameters may be indicated at the RuleOptions node 625. Subsequently, the rule 605 may include a conditional “when” element at 660, which may include a variety of parameters. Such parameters may be indicated in the AST 610 at the WhenPart node 630. As may be seen, the WhenPart node 630 may include a plurality of subsequent nodes such as a ConditionalOr, ConditionalAnd, and ConditionalElement node at 635. The ConditionalElement node 635 may include data related to a plurality of parameters 665 in the “when” clause 660 of the rule 605.
As a corollary to the conditional “when” at 660, a “then” element may be present in the rule 605 at 670. The AST 610 ma include a corresponding ThenPart element 640. The “then” element 670 may include a plurality of different values or parameters at 675, which may be represented in the AST 610 at RhsStatement 645.
It will be noted that each node may have an indication off cardinality associated with it. For example, the RuleDefinition node 615 has an indication of “0,*.” The ThenPart node 640 may have an indication of “1.” The RuleOptions node 625 may have an indication of “0,1.” The ConditionalElement node 635 may have an indication of “1,*.” These different indications may represent cardinality. Specifically, “1, 0” may represent that the options are “0” or “1.” “1,*” may represent that the options for this field are “1” or “many.” Similarly, “0, *” may represent that the options for this field are “0” or “many.” As an example, RuleId (1) means that there has to be exactly one RuleId element in the AST 610. ConditionalElement (1,*) means that there has to be at least 1 conditional element, but there could be many more.
By traversing the AST 610, the rules translator 130 may be configured to generate a rule in a rule syntax different than that which was used to generate the AST 610. Specifically, once the rules translator 130 has generated the AST 610 (e.g., as described above), the rules translator 130 may traverse the AST 610 to generate a rules language specification rule (e.g., a DRL rule).
Respective nodes in the AST 610 may be associated with respective templates. As used herein, a “template” may refer to DRL generation templates. Specifically, the template may be a snippet of DRL text with “holes” or placeholders, where data from the corresponding AST node will appear. To generate the final rules language specification rule (e.g., the DRL rule), the AST is traversed with each node being visited, as described elsewhere herein. As each node in the AST is visited, the corresponding DRL generation template is loaded and populated with data from the current AST node. As the AST node is exited, the template, now populated with data from the current AST node, is rendered to a String and appended to the final DRL String being constructed. When the entire AST has been traversed, the DRL String is complete.
More generally, during generation of the rules language specification rule, the rules translator 130 may start at the root node 650. The rules translator 130 may then perform a depth-first traversal of the AST 615. As used herein, “depth-first traversal” may refer to a traversal method wherein the rules translator 130 starts at the root node 650 and traverses a given branch of the AST 610 until it reaches an end node (e.g., ConditionalElement node 635). The rules translator 130 may then start at the root node 650 and traverse a different branch or sub-branch of the AST 610 until it reaches an end node. The traversal process may iterate until all branches and sub-branches of the AST 610 have been traversed.
More specifically, the rules translator 130 may traverse respective nodes of a branch of AST 610. At each node, the template associated with that node type may be loaded into memory and populated with the data elements contained within or associated with the node. The template may then be rendered to a string that represents a fragment of the final rules language specification rule.
The rules translator 130 then moves to the next node on the branch and repeats the process of loading the template and rendering a further fragment of the final rules language specification file. The process may be repeated at respective branches of the AST 610 until all nodes have been addressed and the final rules language specification rule has been generated.
It will be understood that the rule 605 and AST 610 depicted in
The metadata service 124 may provide a rule (e.g., rule 605) in a first rule syntax at 705. The first rule syntax may be, for example, JSON or some other rule syntax. In some implementations, the first rule syntax may be a simplified rule syntax (e.g., as may be defined in accordance with the simplified rule syntax described herein) or some other rule syntax.
The rules translator 130 may then generate an AST at 710. The AST may be similar to, for example, AST 610. Specifically, the rules translator 130 may traverse the rule provided at 705 to generate an AST such as AST 610 based on constructs present in the provided rule, as described above.
Subsequently, the rules translator 130 may traverse the AST at 715 to generate a rule in a second rule syntax based on the AST. For example, the rules translator 130 may traverse the AST that was generated at 710 to generate a rule in a DRL syntax or some other syntax. The rules translator 130 may then provide the rule, in the second rule syntax (e.g., DRL), to the rule compiler 134 at 720. The rule compiler 134 may then compile, store, and/or execute the DRL rule as described elsewhere herein.
It will be understood that the examples of the specific syntaxes herein (e.g., JSON and DRL) are intended as example syntaxes, and other implementations may use or be based on some other syntax. For example, the rule may be provided to the rules translator 130 in a syntax that is different than JSON, and/or the rules translator 130 may output the rule in a syntax that is different than DRL.
The technique may include identifying, at 805, a first rule that is formatted in accordance with a first rule syntax. The first rule may be similar to, for example, the rule described at 605, and the first rule syntax may be, for example, JSON or some other rule syntax. Specifically, the first rule may relate to a process that is to be performed by a rules engine.
The technique may further include generating, based on the first rule, an AST. The AST may be similar to, for example, AST 610. The AST 610 may be generated by the rules translator 130 based on one or more constructs of the provided rule as described above with respect to
The technique may further include generating, at 815 based on the AST, a second rule that is formatted in accordance with a second rule syntax that is different than the first rule syntax. The second rule syntax may be, for example, DRL or some other rule syntax. Generally, the second rule may be similar to the rule described with respect to elements 715 and 720.
The technique may further include providing, at 820, the second rule to a rule compiler (e.g., rule compiler 134 of the rules engine 114. The rule compiler 134 may then execute the process related to the first rule, and execution of the process may be based at least in part on the second rule. In some implementations, the rule compiler may additionally or alternatively store the second rule in a database (e.g., DB 120). In other implementations, the rule compiler may additionally or alternatively perform some other action based on or related to the second rule as described elsewhere in this specification.
It will be noted that the process flow of
Examples of techniques related to the AST-based Rules Conversion may includes one or more of the following:
Example 1 may relate to a method to be performed by a rules translator, wherein the method comprises: identifying a first rule that is formatted in accordance with a first rule syntax; generating, based on the first rule, an abstract syntax tree (AST); generating, based on the AST, a second rule that is formatted in accordance with a second rule syntax that is different than the first rule syntax; and providing the second rule to a rule compiler.
Example 2 may relate to the method of example 1, and/or some other example herein, wherein the first rule syntax is JavaScript Object Notation (JSON).
Example 3 may relate to the method of any of examples 1-2, and/or some other example herein, wherein the second rule syntax is a rule language specification.
Example 4 may relate to the method of example 3, and/or some other example herein, wherein the rule language specification is Drools Rule Language (DRL).
Example 5 may relate to the method of any of examples 1-4, and/or some other example herein, wherein respective nodes of the AST correspond to a construct that occurs in the first rule.
Example 6 may relate to the method of any of examples 1-5, and/or some other example herein, wherein the first rule relates to a process that is to be executed by a rules engine, and wherein the rules compiler is to perform the process based at least in part on the second rule.
Example 7 may relate to the method of example 6, and/or some other example herein, wherein the process relates to an organization that provides the first rule.
Example 8 may relate to the method of example 6, and/or some other example herein, wherein the first rule syntax relates to a business domain of the process.
Example 9 may relate to the method of any of examples 1-8, and/or some other example herein, wherein the rule compiler is to store the second rule in a database that is communicatively coupled with the rule compiler.
Example 10 may relate to an apparatus or system configured to perform some or all of any of examples 1-9, and/or some other example herein.
Example 11 may relate to an apparatus or system comprising means to perform some or all of any of examples 1-9, and/or some other example herein.
Example 12 may relate to one or more non-transitory computer-readable media comprising instructions that, upon execution of the instructions by one or more processors of an electronic device or system, are to cause the electronic device or system to perform some or all of any of examples 1-9, and/or some other example herein.
Selective Rule Loading
It will be understood that, in many implementations, a rule may be written as a rule of a set of rules. For example, a set of rules may relate to a given business-related domain or context. As one example, a set of pricing rules may be written that may relate to application of a discount or a promotion for a given product or customer. As another example, a rule author may wish to apply a rule to all products that they sell. In some cases, a rule related to taxes applied to a given product may be different than rules related to a holiday-specific promotion. It will be understood that these examples are intended as examples for the sake of discussion, and other business-related domains or context may exist as described elsewhere herein, and such domains or context may include or relate to various groupings of rules. Such domains may include, for example, tax, pricing, validation, sales, marketing, etc. It will be understood that these are only examples, and various additional/alternative domains may exist for use with a given rule structure.
Embodiments herein relate to the use of tags or metadata for a given rule to group various rules into subsets of domain-specific rules. Specifically, as a rule author writes one or more rules, the author may be able to group the rules into subsets according to a variety of factors. Factors for such subsets may be factors such as a product, a given service, a business-related context (e.g., sales, marketing, taxation, etc.), a holiday or holiday season, a specific promotion, a customer or type of customer (e.g., whether the customer is a large business, a small business, a single individual, a government-related entity, etc.), a location of the customer, a seller or type of seller (e.g., whether the seller is a large business, a small business, a single individual, a government-related entity, etc.), a location of the seller, or some other factor. In this way, an author may be able to define subsets of rules that are specific to one or more contexts or domains through the use of one or more tags in a manner that the rules do not affect a different context or domain that is subject to a different tag.
Subsequently, when the rules are loaded by a rules engine such as rules engine 115 for execution in one or more processes at run-time, then only rules relevant to a specific grouping may be loaded. For example, if a process is related to sales, then a rule subset related to validation may not be loaded at run-time. Similarly, if a rule is related to a specific customer or product, then a subset of rules that are related to another customer or product may not be loaded at run-time. Therefore, embodiments herein may provide one or more advantages such as reduction of use of processor resources or quicker process implementation because significantly fewer rules need to be loaded by a rules engine such as rules engine 115.
One such domain may be, for example, quote rules at 910. Quote rules may be rules that relate to provision of a quote to a potential customer of the organization 905. For example, the organization 905 may be a provider of a good, and the rules 910 may relate to a quote that could be given to a potential customer for that good. As may be seen, the organization may have one or more additional or alternative rule sets may be or include billing rules 925 (e.g., rules that may relate to how bills are generated, delivered, and/or processed) and revenue recognition rules 930 (e.g., bills related to how revenue is tracked or monitored).
Various ones of the rules may have one or more sub-categories of rules. For example, the quote rules 910 may include pricing rules 915 (e.g., rules related to how a price may be identified or categorized) and configuration rules 920 (e.g., rules related to how the quote may be structured or what elements the quote may be required to have).
In some implementations, the various rules 915/920/925/930 may be organized according to a folder structure. Element 935 depicts a very simplified representation of the pricing rules 915 represented as a Rete network. Element 945 depicts a very simplified representation of the configuration rules 945 represented as a Rete network. Element 940 depicts an example of the pricing rules 915 and the configuration rules 920 represented as a Rete network. It will be understood that, in element Y140, one branch of the Rete network 940 from the initial node may lead to the pricing rules Rete network 935 while another branch of the AST 940 from the initial node may lead to the configuration rules Rete network 945.
As may be recognized, and as described above, not all rules may be necessary for a given process. For example, if the process is for an organization that is different than organization 905, then it may not be necessary to load any of the quote rules 910, the pricing rules 915, the configuration rules 920, the billing rules 925, or the revenue recognition rules 930. Similarly, if the process only relates to billing, then only the billing rules 925 may be loaded, and (for example) the quote rules 910 may not be loaded. Similarly, if the process only relates to pricing of a quote, then only pricing rules 915 may be loaded, and configuration rules 920 may not be loaded. As such, in some cases only a subset of the plurality of possible rules may be loaded for a given process.
It will be recognized that the depiction of
It will be understood that the rule structure 1000 may present a variety of advantages. For example, the rule structure 1000 may avoid rule duplication where multiple rule taxonomies apply. Specifically, as described below, folder and/or rule tags may be used. Without these tags, if a given rule definition resides in two different folders, then the rule may be required to be duplicated. Such duplication can cause maintenance issues. However, the tagging feature described herein may allow users to define a folder structure for the most common and/or reasonable single taxonomy, and then apply tags to both rules (via rule tags) and folders (via folder tags). As such, a user may be able to define a compilation unit that is composed of folders and/or tags such that the resulting Rete network is composed of rules defined within multiple folders. In essence, the folder/tag structure may allow the user the ability to create an unlimited number of rule combinations from a single folder taxonomy.
Generally, the rule structure 1000 may be understood to include or relate to a number of rule characteristics. Different ones of the rule characteristic may be associated with different aspects or elements of the rules as shown in
The rule structure 1000 may include a number of folders 1010. Respective folders 1010 may have a characteristic such as a “name.” The name of the folder 1010 may indicate a name of the rule subset to which the folder belongs. Example names may be, for example “Shoe Rules,” “Fourth of July Marketing,” “Organization,” “Quote Rules,” etc. It will be understood that, in some implementations, the name of a given folder 1010 may not be a human readable name but rather may be a hashtag, a numeric value, or some other type of designator. As may be seen, Folders 1010 may be nested within one another. Specifically, a folder 1010 may have zero or more sub-folders, while a sub-folder may only have a single parent folder.
A folder 1010 may be associated with a compilation unit 1005. Specifically, a compilation unit 1005 may contain or relate to one or more folders 1010, and a folder 1010 may be associated with zero compilation units 1005, one compilation unit 1005, or a plurality of compilation units 1005.
Compilation units 1005 may relate to a number of rules. More generally, a compilation unit 1005 may be thought of as a subset of a plurality of possible rules. Similar to a folder 1010, a compilation unit 1005 may be a rule characteristic that may have a variety of additional rule characteristics such as a name. The name of a compilation unit 1005 may be similar to a name of a folder 1010. For example, a compilation unit 1010 may have a name such as “shoe rules,” “independence day rules,” “quote rules,” “pricing units,” “tax rules,” etc. Similarly to folders 1010, in some implementations the name of a compilation unit 1005 may not be human readable, but rather may be a numeric value, a hash, or some other type of designator.
Additionally, in some embodiments, a compilation rule 1005 may include a designator such as “IsActive.” “IsActive” may indicate whether a compilation unit 1005 (and its associated rules) is intended to be executed by a rules engine 115 at runtime. Specifically, “IsActive” may be a binary designator such that it is “true”/“false,” “1”/“0,”, etc.
Different folders 1010 may be associated with a folder tag 1015, which may in turn be associated with a tag definition 1020. As may be seen, a folder tag 1015 may only be associated with a single tag definition 1020, while a tag definition 1020 may be associated with zero folder tags 1015, one folder tag 1015, or a plurality of folder tags 1015. Similarly, a folder tag 1015 may be associated with a single folder 1010, and a folder 1010 may be associated with zero folder tags 1015, one folder tag 1015, or a plurality of folder tags 1015. As may be seen, a folder tag 1015 may have or be associated with a value. The value for a folder tag 1015 may indicate the value that the tag represents. For example, if the folder tag 1015 (or, rule tag 1030 as described in greater detail below) relates to a region, then the value for the folder tag or rule tag could be “United States,” “North America,” etc. If the folder or rule tag is “Support Level,” then the value could be a number between 1-5 to indicate the priority of support for the related account. It will be understood that these values or relationships are intended as examples of an implementation for the purpose of discussion, and other implementations may include additional/alternative values or relationships.
A tag definition 1020 may include some form of name or identifier which can be alphanumeric, a hash, etc. An example name could be, for example, “region,” which may indicate a region to which the tag definition 1020 is associated, “approval required,” which may indicate how a tag may be processed, or some other type of identifier. Respective tag definitions 1020 may also include or be associated with a datatype element which may indicate how the value of the tag definition is input, for example as a string, a boolean input, a numeric input, etc. A tag definition 1020 may further include a default value field, which may include data in the form associated with the datatype field. For example, if the default value field may be a string of characters, a number, a true/false designation, etc. Generally, the tag definitions 1020 may be or relate to a custom tag that can be applied to rules and/or folders to apply additional characteristics or attributes to individual rules or folders of rules.
Different ones of the folders 1010 may be associated with different rules 1025. Specifically, a folder 1010 may be associated with zero rules 1025, one rule 1025, or a plurality of rules 1025. A rule 1025 may be associated with one folder 1010 or a plurality of folders 1010.
Respective rules 1025 may have a plurality of fields such as a name, a domain, a start date, an end date, a version, and a priority level. The name may be a human-readable name of the rule for the sake of identification, while in other implementations the name may be numeric, a hash, etc. The domain may indicate the domain to which the rule belongs (e.g., promotion, pricing, marketing, sales, validation, tax, or some other domain). The start date and end date may indicate when a rule is considered active or inactive. Version may indicate the version of the rules, such that tracking updates to the rule is possible. Priority may indicate a priority level of the rule such that execution of some rules may be prioritized over other rules.
Different rules 1025 and/or tag definitions 1020 may be associated with a rule tag 1030. A rule tag 1030 may be considered to be a tag definition applied to a given rule 1030. As may be seen in
It will be recognized that there may be different ways to implement rule structure 1000. Specifically, in some implementations, the rule structure 1000 may be implemented in accordance with one or more AST(s) in the form of a Rete network. Specifically, the folder structure depicted in 1000 provides one example technique for organizing rules in order to generate one or more compilation units, or Rete networks. Generally, the structures depicted at 935, 940, and 945 are separate, independently deployable Rete networks.
In other implementations, the rule structure 1000 may be implemented using file names, folder names, and metadata. For example, different elements such as compilation unit 1005, elements of a rule 1025 such as the domain, start date, end date, etc., or other elements of the rule structure 1000 may be implemented as metadata that is appended to an element such as a folder name or rule name.
The tables below depict examples of how different ones of the elements of
Table 2 depicts an example of different rules, which may generally be seen as examples of the rules 1025 element of
Table 3 depicts an example of how rule(s) (e.g., rules 1025 as depicted in Table 2) may be associated with folder(s) (e.g., folders 1010 as depicted in Table 1). It will be noted that Table 3 may be implemented as, or stored in, metadata of one or more of the rule(s) or folder(s). It will also be noted that, as depicted in Table 3, both of the rules R1 and R2 depicted in Table 2 may be associated with the ShoeCo 1 Rules and the ShoeCo 2 Rules. It will further be noted that the Fourth of July Marketing folder, folder F4 of Table 1, is only associated with rule R2 of Table 2.
Table 4 depicts an example of compilation units, which may be similar to compilation unit 1005 of
Table 5 depicts an example correlation between the compilation units of Table 4 and the folders of Table 1. It will be noted that the compilation unit CUL named “Shoe Rules” is associated with the folder F1 of Table 1 named “Shoe Rules.” Similarly, the compilation unit CU2, named “Independence Day Rules” is associated with the folder F4 of Table 1 named “Fourth of July Marketing.”
Table 6 depicts an example of tag definitions such as tag definitions 1020. As may be seen, the tag definitions may be of different types, (e.g., string, boolean, etc.), and the resultant values may take a different form (e.g., a string and a true/false identifier).
Table 7 depicts an example of how a folder tag (e.g., a folder tag 1015), a folder (e.g., a folder 1010 as defined in Table 1), and a tag definition (e.g., a tag definition 1020 as defined in Table 6) may be associated with one another. As may be seen in Table 7, both the folder F1 (e.g., “Shoe Rules”) and the folder F4 (e.g., “Fourth of July Marketing”) may be associated with tag definition TD2, which may indicate that approval of a rule is not required. In other words, a process that implements the rule may run without explicit approval by a system administrator.
Table 8 depicts an example of how a rule (e.g., one of rules 1025 as defined in table 2) may be associated with a rule tag (e.g., rule tag 1030) and a tag definition (e.g., tag definition 1020 as defined in table 6). As may be seen, both rules R1 and R2 may be associated with tag definition TD1, related to a region. As such, the tag definition may define a region in which the rule may be active.
It will be understood that the above-depicted Example shown with respect to Tables 1-8 is intended as one example of how rules and folders may be associated using metadata. Other implementations may have more or fewer elements, elements with different names and/or values (or types of values), etc.
In some embodiments, the API 1105 may not be necessary, and instead the rules engine 115 may function as or include the functionalities of the API described herein. Generally, the API 1105 may be used in situations where the rules engine 115 is a standard “off-the-shelf” rules engine 115 without functionality-specific modification. Rather, the modification may be provided through the use of the API 1105
In the process, an organization 104 (and/or a user of the organization) may transmit a request related to execution of a process at 1110. The request may be received at the API 1105 or, in some implementations, the request may additionally/alternatively be received at the rules engine 115. In some implementations, the request may be transmitted to the rules engine 115, which may then forward the request to the appropriate API 1105 (e.g., by analyzing the request, identifying the relevant domain, and then forwarding the request to an API 1105 associated with that domain). In other implementations, the request may be transmitted directly to the API 1105 in addition to or instead of the rules engine 115.
The API 1105 may retrieve rules from the database 120 at 1115. Specifically, the API 1105 may retrieve all rules from the database 120 that have been previously generated and/or stored in the database. The API 1105 may then, at 1120, identify a subset of the retrieved rules. Such a subset may be identified based on the request received at 1110, and may be identified based on a number of criteria, which are referred to herein as characteristics of the process request. Generally, identification of the subset of rules may be based on correlation of one or more characteristics of the process request with one or more rule characteristics.
For example, if the request indicates a specific compilation unit, then all rules associated with that compilation unit may be identified. If the request is from an identified organization, or department of such an organization, then all rules associated with that organization or department may be identified by the API 1105. If the request relates to a process that is to be performed at a given time, or in a given location, then all rules associated with that time period or that location may be identified. In some implementations, the API 1105 may only identify rules that are marked as being “active.” It will be understood that these examples are intended as only some examples, and other implementations may have one or more additional or alternative criteria by which to identify the subset of rules.
It will be understood that the above-described implementation where all rules are retrieved by the API 1105 and then subsequently culled to identify a subset of rules at 1120 is intended as one example of such an implementation. In other implementations, the API 1105 may compare one or more rule characteristics of rule stored in DB 120 with a characteristic of the process request, and only retrieve matching rules from the DB 120. In other words, elements 1120 and 1115 may be combined in other implementations. Such an implementation may be desirable where bandwidth between the API 1105 and the DB 120 is limited. Other variations may be present in other implementations.
Once the subset of rules has been identified at 1120, then the subset of rules 1125 (or indications thereof) may be provided to the rules engine at 114 at 1125. The rules engine 115 may then execute the process 1130 based on the subset of rules at 1130. Note that, in some implementations, the rules themselves may be provided to the rules engine 115 while, in other implementations, identifiers of the rules (e.g., a hash that identifies the rule or some other indicator) may be provided to the rules engine 115, and the rules engine 115 may pull the corresponding rule from the DB 120.
The process may include identifying, at 1205 by an API such as API 1105 that is communicatively coupled with a rules engine such as rules engine 115, a plurality of rules. The plurality of rules may be stored, for example in a database such as DB 120. Respective rules of the plurality of rules may be associated with at least one rule characteristic of a plurality of rule characteristics. The different rule characteristics may be the rule characteristics depicted and described with respect to, for example,
The process may further include identifying, at 1210 by the API, one or more characteristics of a process request received from a customer. The process request may be, for example, the process request described with respect to element 1110. The characteristics of the process request may include, for example, a characteristic of the customer (e.g., the entity type of the customer such as whether the customer is a government entity, a business, a single individual, etc.), a geographic location related to the process, a time period related to the process, a business domain of the process, or some other characteristic as described above. As described, the process request may relate to a process that is to be executed based on one or more rules of the plurality of rules identified at 1205.
The process may further include identifying, at 1215 by the API based on correlation of the one or more characteristics of the process request with the plurality of rule characteristics, a subset of the plurality of rules. The subset of rules may be similar to those described above with respect to element 1120. It will be noted that the subset of rules may include less than all of the plurality of rules identified at 1205.
The process may further include providing, by the API at 1220, one or more indications of rules in the subset of the plurality of rules to the rules engine. Such provision may be similar to that described above with respect to element 1125.
The process may further include executing, at 1225 by the rules engine, the process based on the subset of the plurality of rules. Such execution may be similar to that described above with respect to element 1130.
Example techniques related to the selective rule loading may include one or more of the following:
Example 1 may include a method comprising: identifying, by an application programming interface (API) that is communicatively coupled with a rules engine, a plurality of rules, wherein respective rules of the plurality of rules are associated with at least one rule characteristic of a plurality of rule characteristics; identifying, by the API, one or more characteristics of a process request received from a customer, wherein the process request relates to a process that is to be executed based on one or more rules of the plurality of rules; identifying, by the API based on correlation of the one or more characteristics of the process request with the plurality of rule characteristics, a subset of the plurality of rules, wherein the subset is less than the plurality of rules; providing, by the API, one or more indications of rules in the subset of the plurality of rules to the rules engine; and executing, by the rules engine, the process based on the subset of the plurality of rules.
Example 2 may include the method of example 1, and/or some other example herein, wherein the request relates to a process that is to be executed by the rules engine based on the subset of the plurality of rules.
Example 3 may include the method of any of examples 1-2, and/or some other example herein, wherein respective rule characteristics of the plurality of rule characteristics are implemented as metadata of a folder in which the rule is placed.
Example 4 may include the method of any of examples 1-3, and/or some other example herein, wherein a characteristic of the process request is related to an entity type of the customer.
Example 5 may include the method of any of examples 1-4, and/or some other example herein, wherein the characteristic of the process request is related to a geographic location associated with the process.
Example 6 may include the method of any of examples 1-5, and/or some other example herein, wherein the characteristic of the process request is related to a time period in which the process is to be executed.
Example 7 may include the method of any of examples 1-6, and/or some other example herein, wherein the characteristic of the process request is related to a business domain associated with the process.
Example 8 may relate to an apparatus or system configured to perform some or all of any of examples 1-7, and/or some other example herein.
Example 9 may relate to an apparatus or system comprising means to perform some or all of any of examples 1-7, and/or some other example herein.
Example 10 may relate to one or more non-transitory computer-readable media comprising instructions that, upon execution of the instructions by one or more processors of an electronic device or system, are to cause the electronic device or system to perform some or all of any of examples 1-7, and/or some other example herein.
Example Electronic Devices and Environments
Electronic Device and Machine-Readable Media
One or more parts of the above implementations may include software. Software is a general term whose meaning can range from part of the code and/or metadata of a single computer program to the entirety of multiple programs. A computer program (also referred to as a program) comprises code and optionally data. Code (sometimes referred to as computer program code or program code) comprises software instructions (also referred to as instructions). Instructions may be executed by hardware to perform operations. Executing software includes executing code, which includes executing instructions. The execution of a program to perform a task involves executing some or all of the instructions in that program.
An electronic device (also referred to as a device, computing device, computer, etc.) includes hardware and software. For example, an electronic device may include a set of one or more processors coupled to one or more machine-readable storage media (e.g., non-volatile memory such as magnetic disks, optical disks, read only memory (ROM), Flash memory, phase change memory, solid state drives (SSDs)) to store code and optionally data. For instance, an electronic device may include non-volatile memory (with slower read/write times) and volatile memory (e.g., dynamic random-access memory (DRAM), static random-access memory (SRAM)). Non-volatile memory persists code/data even when the electronic device is turned off or when power is otherwise removed, and the electronic device copies that part of the code that is to be executed by the set of processors of that electronic device from the non-volatile memory into the volatile memory of that electronic device during operation because volatile memory typically has faster read/write times. As another example, an electronic device may include a non-volatile memory (e.g., phase change memory) that persists code/data when the electronic device has power removed, and that has sufficiently fast read/write times such that, rather than copying the part of the code to be executed into volatile memory, the code/data may be provided directly to the set of processors (e.g., loaded into a cache of the set of processors). In other words, this non-volatile memory operates as both long term storage and main memory, and thus the electronic device may have no or only a small amount of volatile memory for main memory.
In addition to storing code and/or data on machine-readable storage media, typical electronic devices can transmit and/or receive code and/or data over one or more machine-readable transmission media (also called a carrier) (e.g., electrical, optical, radio, acoustical or other forms of propagated signals—such as carrier waves, and/or infrared signals). For instance, typical electronic devices also include a set of one or more physical network interface(s) to establish network connections (to transmit and/or receive code and/or data using propagated signals) with other electronic devices. Thus, an electronic device may store and transmit (internally and/or with other electronic devices over a network) code and/or data with one or more machine-readable media (also referred to as computer-readable media).
Software instructions (also referred to as instructions) are capable of causing (also referred to as operable to cause and configurable to cause) a set of processors to perform operations when the instructions are executed by the set of processors. The phrase “capable of causing” (and synonyms mentioned above) includes various scenarios (or combinations thereof), such as instructions that are always executed versus instructions that may be executed. For example, instructions may be executed: 1) only in certain situations when the larger program is executed (e.g., a condition is fulfilled in the larger program; an event occurs such as a software or hardware interrupt, user input (e.g., a keystroke, a mouse-click, a voice command); a message is published, etc.); or 2) when the instructions are called by another program or part thereof (whether or not executed in the same or a different process, thread, lightweight thread, etc.). These scenarios may or may not require that a larger program, of which the instructions are a part, be currently configured to use those instructions (e.g., may or may not require that a user enables a feature, the feature or instructions be unlocked or enabled, the larger program is configured using data and the program's inherent functionality, etc.). As shown by these exemplary scenarios, “capable of causing” (and synonyms mentioned above) does not require “causing” but the mere capability to cause. While the term “instructions” may be used to refer to the instructions that when executed cause the performance of the operations described herein, the term may or may not also refer to other instructions that a program may include. Thus, instructions, code, program, and software are capable of causing operations when executed, whether the operations are always performed or sometimes performed (e.g., in the scenarios described previously). The phrase “the instructions when executed” refers to at least the instructions that when executed cause the performance of the operations described herein but may or may not refer to the execution of the other instructions.
Electronic devices are designed for and/or used for a variety of purposes, and different terms may reflect those purposes (e.g., user devices, network devices). Some user devices are designed to mainly be operated as servers (sometimes referred to as server devices), while others are designed to mainly be operated as clients (sometimes referred to as client devices, client computing devices, client computers, or end user devices; examples of which include desktops, workstations, laptops, personal digital assistants, smartphones, wearables, augmented reality (AR) devices, virtual reality (VR) devices, mixed reality (MR) devices, etc.). The software executed to operate a user device (typically a server device) as a server may be referred to as server software or server code), while the software executed to operate a user device (typically a client device) as a client may be referred to as client software or client code. A server provides one or more services (also referred to as serves) to one or more clients.
The term “user” refers to an entity (e.g., an individual person) that uses an electronic device. Software and/or services may use credentials to distinguish different accounts associated with the same and/or different users. Users can have one or more roles, such as administrator, programmer/developer, and end user roles. As an administrator, a user typically uses electronic devices to administer them for other users, and thus an administrator often works directly and/or indirectly with server devices and client devices.
During operation, an instance of the software 1328 (illustrated as instance 1306 and referred to as a software instance; and in the more specific case of an application, as an application instance) is executed. In electronic devices that use compute virtualization, the set of one or more processor(s) 1322 typically execute software to instantiate a virtualization layer 1308 and one or more software container(s) 1304A-1304R (e.g., with operating system-level virtualization, the virtualization layer 1308 may represent a container engine (such as Docker Engine by Docker, Inc. or rkt in Container Linux by Red Hat, Inc.) running on top of (or integrated into) an operating system, and it allows for the creation of multiple software containers 1304A-1304R (representing separate user space instances and also called virtualization engines, virtual private servers, or jails) that may each be used to execute a set of one or more applications; with full virtualization, the virtualization layer 1308 represents a hypervisor (sometimes referred to as a virtual machine monitor (VMM)) or a hypervisor executing on top of a host operating system, and the software containers 1304A-1304R each represent a tightly isolated form of a software container called a virtual machine that is run by the hypervisor and may include a guest operating system; with para-virtualization, an operating system and/or application running with a virtual machine may be aware of the presence of virtualization for optimization purposes). Again, in electronic devices where compute virtualization is used, during operation, an instance of the software 1328 is executed within the software container 1304A on the virtualization layer 1308. In electronic devices where compute virtualization is not used, the instance 1306 on top of a host operating system is executed on the “bare metal” electronic device 1300. The instantiation of the instance 1306, as well as the virtualization layer 1308 and software containers 1304A-1304R if implemented, are collectively referred to as software instance(s) 1302.
Alternative implementations of an electronic device may have numerous variations from that described above. For example, customized hardware and/or accelerators might also be used in an electronic device.
Example Environment
The system 1340 is coupled to user devices 1380A-1380S over a network 1382. The service(s) 1342 may be on-demand services that are made available to one or more of the users 1384A-1384S working for one or more entities other than the entity which owns and/or operates the on-demand services (those users sometimes referred to as outside users) so that those entities need not be concerned with building and/or maintaining a system, but instead may make use of the service(s) 1342 when needed (e.g., when needed by the users 1384A-1384S). The service(s) 1342 may communicate with each other and/or with one or more of the user devices 1380A-1380S via one or more APIs (e.g., a REST API). In some implementations, the user devices 1380A-1380S are operated by users 1384A-1384S, and each may be operated as a client device and/or a server device. In some implementations, one or more of the user devices 1380A-1380S are separate ones of the electronic device 1300 or include one or more features of the electronic device 1300.
In some implementations, the system 1340 is a multi-tenant system (also known as a multi-tenant architecture). The term multi-tenant system refers to a system in which various elements of hardware and/or software of the system may be shared by one or more tenants. A multi-tenant system may be operated by a first entity (sometimes referred to a multi-tenant system provider, operator, or vendor; or simply a provider, operator, or vendor) that provides one or more services to the tenants (in which case the tenants are customers of the operator and sometimes referred to as operator customers). A tenant includes a group of users who share a common access with specific privileges. The tenants may be different entities (e.g., different companies, different departments/divisions of a company, and/or other types of entities), and some or all of these entities may be vendors that sell or otherwise provide products and/or services to their customers (sometimes referred to as tenant customers). A multi-tenant system may allow each tenant to input tenant specific data for user management, tenant-specific functionality, configuration, customizations, non-functional properties, associated applications, etc. A tenant may have one or more roles relative to a system and/or service. For example, in the context of a customer relationship management (CRM) system or service, a tenant may be a vendor using the CRM system or service to manage information the tenant has regarding one or more customers of the vendor. As another example, in the context of Data as a Service (DAAS), one set of tenants may be vendors providing data and another set of tenants may be customers of different ones or all of the vendors' data. As another example, in the context of Platform as a Service (PAAS), one set of tenants may be third-party application developers providing applications/services and another set of tenants may be customers of different ones or all of the third-party application developers.
Multi-tenancy can be implemented in different ways. In some implementations, a multi-tenant architecture may include a single software instance (e.g., a single database instance) which is shared by multiple tenants; other implementations may include a single software instance (e.g., database instance) per tenant; yet other implementations may include a mixed model; e.g., a single software instance (e.g., an application instance) per tenant and another software instance (e.g., database instance) shared by multiple tenants.
In one implementation, the system 1340 is a multi-tenant cloud computing architecture supporting multiple services, such as one or more of the following types of services: Self-Healing Build Pipeline service 1342; Customer relationship management (CRM); Configure, price, quote (CPQ); Business process modeling (BPM); Customer support; Marketing; External data connectivity; Productivity; Database-as-a-Service; Data-as-a-Service (DAAS or DaaS); Platform-as-a-service (PAAS or PaaS); Infrastructure-as-a-Service (IAAS or IaaS) (e.g., virtual machines, servers, and/or storage); Analytics; Community; Internet-of-Things (IoT); Industry-specific; Artificial intelligence (AI); Application marketplace (“app store”); Data modeling; Security; and Identity and access management (IAM). For example, system 1340 may include an application platform 1344 that enables PAAS for creating, managing, and executing one or more applications developed by the provider of the application platform 1344, users accessing the system 1340 via one or more of user devices 1380A-1380S, or third-party application developers accessing the system 1340 via one or more of user devices 1380A-1380S.
In some implementations, one or more of the service(s) 1342 may use one or more multi-tenant databases 1346, as well as system data storage 1350 for system data 1352 accessible to system 1340. In certain implementations, the system 1340 includes a set of one or more servers that are running on server electronic devices and that are configured to handle requests for any authorized user associated with any tenant (there is no server affinity for a user and/or tenant to a specific server). The user devices 1380A-1380S communicate with the server(s) of system 1340 to request and update tenant-level data and system-level data hosted by system 1340, and in response the system 1340 (e.g., one or more servers in system 1340) automatically may generate one or more Structured Query Language (SQL) statements (e.g., one or more SQL queries) that are designed to access the desired information from the multi-tenant database(s) 1346 and/or system data storage 1350.
In some implementations, the service(s) 1342 are implemented using virtual applications dynamically created at run time responsive to queries from the user devices 1380A-1380S and in accordance with metadata, including: 1) metadata that describes constructs (e.g., forms, reports, workflows, user access privileges, business logic) that are common to multiple tenants; and/or 2) metadata that is tenant specific and describes tenant specific constructs (e.g., tables, reports, dashboards, interfaces, etc.) and is stored in a multi-tenant database. To that end, the program code 1360 may be a runtime engine that materializes application data from the metadata; that is, there is a clear separation of the compiled runtime engine (also known as the system kernel), tenant data, and the metadata, which makes it possible to independently update the system kernel and tenant-specific applications and schemas, with virtually no risk of one affecting the others. Further, in one implementation, the application platform 1344 includes an application setup mechanism that supports application developers' creation and management of applications, which may be saved as metadata by save routines. Invocations to such applications, including the network protocol for the metadata-driven rules editor, may be coded using Procedural Language/Structured Object Query Language (PL/SOQL) that provides a programming language style interface. Invocations to applications may be detected by one or more system processes, which manages retrieving application metadata for the tenant making the invocation and executing the metadata as an application in a software container (e.g., a virtual machine).
Network 1382 may be any one or any combination of a LAN (local area network), WAN (wide area network), telephone network, wireless network, point-to-point network, star network, token ring network, hub network, or other appropriate configuration. The network may comply with one or more network protocols, including an Institute of Electrical and Electronics Engineers (IEEE) protocol, a 3rd Generation Partnership Project (3GPP) protocol, a 4th generation wireless protocol (4G) (e.g., the Long Term Evolution (LTE) standard, LTE Advanced, LTE Advanced Pro), a fifth generation wireless protocol (5G), and/or similar wired and/or wireless protocols, and may include one or more intermediary devices for routing data between the system 1340 and the user devices 1380A-1380S.
Each user device 1380A-1380S (such as a desktop personal computer, workstation, laptop, Personal Digital Assistant (PDA), smartphone, smartwatch, wearable device, augmented reality (AR) device, virtual reality (VR) device, etc.) typically includes one or more user interface devices, such as a keyboard, a mouse, a trackball, a touch pad, a touch screen, a pen or the like, video or touch free user interfaces, for interacting with a graphical user interface (GUI) provided on a display (e.g., a monitor screen, a liquid crystal display (LCD), a head-up display, a head-mounted display, etc.) in conjunction with pages, forms, applications and other information provided by system 1340. For example, the user interface device can be used to access data and applications hosted by system 1340, and to perform searches on stored data, and otherwise allow one or more of users 1384A-1384S to interact with various GUI pages that may be presented to the one or more of users 1384A-1384S. User devices 1380A-1380S might communicate with system 1340 using TCP/IP (Transfer Control Protocol and Internet Protocol) and, at a higher network level, use other networking protocols to communicate, such as Hypertext Transfer Protocol (HTTP), File Transfer Protocol (FTP), Andrew File System (AFS), Wireless Application Protocol (WAP), Network File System (NFS), an application program interface (API) based upon protocols such as Simple Object Access Protocol (SOAP), Representational State Transfer (REST), etc. In an example where HTTP is used, one or more user devices 1380A-1380S might include an HTTP client, commonly referred to as a “browser,” for sending and receiving HTTP messages to and from server(s) of system 1340, thus allowing users 1384A-1384S of the user devices 1380A-1380S to access, process and view information, pages and applications available to it from system 1340 over network 1382.
In the above description, numerous specific details such as resource partitioning/sharing/duplication implementations, types and interrelationships of system components, and logic partitioning/integration choices are set forth in order to provide a more thorough understanding. The invention may be practiced without such specific details, however. In other instances, control structures, logic implementations, opcodes, means to specify operands, and full software instruction sequences have not been shown in detail since those of ordinary skill in the art, with the included descriptions, will be able to implement what is described without undue experimentation.
References in the specification to “one implementation,” “an implementation,” “an example implementation,” etc., indicate that the implementation described may include a particular feature, structure, or characteristic, but every implementation may not necessarily include the particular feature, structure, or characteristic. Moreover, such phrases are not necessarily referring to the same implementation. Further, when a particular feature, structure, and/or characteristic is described in connection with an implementation, one skilled in the art would know to affect such feature, structure, and/or characteristic in connection with other implementations whether or not explicitly described.
For example, the figure(s) illustrating flow diagrams sometimes refer to the figure(s) illustrating block diagrams, and vice versa. Whether or not explicitly described, the alternative implementations discussed with reference to the figure(s) illustrating block diagrams also apply to the implementations discussed with reference to the figure(s) illustrating flow diagrams, and vice versa. At the same time, the scope of this description includes implementations, other than those discussed with reference to the block diagrams, for performing the flow diagrams, and vice versa.
Bracketed text and blocks with dashed borders (e.g., large dashes, small dashes, dot-dash, and dots) may be used herein to illustrate optional operations and/or structures that add additional features to some implementations. However, such notation should not be taken to mean that these are the only options or optional operations, and/or that blocks with solid borders are not optional in certain implementations.
The detailed description and claims may use the term “coupled,” along with its derivatives. “Coupled” is used to indicate that two or more elements, which may or may not be in direct physical or electrical contact with each other, co-operate or interact with each other.
While the flow diagrams in the figures show a particular order of operations performed by certain implementations, such order is exemplary and not limiting (e.g., alternative implementations may perform the operations in a different order, combine certain operations, perform certain operations in parallel, overlap performance of certain operations such that they are partially in parallel, etc.).
While the above description includes several example implementations, the invention is not limited to the implementations described and can be practiced with modification and alteration within the spirit and scope of the appended claims. The description is thus illustrative instead of limiting.
The present application is a continuation application of U.S. patent application Ser. No. 17/993,751, filed Nov. 23, 2022, which is herein incorporated by reference in its entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5577188 | Zhu | Nov 1996 | A |
| 5608872 | Schwartz et al. | Mar 1997 | A |
| 5649104 | Carleton et al. | Jul 1997 | A |
| 5715450 | Ambrose et al. | Feb 1998 | A |
| 5761419 | Schwartz et al. | Jun 1998 | A |
| 5819038 | Carleton et al. | Oct 1998 | A |
| 5821937 | Tonelli et al. | Oct 1998 | A |
| 5831610 | Tonelli et al. | Nov 1998 | A |
| 5873096 | Lim et al. | Feb 1999 | A |
| 5918159 | Fomukong et al. | Jun 1999 | A |
| 5963953 | Cram et al. | Oct 1999 | A |
| 5983227 | Nazem et al. | Nov 1999 | A |
| 6092083 | Brodersen et al. | Jul 2000 | A |
| 6161149 | Achacoso et al. | Dec 2000 | A |
| 6169534 | Raffel et al. | Jan 2001 | B1 |
| 6178425 | Brodersen et al. | Jan 2001 | B1 |
| 6189011 | Lim et al. | Feb 2001 | B1 |
| 6216133 | Masthoff | Apr 2001 | B1 |
| 6216135 | Brodersen et al. | Apr 2001 | B1 |
| 6233617 | Rothwein et al. | May 2001 | B1 |
| 6236978 | Tuzhilin | May 2001 | B1 |
| 6266669 | Brodersen et al. | Jul 2001 | B1 |
| 6288717 | Dunkle | Sep 2001 | B1 |
| 6295530 | Ritchie et al. | Sep 2001 | B1 |
| 6324568 | Diec et al. | Nov 2001 | B1 |
| 6324693 | Brodersen et al. | Nov 2001 | B1 |
| 6336137 | Lee et al. | Jan 2002 | B1 |
| D454139 | Feldcamp et al. | Mar 2002 | S |
| 6367077 | Brodersen et al. | Apr 2002 | B1 |
| 6393605 | Loomans | May 2002 | B1 |
| 6405220 | Brodersen et al. | Jun 2002 | B1 |
| 6411949 | Schaffer | Jun 2002 | B1 |
| 6434550 | Warner et al. | Aug 2002 | B1 |
| 6446089 | Brodersen et al. | Sep 2002 | B1 |
| 6535909 | Rust | Mar 2003 | B1 |
| 6549908 | Loomans | Apr 2003 | B1 |
| 6553563 | Ambrose et al. | Apr 2003 | B2 |
| 6560461 | Fomukong et al. | May 2003 | B1 |
| 6574635 | Stauber et al. | Jun 2003 | B2 |
| 6577726 | Huang et al. | Jun 2003 | B1 |
| 6601087 | Zhu et al. | Jul 2003 | B1 |
| 6604117 | Lim et al. | Aug 2003 | B2 |
| 6604128 | Diec et al. | Aug 2003 | B2 |
| 6609150 | Lee et al. | Aug 2003 | B2 |
| 6621834 | Scherpbier et al. | Sep 2003 | B1 |
| 6654032 | Zhu et al. | Nov 2003 | B1 |
| 6665648 | Brodersen et al. | Dec 2003 | B2 |
| 6665655 | Warner et al. | Dec 2003 | B1 |
| 6684438 | Brodersen et al. | Feb 2004 | B2 |
| 6711565 | Subramaniam et al. | Mar 2004 | B1 |
| 6724399 | Katchour et al. | Apr 2004 | B1 |
| 6728702 | Subramaniam et al. | Apr 2004 | B1 |
| 6728960 | Loomans et al. | Apr 2004 | B1 |
| 6732095 | Warshavsky et al. | May 2004 | B1 |
| 6732100 | Brodersen et al. | May 2004 | B1 |
| 6732111 | Brodersen et al. | May 2004 | B2 |
| 6754681 | Brodersen et al. | Jun 2004 | B2 |
| 6763351 | Subramaniam et al. | Jul 2004 | B1 |
| 6763501 | Zhu et al. | Jul 2004 | B1 |
| 6768904 | Kim | Jul 2004 | B2 |
| 6772229 | Achacoso et al. | Aug 2004 | B1 |
| 6782383 | Subramaniam et al. | Aug 2004 | B2 |
| 6804330 | Jones et al. | Oct 2004 | B1 |
| 6826565 | Ritchie et al. | Nov 2004 | B2 |
| 6826582 | Chatterjee et al. | Nov 2004 | B1 |
| 6826745 | Coker | Nov 2004 | B2 |
| 6829655 | Huang et al. | Dec 2004 | B1 |
| 6842748 | Warner et al. | Jan 2005 | B1 |
| 6850895 | Brodersen et al. | Feb 2005 | B2 |
| 6850949 | Warner et al. | Feb 2005 | B2 |
| 6907566 | McElfresh et al. | Jun 2005 | B1 |
| 7062502 | Kesler | Jun 2006 | B1 |
| 7069231 | Cinarkaya | Jun 2006 | B1 |
| 7069497 | Desai | Jun 2006 | B1 |
| 7100111 | McElfresh et al. | Aug 2006 | B2 |
| 7181758 | Chan | Feb 2007 | B1 |
| 7269590 | Hull et al. | Sep 2007 | B2 |
| 7289976 | Kihneman et al. | Oct 2007 | B2 |
| 7340411 | Cook | Mar 2008 | B2 |
| 7356482 | Frankland et al. | Apr 2008 | B2 |
| 7373599 | McElfresh et al. | May 2008 | B2 |
| 7401094 | Kesler | Jul 2008 | B1 |
| 7406501 | Szeto et al. | Jul 2008 | B2 |
| 7412455 | Dillon | Aug 2008 | B2 |
| 7451393 | Herbison et al. | Nov 2008 | B1 |
| 7454509 | Boulter et al. | Nov 2008 | B2 |
| 7508789 | Chan | Mar 2009 | B2 |
| 7599935 | La Rotonda et al. | Oct 2009 | B2 |
| 7603331 | Tuzhilin et al. | Oct 2009 | B2 |
| 7603483 | Psounis et al. | Oct 2009 | B2 |
| 7620655 | Larsson et al. | Nov 2009 | B2 |
| 7644122 | Weyer et al. | Jan 2010 | B2 |
| 7668861 | Steven | Feb 2010 | B2 |
| 7698160 | Beaven et al. | Apr 2010 | B2 |
| 7730478 | Weissman | Jun 2010 | B2 |
| 7747648 | Kraft et al. | Jun 2010 | B1 |
| 7779039 | Weissman et al. | Aug 2010 | B2 |
| 7779475 | Jakobson et al. | Aug 2010 | B2 |
| 7827208 | Bosworth et al. | Nov 2010 | B2 |
| 7853881 | Aly Assal et al. | Dec 2010 | B1 |
| 7945653 | Zukerberg et al. | May 2011 | B2 |
| 8005896 | Cheah | Aug 2011 | B2 |
| 8014943 | Jakobson | Sep 2011 | B2 |
| 8015495 | Achacoso et al. | Sep 2011 | B2 |
| 8032297 | Jakobson | Oct 2011 | B2 |
| 8073850 | Hubbard et al. | Dec 2011 | B1 |
| 8082301 | Ahlgren et al. | Dec 2011 | B2 |
| 8095413 | Beaven | Jan 2012 | B1 |
| 8095531 | Weissman et al. | Jan 2012 | B2 |
| 8095594 | Beaven et al. | Jan 2012 | B2 |
| 8103611 | Tuzhilin et al. | Jan 2012 | B2 |
| 8150913 | Cheah | Apr 2012 | B2 |
| 8209308 | Rueben et al. | Jun 2012 | B2 |
| 8209333 | Hubbard et al. | Jun 2012 | B2 |
| 8275836 | Beaven et al. | Sep 2012 | B2 |
| 8316309 | Bartek et al. | Nov 2012 | B2 |
| 8457545 | Chan | Jun 2013 | B2 |
| 8484111 | Frankland et al. | Jul 2013 | B2 |
| 8490025 | Jakobson et al. | Jul 2013 | B2 |
| 8504945 | Jakobson et al. | Aug 2013 | B2 |
| 8510045 | Rueben et al. | Aug 2013 | B2 |
| 8510664 | Rueben et al. | Aug 2013 | B2 |
| 8566301 | Rueben et al. | Oct 2013 | B2 |
| 8646103 | Jakobson et al. | Feb 2014 | B2 |
| 9563422 | Cragun et al. | Feb 2017 | B2 |
| 9740743 | Jagota et al. | Aug 2017 | B2 |
| 9817677 | Pessoa et al. | Nov 2017 | B2 |
| 9852382 | Rangaswamy et al. | Dec 2017 | B2 |
| 9946710 | Yamaguchi | Apr 2018 | B2 |
| 10152497 | Doan et al. | Dec 2018 | B2 |
| 10185925 | Bai et al. | Jan 2019 | B2 |
| 10235476 | Vaishnav et al. | Mar 2019 | B2 |
| 10237336 | Dvinov et al. | Mar 2019 | B2 |
| 10304021 | Soloway | May 2019 | B2 |
| 10387388 | Doan et al. | Aug 2019 | B2 |
| 10466868 | Boucher et al. | Nov 2019 | B2 |
| 10681133 | Puleston et al. | Jun 2020 | B2 |
| 10733613 | Vaishnav et al. | Aug 2020 | B2 |
| 10802660 | Krivopaltsev et al. | Oct 2020 | B1 |
| 10901996 | Doan et al. | Jan 2021 | B2 |
| 10949395 | Doan et al. | Mar 2021 | B2 |
| 11138222 | Semlani et al. | Oct 2021 | B2 |
| 11244238 | Jagota et al. | Feb 2022 | B2 |
| 11256690 | Dvinov et al. | Feb 2022 | B2 |
| 11310366 | Dhandapani et al. | Apr 2022 | B1 |
| 11361268 | Fisher et al. | Jun 2022 | B1 |
| 11442989 | Dvinov et al. | Sep 2022 | B2 |
| 11748320 | Hersans et al. | Sep 2023 | B2 |
| 11790414 | Christensen et al. | Oct 2023 | B2 |
| 11798044 | Christensen et al. | Oct 2023 | B2 |
| 20010044791 | Richter et al. | Nov 2001 | A1 |
| 20020072951 | Lee et al. | Jun 2002 | A1 |
| 20020082892 | Raffel et al. | Jun 2002 | A1 |
| 20020129352 | Brodersen et al. | Sep 2002 | A1 |
| 20020140731 | Subramaniam et al. | Oct 2002 | A1 |
| 20020143997 | Huang et al. | Oct 2002 | A1 |
| 20020162090 | Parnell et al. | Oct 2002 | A1 |
| 20020165742 | Robbins | Nov 2002 | A1 |
| 20030004971 | Gong | Jan 2003 | A1 |
| 20030018705 | Chen et al. | Jan 2003 | A1 |
| 20030018830 | Chen et al. | Jan 2003 | A1 |
| 20030066031 | Laane et al. | Apr 2003 | A1 |
| 20030066032 | Ramachandran et al. | Apr 2003 | A1 |
| 20030069936 | Warner et al. | Apr 2003 | A1 |
| 20030070000 | Coker et al. | Apr 2003 | A1 |
| 20030070004 | Mukundan et al. | Apr 2003 | A1 |
| 20030070005 | Mukundan et al. | Apr 2003 | A1 |
| 20030074418 | Coker et al. | Apr 2003 | A1 |
| 20030120675 | Stauber et al. | Jun 2003 | A1 |
| 20030151633 | George et al. | Aug 2003 | A1 |
| 20030159136 | Huang et al. | Aug 2003 | A1 |
| 20030184585 | Lin et al. | Oct 2003 | A1 |
| 20030187921 | Diec et al. | Oct 2003 | A1 |
| 20030189600 | Gune et al. | Oct 2003 | A1 |
| 20030204427 | Gune et al. | Oct 2003 | A1 |
| 20030206192 | Chen et al. | Nov 2003 | A1 |
| 20030225730 | Warner et al. | Dec 2003 | A1 |
| 20040001092 | Rothwein et al. | Jan 2004 | A1 |
| 20040010489 | Rio et al. | Jan 2004 | A1 |
| 20040015981 | Coker et al. | Jan 2004 | A1 |
| 20040027388 | Berg et al. | Feb 2004 | A1 |
| 20040103364 | Dornback | May 2004 | A1 |
| 20040128001 | Levin et al. | Jul 2004 | A1 |
| 20040186860 | Lee et al. | Sep 2004 | A1 |
| 20040193510 | Catahan et al. | Sep 2004 | A1 |
| 20040199489 | Barnes-Leon et al. | Oct 2004 | A1 |
| 20040199536 | Barnes-Leon et al. | Oct 2004 | A1 |
| 20040199543 | Braud et al. | Oct 2004 | A1 |
| 20040249854 | Barnes-Leon et al. | Dec 2004 | A1 |
| 20040260534 | Pak et al. | Dec 2004 | A1 |
| 20040260659 | Chan et al. | Dec 2004 | A1 |
| 20040268299 | Lei et al. | Dec 2004 | A1 |
| 20050050555 | Exley et al. | Mar 2005 | A1 |
| 20050091098 | Brodersen et al. | Apr 2005 | A1 |
| 20050160065 | Seeman | Jul 2005 | A1 |
| 20060122961 | Kalia et al. | Jun 2006 | A1 |
| 20060253830 | Rajanala et al. | Nov 2006 | A1 |
| 20070150820 | Salvo | Jun 2007 | A1 |
| 20080208785 | Trefler et al. | Aug 2008 | A1 |
| 20080249972 | Dillon | Oct 2008 | A1 |
| 20080275829 | Stull et al. | Nov 2008 | A1 |
| 20090063415 | Chatfield et al. | Mar 2009 | A1 |
| 20090100342 | Jakobson | Apr 2009 | A1 |
| 20090150411 | Laaser et al. | Jun 2009 | A1 |
| 20090177744 | Marlow et al. | Jul 2009 | A1 |
| 20110099494 | Yan et al. | Apr 2011 | A1 |
| 20110185294 | Binder et al. | Jul 2011 | A1 |
| 20110218958 | Warshavsky | Sep 2011 | A1 |
| 20110247051 | Bulumulla | Oct 2011 | A1 |
| 20120005592 | Shrinivas | Jan 2012 | A1 |
| 20120016713 | Wilcock et al. | Jan 2012 | A1 |
| 20120042218 | Cinarkaya | Feb 2012 | A1 |
| 20120191865 | Duff et al. | Jul 2012 | A1 |
| 20120233137 | Jakobson et al. | Sep 2012 | A1 |
| 20120254090 | Burris et al. | Oct 2012 | A1 |
| 20120290407 | Hubbard et al. | Nov 2012 | A1 |
| 20130138425 | Luke | May 2013 | A1 |
| 20130179772 | Nakamura | Jul 2013 | A1 |
| 20130212497 | Zelenko et al. | Aug 2013 | A1 |
| 20130218948 | Jakobson | Aug 2013 | A1 |
| 20130218949 | Jakobson | Aug 2013 | A1 |
| 20130218966 | Jakobson | Aug 2013 | A1 |
| 20130247216 | Cinarkaya | Sep 2013 | A1 |
| 20140279405 | Darnieder et al. | Sep 2014 | A1 |
| 20140359537 | Jackobson et al. | Dec 2014 | A1 |
| 20170293629 | Doan et al. | Oct 2017 | A1 |
| 20180025038 | Semlani et al. | Jan 2018 | A1 |
| 20180039667 | Pierce | Feb 2018 | A1 |
| 20180096003 | Vaishnav et al. | Apr 2018 | A1 |
| 20180129686 | Vaishnav | May 2018 | A1 |
| 20180183671 | Dvinov et al. | Jun 2018 | A1 |
| 20180189792 | Vaishnav et al. | Jul 2018 | A1 |
| 20190236184 | Dvinov et al. | Aug 2019 | A1 |
| 20190370363 | Hersans et al. | Dec 2019 | A1 |
| 20200311267 | Klonowski | Oct 2020 | A1 |
| 20210191934 | Xiao | Jun 2021 | A1 |
| 20210216591 | Dvinov et al. | Jul 2021 | A1 |
| 20210241300 | Vaishnav et al. | Aug 2021 | A1 |
| 20210241301 | Christensen et al. | Aug 2021 | A1 |
| 20210241328 | Christensen et al. | Aug 2021 | A1 |
| 20210241329 | Christensen et al. | Aug 2021 | A1 |
| 20210241330 | Vaishnav et al. | Aug 2021 | A1 |
| 20210326311 | Ker et al. | Oct 2021 | A1 |
| 20210406936 | Christensen et al. | Dec 2021 | A1 |
| 20220182491 | Powers et al. | Jun 2022 | A1 |
| 20220283996 | Lecaillon et al. | Sep 2022 | A1 |
| 20220350447 | Sreenivasachar et al. | Nov 2022 | A1 |
| 20230065223 | Penneru et al. | Mar 2023 | A1 |
| 20230113783 | Le et al. | Apr 2023 | A1 |
| 20230214680 | Bernelas | Jul 2023 | A1 |
| 20230260307 | Reisman | Aug 2023 | A1 |
| 20240054149 | Karanth et al. | Feb 2024 | A1 |
| 20240095788 | Vaishnav et al. | Mar 2024 | A1 |
| 20240095789 | Vaishnav et al. | Mar 2024 | A1 |
| 20240168780 | Vaishnav et al. | May 2024 | A1 |
| 20240168957 | Vaishnav et al. | May 2024 | A1 |
| 20240169219 | Vaishnav et al. | May 2024 | A1 |
| Entry |
|---|
| Red Hat, “Red Hat JBoss BRMS 6.4 Getting Started Guide”, pp. 1-32; May 13, 2019. |
| Red Hat Jboss BRMS 6.4, The User Guide for Red Hat JBoss BRMS, 2019 Red Hat, Inc https://access.redhat.com/documentation/en-us/red_hat_jboss_brms/6.4/html/user_guide/index. |
| Final Office Action, U.S. Appl. No. 18/082,230, Mar. 4, 2024, 33 pages. |
| Non-Final Office Action, U.S. Appl. No. 17/993,751, Mar. 1, 2024, 10 pages. |
| Non-Final Office Action, U.S. Appl. No. 18/082,230, Sep. 13, 2023, 30 pages. |
| Advisory Action, U.S. Appl. No. 18/082,230, May 30, 2024, 4 pages. |
| Notice of Allowance, U.S. Appl. No. 17/993,751, Jul. 3, 2024, 7 pages. |
| Notice of Allowance, U.S. Appl. No. 18/082,230, Jul. 31, 2024, 9 pages. |
| Number | Date | Country | |
|---|---|---|---|
| 20240169299 A1 | May 2024 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 17993751 | Nov 2022 | US |
| Child | 18082200 | US |
