System for interpretation of streaming data filters

• US 20060197766A1
• Filed: 03/07/2005
• Published: 09/07/2006
• Est. Priority Date: 03/07/2005
• Status: Abandoned Application

• Current Assignee: Digital Fuel Technologies Incorporated (International Business Machines Corporation)
• Original Assignee: Digital Fuel Technologies Incorporated (International Business Machines Corporation)
• Inventors: Raz, Gilad
• Application Number:
  US11/072,516
• Publication Number:
  US 20060197766A1
• Time in Patent Office: Days
• US Class Current: 345/506
• CPC Class Codes: G06F 16/2477 Temporal data queries

Abstract

A method for processing streaming data, including selecting a flow having a plurality of operations configured to be applied to streaming data, and executing any of the operations defined in the flow, where the operations are executed on the streaming data, where the operations are executed in a series of discrete stages, during each stage performing a discrete function in a multi-stage operation, and where the operations are executed incrementally, processing each new part of the streaming data as it becomes available for processing.

Claims

1. A method for processing streaming data, the method comprising:

selecting a flow having a plurality of operations configured to be applied to streaming data; and

executing any of said operations defined in said flow, wherein said operations are executed on said streaming data, wherein said operations are executed in a series of discrete stages, during each stage performing a discrete function in a multi-stage operation, and wherein said operations are executed incrementally, processing each new part of said streaming data as it becomes available for processing.

2. A method according to claim 1 wherein said executing step comprises executing each of said operations in an independent computational thread.

3. A method according to claim 1 and further comprising:

selecting a template associated with a first flow, wherein said template includes at least one missing parameter value; and

modifying said template by assigning a value to any of said parameters, thereby creating a second flow.

4. A method according to claim 1 and further comprising representing said flow as a graph, wherein said graph includes at least one edge and at least one arc, wherein said edge represents an operation of said flow, and wherein said arc represents a dependency relationship between two of said operations.

5. A method according to claim 4 wherein said executing step comprises executing said dependent operation after executing the operation on which it depends.

6. A method according to claim 4 and further comprising:

adding a new operation edge into said flow graph subsequent to executing said operations in said flow; and

defining a new dependency arc for said new edge with respect to at least one of said edges in said graph.

7. A method according to claim 6 and further comprising executing only said added operation among said previously-executed operations in said flow.

8. A method according to claim 4 and further comprising:

a) identifying any of said operations in said graph that does not depend on any other of said operations in said graph;

b) executing said identified operations;

c) identifying any of said not-yet-executed operations in said graph where all of the operations upon which said not-yet-executed operation depends have been executed;

d) executing said identified not-yet-executed operations; and

e) performing steps c) and d) until all of said operations have been executed.

9. A method according to claim 8 and further comprising:

adding a new operation edge into said flow graph subsequent to executing said operations in said flow;

defining a new dependency arc for said new operation with respect to at least one of said operations in said graph treating any of said operations which depend on said new operation as not-yet-executed operations; and

performing steps c) and d) until all of said operations have been executed, executing only said added operation and said not-yet-executed operations among said previously-executed operations in said flow.

10. A system for processing streaming data, the system comprising:

means for selecting a flow having a plurality of operations configured to be applied to streaming data; and

means for executing any of said operations defined in said flow, wherein said operations are executed on said streaming data, wherein said operations are executed in a series of discrete stages, during each stage performing a discrete function in a multi-stage operation, and wherein said operations are executed incrementally, processing each new part of said streaming data as it becomes available for processing.

11. A system according to claim 10 wherein said means for executing is operative to execute each of said operations in an independent computational thread.

12. A system according to claim 10 and further comprising:

means for selecting a template associated with a first flow, wherein said template includes at least one missing parameter value; and

means for modifying said template by assigning a value to any of said parameters, thereby creating a second flow.

13. A system according to claim 10 and further comprising means for representing said flow as a graph, wherein said graph includes at least one edge and at least one arc, wherein said edge represents an operation of said flow, and wherein said arc represents a dependency relationship between two of said operations.

14. A system according to claim 13 wherein said means for executing is operative to execute said dependent operation after executing the operation on which it depends.

15. A system according to claim 13 and further comprising:

means for adding a new operation edge into said flow graph subsequent to executing said operations in said flow; and

means for defining a new dependency arc for said new edge with respect to at least one of said edges in said graph.

16. A system according to claim 15 and further comprising means for executing only said added operation among said previously-executed operations in said flow.

17. A system according to claim 13 and further comprising:

a) means for identifying any of said operations in said graph that does not depend on any other of said operations in said graph;

b) means for executing said identified operations;

c) means for identifying any of said not-yet-executed operations in said graph where all of the operations upon which said not-yet-executed operation depends have been executed;

d) means for executing said identified not-yet-executed operations; and

e) means for performing steps c) and d) until all of said operations have been executed.

18. A system according to claim 17 and further comprising:

means for adding a new operation edge into said flow graph subsequent to executing said operations in said flow;

means for defining a new dependency arc for said new operation with respect to at least one of said operations in said graph means for treating any of said operations which depend on said new operation as not-yet-executed operations; and

means for performing steps c) and d) until all of said operations have been executed, executing only said added operation and said not-yet-executed operations among said previously-executed operations in said flow.

19. A computer-implemented program embodied on a computer-readable medium, the computer program comprising:

a first code segment operative to select a flow having a plurality of operations configured to be applied to streaming data; and

a second code segment operative to execute any of said operations defined in said flow, wherein said operations are executed on said streaming data, wherein said operations are executed in a series of discrete stages, during each stage performing a discrete function in a multi-stage operation, and wherein said operations are executed incrementally, processing each new part of said streaming data as it becomes available for processing.