Complex event discovery in event databases

• US 20060155719A1
• Filed: 01/10/2005
• Published: 07/13/2006
• Est. Priority Date: 01/10/2005
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Mihaeli, Joris, Botzer, David, Etzion, Opher, Sommer, Ziva
• Application Number:
  US11/032,579
• Publication Number:
  US 20060155719A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/28 Databases characterised by their database models, e.g. relational or object models

Abstract

Situation detection systems and methods are provided, in which the capabilities of standard event stores and relational systems are enhanced by augmented event-oriented algebraic operators. Rules involving the event-oriented operators are combined with conventional relational algebraic techniques, and applied to an event database in order to detect more complex patterns, indicative of composite events or situations.

Claims

1. A method for situation detection implemented by a computer, comprising the steps of:

storing component events in an event database;

specifying a composite event as a combination of at least first and second instances of said component events;

defining a rule, which causes a reaction to be invoked upon detection of said composite event in said event database, wherein said rule comprises at least one algebraic event-oriented operator;

defining a query comprising said rule for said component events;

executing said query to search said event database and

applying said rule in said event database to determine whether said first and second instances of said component events can satisfy said rule, by the steps of;

responsively to applying said rule, determining that said composite event has occurred; and

invoking said reaction.

2. The method according to claim 1, wherein said rule further comprises a specification of a lifespan of at least one of said component events.

3. The method according to claim 1, wherein said rule further references a plurality of lifespans, further comprising the steps of:

ordering said lifespans in accordance with a predetermined sorting criterion;

defining a lifespan graph having nodes comprising said lifespans and having edges comprising interval relationships among said lifespans;

defining at least one new query; and

executing said query and said new query in an execution order that is defined by an execution path formed by a traversal of said graph.

4. The method according to claim 3, wherein said sorting criterion is starting points of said lifespans.

5. The method according to claim 3, wherein said sorting criterion is ending points of said lifespans.

6. The method according to claim 1, wherein applying said rule comprises implementing an event consumption policy.

7. The method according to claim 1, wherein said reaction comprises modifying said event database.

8. The method according to claim 1, wherein one of said component events is a primitive event.

9. The method according to claim 1, wherein one of said component events is a constituent composite event.

10. A computer software product, including a computer-readable medium in which computer program instructions are stored, which instructions, when read by a computer, cause the computer to perform an automated method for situation detection, comprising the steps of:

storing component events in an event database;

specifying a composite event as a combination of at least first and second instances of said component events;

defining a rule, which causes a reaction to be invoked upon detection of said composite event in said event database, wherein said rule comprises at least one algebraic event-oriented operator;

defining a query comprising said rule for said component events;

executing said query to search said event database and

applying said rule in said event database to determine whether said first and second instances of said component events can satisfy said rule, by the steps of;

responsively to applying said rule, determining that said composite event has occurred; and

invoking said reaction.

11. The computer software product according to claim 10, wherein said rule further comprises a specification of a lifespan of at least one of said component events.

12. The computer software product according to claim 10, wherein said rule further references a plurality of lifespans, further comprising the steps of:

ordering said lifespans in accordance with a predetermined sorting criterion;

defining a lifespan graph having nodes comprising said lifespans and having edges comprising interval relationships among said lifespans;

defining at least one new query; and

executing said query and said new query in an execution order that is determined by an execution path formed by a traversal of said graph.

13. The computer software product according to claim 12, wherein said sorting criterion is starting points of said lifespans.

14. The computer software product according to claim 12, wherein said sorting criterion is ending points of said lifespans.

15. The computer software product according to claim 10, wherein applying said rule comprises implementing an event consumption policy.

16. The computer software product according to claim 10, wherein said reaction comprises modifying said event database.

17. The computer software product according to claim 10, wherein one of said component events is a primitive event.

18. The computer software product according to claim 10, wherein one of said component events is a constituent composite event.

19. A data processing system for situation detection, comprising:

a processor operative for storing component events in an event database;

an event query processor executing in said processor that is operative to perform the steps of specifying a composite event as a combination of at least first and second instances of said component events;

accepting as an input a rule, which causes a reaction to be invoked upon detection of said composite event in said event database, wherein said rule comprises at least one algebraic event-oriented operator;

constructing a query comprising said rule for said component events;

executing said query to search said event database and

applying said rule in said event database to determine whether said first and second instances of said component events can satisfy said rule, by the steps of;

responsively to applying said rule, determining that said composite event has occurred said processor is operative for invoking said reaction.

20. The data processing system according to claim 19, wherein said rule further comprises a specification of a lifespan of at least one of said component events.

21. The data processing system according to claim 19, wherein said rule further references a plurality of lifespans, and said event query processor is further operative to perform the steps of:

ordering said lifespans in accordance with a predetermined sorting criterion;

defining a lifespan graph having nodes comprising said lifespans and having edges comprising interval relationships among said lifespans;

defining at least one new query; and

executing said query and said new query in an execution order that is determined by an execution path formed by a traversal of said graph.

22. The data processing system according to claim 21, wherein said sorting criterion is starting points of said lifespans.

23. The data processing system according to claim 21, wherein said sorting criterion is ending points of said lifespans.

24. The data processing system according to claim 19, wherein applying said rule comprises implementing an event consumption policy.

25. The data processing system according to claim 19, wherein said reaction comprises modifying said event database.

26. The data processing system according to claim 19, wherein one of said component events is a primitive event.

27. The data processing system according to claim 19, wherein one of said component events is a constituent composite event.