QUERY BASED RULE SETS

• US 20090019000A1
• Filed: 07/12/2007
• Published: 01/15/2009
• Est. Priority Date: 07/12/2007
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Breitbach, Michael Todd, Kulack, Frederick Allyn, Arends, Mitchell Jon, Dettinger, Richard Dean
• Application Number:
  US11/776,771
• Publication Number:
  US 20090019000A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2435 Active constructs
• CPC Class Codes: G06F 16/24565 Triggers; Constraints

Abstract

Embodiments of the invention provide techniques for processing abstract rule sets in a query engine. In general, the functions and Boolean logic incorporated in an abstract rule are analyzed to determine whether the rule may be processed by a query engine. As a result, the abstract rule as a whole may be processed by a query engine, may be processed in a rule engine, or may be processed in two stages in a query engine and a rule engine.

Claims

1. A computer-implemented method for processing an abstract rule, comprising:

receiving an abstract rule having a conditional statement and a consequential statement;

wherein the consequential statement defines a particular recommendation that is returned when the conditional statement is satisfied;

wherein the conditional statement and the consequential statement are defined using logical field definitions defined in an abstraction model that models underlying physical data in a manner making a schema of the physical data transparent to a user of the abstraction model;

determining one or more functions required to evaluate the conditional statement;

determining at least one function, from the one or more required functions, that can be processed by a query engine;

generating a query statement comprising the determined at least one function, such that the resulting query statement evaluates a portion of the conditional statement;

wherein the resulting query statement is formatted for processing by the query engine;

determining at least one remaining function of the one or more required functions, wherein the at least one remaining function is not included in the query statement; and

transforming the at least one remaining function into an executable rule, wherein the executable rule is formatted for processing by a rule engine according to the determined logical sequence.

2. The computer-implemented method of claim 1, further comprising:

processing the query statement by the query engine; and

if the conditional statement is resolved to true for the processed query statement, returning the particular recommendation.

3. The computer-implemented method of claim 2, wherein processing the query statement comprises:

selecting one or more field values from a query result set.

4. The computer-implemented method of claim 2, further comprising:

processing the executable rule by the rule engine, using the output of the processed query statement as an input to the rule engine, wherein the output of processing the executable rule is the same as the output resulting from processing the entire abstract rule as an executable rule by a rule engine; and

if the conditional statement is resolved to true for the processed query statement, returning the particular recommendation.

5. The computer-implemented method of claim 1, wherein generating a query statement comprising the determined at least one function comprises:

determining a logical sequence required for processing the one or more required functions, and

generating the query statement in accordance to the determined logical sequence.

6. The computer-implemented method of claim 1, wherein transforming the at least one remaining function into an executable rule comprises:

retrieving a specification of the at least one remaining function in a first computer-readable language; and

transforming the specification into a language which is accepted by the rule engine.

7. The computer-implemented method of claim 1, wherein generating a query statement comprises:

receiving one or more entity identifiers from a query result set; and

including, in each query statement, one of the one or more entity identifiers.

8. A computer readable storage medium containing a program which, when executed, performs an operation, comprising:

receiving an abstract rule having a conditional statement and a consequential statement;

wherein the consequential statement defines a particular recommendation that is returned when the conditional statement is satisfied;

wherein the conditional statement and the consequential statement are defined using logical field definitions defined in an abstraction model that models underlying physical data in a manner making a schema of the physical data transparent to a user of the abstraction model;

determining one or more functions required to evaluate the conditional statement;

determining at least one function, from the one or more required functions, that can be processed by a query engine;

generating a query statement comprising the determined at least one function, such that the resulting query statement evaluates a portion of the conditional statement;

wherein the resulting query statement is formatted for processing by the query engine;

determining at least one remaining function of the one or more required functions, wherein the at least one remaining function is not included in the query statement; and

transforming the at least one remaining function into an executable rule, wherein the executable rule is formatted for processing by a rule engine according to the determined logical sequence.

9. The computer readable storage medium of claim 8, further comprising:

processing the query statement by the query engine; and

if the conditional statement is resolved to true for the processed query statement, returning the particular recommendation.

10. The computer readable medium of claim 9, wherein processing the query statement comprises:

selecting one or more field values from a query result set.

11. The computer readable storage medium of claim 9, further comprising:

processing the executable rule by the rule engine, using the output of the processed query statement as an input to the rule engine, wherein the output of processing the executable rule is the same as the output resulting from processing the entire abstract rule as an executable rule by a rule engine; and

if the conditional statement is resolved to true for the processed query statement, returning the particular recommendation.

12. The computer readable storage medium of claim 8, wherein generating a query statement comprising the determined at least one function comprises:

determining a logical sequence required for processing the one or more required functions, and

generating the query statement in accordance to the determined logical sequence.

13. The computer readable storage medium of claim 8, wherein transforming the at least one remaining function into an executable rule comprises:

retrieving a specification of the at least one remaining function in a first computer-readable language; and

transforming the specification into a language which is accepted by the rule engine.

14. The computer readable storage medium of claim 8, wherein generating a query statement comprises:

receiving one or more entity identifiers from a query result set; and

including, in each query statement, one of the one or more entity identifiers.

15. A system, comprising:

a processor; and

a memory containing a program configured to process an abstract rule by performing an operation, comprising;

receiving an abstract rule having a conditional statement and a consequential statement;

wherein the consequential statement defines a particular recommendation that is returned when the conditional statement is satisfied;

wherein the conditional statement and the consequential statement are defined using logical field definitions defined in an abstraction model that models underlying physical data in a manner making a schema of the physical data transparent to a user of the abstraction model;

generating a query statement comprising at least one function required to evaluate a portion of the conditional statement, wherein the query statement is formatted for processing by the query engine.

16. The system of claim 15, wherein the at least one function is selected by:

determining one or more functions required to evaluate the conditional statement;

determining a logical sequence required for processing the one or more required functions; and

selecting, of one or more required functions, at least one function that can be processed by a query engine according to the determined logical sequence.

17. The system of claim 15, wherein the operation further comprises:

processing the query statement by the query engine; and

if the conditional statement is resolved to true for the processed query statement, returning the particular recommendation.

18. The system of claim 15, wherein the operation further comprises:

determining at least one remaining function of the one or more required functions, wherein the at least one remaining function is not included in the query statement; and

transforming the at least one remaining function into an executable rule, wherein the executable rule is formatted for processing by a rule engine.

19. The system of claim 18, wherein the operation further comprises:

processing the query statement by the query engine;

processing the executable rule by the rule engine, using the output of the processed query statement as an input to the rule engine, wherein the output of processing the executable rule is the same as the output resulting from processing the entire abstract rule as an executable rule by a rule engine; and

if the conditional statement is resolved to true for the processed query statement, returning the particular recommendation.

20. A computer-implemented method for processing an abstract rule, comprising:

receiving an abstract rule having a conditional statement and a consequential statement;

wherein the consequential statement defines a particular recommendation that is returned when the conditional statement is satisfied;

wherein the conditional statement and the consequential statement are defined using logical field definitions defined in an abstraction model that models underlying physical data in a manner making a schema of the physical data transparent to a user of the abstraction model;

generating a query statement comprising at least one function required to evaluate a portion of the conditional statement, wherein the query statement is formatted for processing by the query engine.

21. The computer-implemented method of claim 20, wherein the at least one function is selected by:

determining one or more functions required to evaluate the conditional statement;

determining a logical sequence required for processing the one or more required functions; and

selecting, of one or more required functions, at least one function that can be processed by a query engine according to the determined logical sequence.

22. The computer-implemented method of claim 20, further comprising:

processing the query statement by the query engine; and

if the conditional statement is resolved to true for the processed query statement, returning the particular recommendation.

23. The computer-implemented method of claim 20, further comprising:

determining at least one remaining function of the one or more required functions, wherein the at least one remaining function is not included in the query statement; and

transforming the at least one remaining function into an executable rule, wherein the executable rule is formatted for processing by a rule engine.

24. The computer-implemented method of claim 23, further comprising:

processing the query statement by the query engine;

processing the executable rule by the rule engine, using the output of the processed query statement as an input to the rule engine, wherein the output of processing the executable rule is the same as the output resulting from processing the entire abstract rule as an executable rule by a rule engine; and

if the conditional statement is resolved to true for the processed query statement, returning the particular recommendation.

25. The computer-implemented method of claim 23, wherein transforming the at least one remaining function into an executable rule comprises:

retrieving a specification of the at least one remaining function in a first computer-readable language; and

transforming the specification into a language which is accepted by the rule engine.