Event processing based on meta-relationship definition

• US 8,595,264 B2
• Filed: 06/30/2011
• Issued: 11/26/2013
• Est. Priority Date: 06/30/2011
• Status: Active Grant

• Current Assignee: BMC Software Incorporated (KKR & Co., Inc.)
• Original Assignee: BM Software Incorporated
• Inventors: Stvenne, Jean-Marc
• Primary Examiner(s): Uddin, Mohammed R
• Application Number:
  US13/174,736
• Publication Number:
  US 20130006987A1
• Time in Patent Office: 880 Days
• Field of Search: 707/737, 707/802, 707/806, 707/999.102
• US Class Current: 707/802
• CPC Class Codes: G06F 11/079 Root cause analysis, i.e. error or fault diagnosis in a hardware test environment G06F11/22; in a software test environment G06F11/36
• CPC Class Codes: G06F 11/3072 where the reporting involves data filtering, e.g. pattern matching, time or event triggered, adaptive or policy-based reporting

Abstract

According to an example implementation, a non-transitory computer-readable storage medium is provided that includes computer-readable instructions stored thereon that, when executed, are configured to cause a processor to at least: store a relationship definition including one or more selectors identifying events participating in the relationship and one or more constraints between the events, at least one of the constraints expressed in terms of one or more relationship parameters. The instructions further cause the processor to receive one or more events, evaluate the received events against the one or more selectors, create a candidate relationship when the relationship parameters have been defined based on receiving one or more events that match one or more of the selectors, and convert the candidate relationship to a relationship instance when a minimum number of events matching each of the selectors are received.

Claims

1. A non-transitory computer-readable storage medium comprising computer-readable instructions stored thereon that, when executed, are configured to cause a processor to at least:

store a relationship definition including one or more selectors identifying events participating in the relationship and one or more constraints between the events, at least one of the constraints expressed in terms of one or more relationship parameters;

receive one or more events;

evaluate the received events against the one or more selectors;

create a candidate relationship when the relationship parameters have been defined based on receiving one or more events that match a minimal deterministic set of the selectors;

convert the candidate relationship to a relationship instance when a minimum number of events matching each of the selectors are-received;

add an event to an existing relationship instance if the event matches the constraints of the existing relationship instance; and

otherwise, add the event to an existing candidate relationship if the event matches the constraints of the candidate relationship.

2. The computer-readable storage medium of claim 1 wherein the instructions are further configured to cause the processor to provide a notification of an existence of the relationship instance.

3. The computer-readable storage medium of claim 1 wherein the instructions being configured to cause the processor to evaluate comprise instructions that are configured to cause the processor to compare each of the received events to the one or more selectors to determine if each of the received events meets or matches the constraints between the events.

4. The computer-readable storage medium of claim 1 wherein the constraints between events comprise a time constraint between events.

5. The computer-readable storage medium of claim 1 wherein the instructions are further configured to cause the processor to add additional events to the relationship instance that match the selectors, up to a maximum number of events for each selector.

6. The computer-readable storage medium of claim 1 wherein the relationship definition includes a description of the relationship, wherein the relationship description includes values of the parameters for the relationship instance.

7. A computer implemented method comprising:

storing a relationship definition including one or more selectors identifying events participating in the relationship and one or more constraints between the events, at least one of the constraints expressed in terms of one or more relationship parameters;

receiving one or more events;

evaluating the received events against the one or more selectors;

creating a candidate relationship when the relationship parameters have been defined based on receiving one or more events that match a minimal deterministic set of the selectors; and

converting the candidate relationship to a relationship instance when a minimum number of events matching each of the selectors are received;

adding an event to an existing relationship instance if the event matches the constraints of the existing relationship instance; and

otherwise, adding the event to an existing candidate relationship if the event matches the constraints of the candidate relationship.

8. The computer-implemented method of claim 7 and further comprising providing a notification of an existence of the relationship instance.

9. The computer-implemented method of claim 7 wherein the evaluating comprises comparing each of the received events to the one or more selectors to determine if each of the received events meets or matches the constraints between the events.

10. The computer-implemented method of claim 7 wherein the constraints between events comprise a time constraint between events.

11. The computer-implemented method of claim 7 wherein the computer-implemented method further comprises:

adding additional events to the candidate relationship that match the selectors, up to a maximum number of events for each selector.

12. The computer-implemented method of claim 7 wherein the method further comprises adding one or more additional events to the relationship instance that match the selectors, up to a maximum number of events for each selector.

13. A computer system including instructions recorded on a computer-readable storage medium and readable by at least one processor the system comprising:

meta-relationship logic configured to cause the at least one processor to store a relationship definition including one or more selectors identifying events participating in the relationship and one or more constraints between the events, at least one of the constraints expressed in terms of one or more relationship parameters;

an event receiver configured to receive one or more events;

an event processing logic configured to evaluate or compare the received events against the one or more selectors;

a relationship manager configured to cause the at least one processor to create a candidate relationship when the relationship parameters have been defined based on receiving one or more events that match a minimal deterministic set of the selectors;

wherein the relationship manager is further configured to cause the at least one processor to convert the candidate relationship to a relationship instance when a minimum number of events matching each of the selectors have been received; and

wherein the relationship manager is further configured to cause the at least one processor to;

add an event to an existing relationship instance if the event matches the constraints of the existing relationship instance; and

otherwise, add the event to an existing candidate relationship if the event matches the constraints of the candidate relationship.

14. The computer system of claim 13 wherein the constraints between events comprise a time constraint between events.

15. The computer system of claim 13 and further comprising logic configured to cause the at least one processor to provide a notification of an existence of the relationship instance.

16. The computer system of claim 13 and further comprising logic configured to cause the at least one processor to provide a notification of an existence of the candidate relationship.