Beta node indexing in a rule engine

• US 20090222397A1
• Filed: 02/29/2008
• Published: 09/03/2009
• Est. Priority Date: 02/29/2008
• Status: Abandoned Application

• Current Assignee: Red Hat, Inc. (International Business Machines Corporation)
• Original Assignee: Red Hat, Inc. (International Business Machines Corporation)
• Inventors: Tirelli, Edson, Proctor, Mark
• Application Number:
  US12/074,215
• Publication Number:
  US 20090222397A1
• Time in Patent Office: Days
• US Class Current: 706/48
• CPC Class Codes: G06N 5/025 Extracting rules from data

Abstract

Some embodiments of beta node indexing in an exemplary rule engine have been presented. In one embodiment, a rule engine creates a network based on a set of rules. The network includes at least one multiple-input node, such as a beta node having two inputs. The beta node further includes a memory associated with each input. The rule engine may generate a single index for at least one of the memories of the beta node based on a set of predetermined attributes of elements within the memory. Examples of the elements include tuples and data objects. The index includes a set of composite keys, each having a value of each of the attributes.

Claims

1. A computer-implemented method comprising:

creating a network based on a set of one or more rules, the network comprising at least one multiple-input node, the at least one multiple-input node comprising a plurality of memories, each of the plurality of memories associated with a distinct input of the at least one multiple-input node; and

generating a single index for at least one of the plurality of memories of the at least one multiple-input node of the network based on a plurality of attributes of elements within the at least one memory, the single index comprising a plurality of composite keys, each of the plurality of composite keys comprising a value of each of the plurality of attributes.

2. The method of claim 1, further comprising:

propagating a new element into the at least one multiple-input node; and

determining which of the elements within the at least one of the plurality of memories matches the new element based on the single index without iterating over each of the elements within the at least one of the plurality of memories.

3. The method of claim 1, wherein generating a single index for the at least one of the plurality of memories of the at least one multiple-input node based on the plurality of attributes of the elements within the at least one of the plurality of memories comprises:

creating each of the composite keys using a unique combination of the value of each of the plurality of attributes; and

allocating a bucket to each of the composite keys.

4. The method of claim 1, further comprising:

generating a composite key for a new element propagated into the at least one multiple-input node;

if the composite key matches one of the plurality of composite keys, placing the new element into a bucket associated with the one of the plurality of composite keys; and

if none of the plurality of composite keys matches the new composite key, allocating a new bucket to the new composite key and placing the new element into the new bucket.

5. The method of claim 1, wherein the set of one or more rules comprises one or more business rules.

6. The method of claim 1, wherein the network comprises a Rete network.

7. The method of claim 1, wherein the at least one multiple-input node is a beta node.

8. An apparatus comprising:

a rule repository to store a set of one or more rules; and

a rule engine core coupled to the rule repository to create a network based on the set of one or more rules, the network comprising at least one multiple-input node, the at least one multiple-input node comprising a plurality of memories, each of the plurality of memories associated with a distinct input of the at least one multiple-input node, and to generate a single index for at least one of the plurality of memories of the at least one multiple-input node based on a plurality of attributes of elements within the at least one of the plurality of memories, the single index comprising a plurality of composite keys, each of the plurality of composite keys comprising a value of each of the plurality of attributes.

9. The apparatus of claim 8, further comprising:

a working memory coupled to the rule engine core, to store a fact, which is introduced into the network as a new element when asserted, wherein the new element propagates into the at least one multiple-input node to cause the rule engine core to determine which of the elements within the at least one of the plurality of memories matches the new element based on the single index without iterating over each of the elements within the at least one of the plurality of memories.

10. The apparatus of claim 8, wherein the rule engine core creates each of the composite keys using a unique combination of the value of each of the plurality of attributes and allocates a bucket to each of the composite keys.

11. The apparatus of claim 8, wherein the rule engine core generates a composite key for a new element propagated into the at least one multiple-input node, the rule engine core places the new element into a bucket associated with the one of the plurality of composite keys if the composite key matches one of the plurality of composite keys, and the rule engine core allocates a new bucket to the new composite key and places the new element into the new bucket if none of the plurality of composite keys matches the new composite key.

12. The apparatus of claim 8, wherein the network comprises a Rete network.

13. The apparatus of claim 8, wherein the at least one multiple-input node is a beta node.

14. A system comprising the apparatus of claim 8, further comprising:

a user interface operatively coupled to the rule repository to receive the set of one or more rules from a user, wherein the plurality of rules comprises a plurality of business rules for determining if an applicant qualifies for a mortgage.

15. A system comprising the apparatus of claim 8, further comprising:

a server operable to execute the core rule engine; and

a client machine communicatively coupled to the server via a network, the client machine comprising a user interface to receive the plurality of rules from a user and to send the plurality of rules to the server via the network.

16. A computer-readable medium that provides instructions that, when executed by a processor, will cause the processor to perform operations comprising:

creating a network based on a set of one or more rules, the network comprising at least one multiple-input node, the at least one multiple-input node comprising a plurality of memories, each of the plurality of memories associated with a distinct input of the at least one multiple-input node; and

generating a single index for at least one of the plurality of memories of the at least one multiple-input node of the network based on a plurality of attributes of elements within the at least one memory, the single index comprising a plurality of composite keys, each of the plurality of composite keys comprising a value of each of the plurality of attributes.

17. The computer-readable medium of claim 16, further comprising:

propagating a new element into the at least one multiple-input node; and

determining which of the elements within the at least one of the plurality of memories matches the new element based on the single index without iterating over each of the elements within the at least one of the plurality of memories.

18. The computer-readable medium of claim 16, wherein generating a single index for the at least one of the plurality of memories of the at least one multiple-input node based on the plurality of attributes of the elements within the at least one of the plurality of memories comprises:

creating each of the composite keys using a unique combination of the value of each of the plurality of attributes; and

allocating a bucket to each of the composite keys.

19. The computer-readable medium of claim 16, further comprising:

generating a composite key for a new element propagated into the at least one multiple-input node;

if the composite key matches one of the plurality of composite keys, placing the new element into a bucket associated with the one of the plurality of composite keys; and

if none of the plurality of composite keys matches the new composite key, allocating a new bucket to the new composite key and placing the new element into the new bucket.

20. The computer-readable medium of claim 16, wherein the set of one or more rules comprises one or more business rules.

21. The computer-readable medium of claim 16, wherein the network comprises a Rete network.

22. The computer-readable medium of claim 16, wherein the at least one multiple-input node is a beta node.