Abstract: The automated creation of a dataflow graph of a standing query. Once the standing query dataflow graph is created, events may be flowed into the dataflow graph to execute the standing query. In execution, a store query is accessed. The store query is structured in accordance with a store query language. A syntax graph (such as an abstract syntax tree) of the store query may then be generated. Then, using the syntax graph and a set of rules of the store query language, the dataflow graph is automatically generated. This significant speeds up and makes more easy and efficient the conversion of a store query into a standing query.

Abstract: The automated creation of a dataflow graph of a standing query. Once the standing query dataflow graph is created, events may be flowed into the dataflow graph to execute the standing query. In execution, a store query is accessed. The store query is structured in accordance with a store query language. A syntax graph (such as an abstract syntax tree) of the store query may then be generated. Then, using the syntax graph and a set of rules of the store query language, the dataflow graph is automatically generated. This significant speeds up and makes more easy and efficient the conversion of a store query into a standing query.

Abstract: Performance data generated according to a first schema is read. From the first schema, object descriptors having common primitive types are identified. A second schema is then created. The second schema defines a plurality of rows and at least one column. The rows include a record corresponding to an identified object descriptor. The at least one column corresponds to a primitive type in common with the identified object descriptors.

Abstract: The automated creation of a dataflow graph of a standing query. Once the standing query dataflow graph is created, events may be flowed into the dataflow graph to execute the standing query. In execution, a store query is accessed. The store query is structured in accordance with a store query language. A syntax graph (such as an abstract syntax tree) of the store query may then be generated. Then, using the syntax graph and a set of rules of the store query language, the dataflow graph is automatically generated. This significant speeds up and makes more easy and efficient the conversion of a store query into a standing query.

Abstract: A network standards file comprises information associated with a set of events and network variables associated with the device. An event and a network variable to be monitored are selected based on a user input. A template object file is generated based on at least one of the network variable and event. Network data from a network device is obtained based on the template object file. A storage schema is generated based on the template object file and the network data. The network data is stored based on the storage schema for monitoring the network device.

Abstract: Performance data generated according to a first schema is read. From the first schema, object descriptors having common primitive types are identified. A second schema is then created. The second schema defines a plurality of rows and at least one column. The rows include a record corresponding to an identified object descriptor. The at least one column corresponds to a primitive type in common with the identified object descriptors.

Abstract: Creating and executing a distributed stream processing operator graph based on a query. The operator graph includes movable stream algebra operators for processing events received from high volume data streams. The operators are partially compiled and distributed to computing devices for completion of the compilation and subsequent execution. During execution, the operators maintain minimal state information associated with received events via an expiration time assigned to each of the event instances. Additional events are generated and aggregated by the operators for communication to a service responsible for the query.

Abstract: Validating executable data for interactions among a plurality of process artifacts at design time. A data context is created to include the plurality of process artifacts. The data context carries interaction rules among the plurality of process artifacts. The executable data from a data source is associated with the plurality of process artifacts in the created data context. A subset of the interaction rules is selected corresponding to at least one of the plurality of process artifacts. The associated executable data is validated when the associated executable data is in accordance with the selected subset of the interaction rules.

Abstract: Creating and executing a distributed stream processing operator graph based on a query. The operator graph includes movable stream algebra operators for processing events received from high volume data streams. The operators are partially compiled and distributed to computing devices for completion of the compilation and subsequent execution. During execution, the operators maintain minimal state information associated with received events via an expiration time assigned to each of the event instances. Additional events are generated and aggregated by the operators for communication to a service responsible for the query.

Abstract: Creating and executing a distributed stream processing operator graph based on a query. The operator graph includes movable stream algebra operators for processing events received from high volume data streams. The operators are partially compiled and distributed to computing devices for completion of the compilation and subsequent execution. During execution, the operators maintain minimal state information associated with received events via an expiration time assigned to each of the event instances. Additional events are generated and aggregated by the operators for communication to a service responsible for the query.

Abstract: A distributed event processing system that can organize (e.g., order) input streams regardless of actual time of receipt is provided. This order may simply be arrival order or given explicitly on a specific event attribute, such as a timestamp or sequence number. Traditional standing event queries, such as a temporal correlation of events across multiple streams, often block if an input stream is slow or may produce an incorrect answer if events fail to arrive within the fixed time interval. In response to this situation, the subject innovation employs punctuation and heartbeats in connection with a robust and scalable event processing system. The innovation discloses mechanisms by which heartbeats and timestamps can be regularly generated by low-level nodes (e.g., sources) and propagated through the network, to unblock standing event pattern queries and align events from multiple distributed streams.

Abstract: Validating executable data for interactions among a plurality of process artifacts at design time. A data context is created to include the plurality of process artifacts. The data context carries interaction rules among the plurality of process artifacts. The executable data from a data source is associated with the plurality of process artifacts in the created data context. A subset of the interaction rules is selected corresponding to at least one of the plurality of process artifacts. The associated executable data is validated when the associated executable data is in accordance with the selected subset of the interaction rules.

Abstract: Validating executable data for interactions among a plurality of process artifacts at design time. A data context is created to include the plurality of process artifacts. The data context carries interaction rules among the plurality of process artifacts. The executable data from a data source is associated with the plurality of process artifacts in the created data context. A subset of the interaction rules is selected corresponding to at least one of the plurality of process artifacts. The associated executable data is validated when the associated executable data is in accordance with the selected subset of the interaction rules.

Abstract: Event data associated with state data corresponding to an instance of a process is collected by an interceptor associated with a server that performs an operation to modify the state data. The server performs a single transaction with the database to store both the modified state data and the associated event data, the transaction either succeeding or failing, whereby if the transaction succeeds, then both the state data and the event data are stored at the database, and if the transaction fails, then both the state data and the event data are not stored at the database. The event data stored at the database is then transmitted to a tracking service for conversion into a query-able format.

Abstract: System and method for notifying a user of an occurrence of a defined condition in a process. The process includes a plurality of event records associated with the process; each of the plurality of event records includes a plurality of data fields having data relating to the process. A subset of the plurality of event records is defined where the subset relates to the defined condition. The data in the defined subset is updated at a predetermined time interval. The user is notified when the updated data of the defined subset indicates that the defined condition has occurred. The subset may alternatively be defined as a function of a current time, a last run time and the defined condition.

Abstract: Creating and executing a distributed stream processing operator graph based on a query. The operator graph includes movable stream algebra operators for processing events received from high volume data streams. The operators are partially compiled and distributed to computing devices for completion of the compilation and subsequent execution. During execution, the operators maintain minimal state information associated with received events via an expiration time assigned to each of the event instances. Additional events are generated and aggregated by the operators for communication to a service responsible for the query.

Abstract: Creating and executing a distributed stream processing operator graph based on a query. The operator graph includes movable stream algebra operators for processing events received from high volume data streams. The operators are partially compiled and distributed to computing devices for completion of the compilation and subsequent execution. During execution, the operators maintain minimal state information associated with received events via an expiration time assigned to each of the event instances. Additional events are generated and aggregated by the operators for communication to a service responsible for the query.

Abstract: System and method for identifying a pattern. A method of the invention compiles a pattern description where the pattern description defines a series of a first event and a second event relating to the first event. The first event is received and includes a type parameter data, a time parameter data, and a substance parameter data. A system of the invention includes a script component for associating or attaching a first script to the first event. The first script defines the type, time, and substance parameters of the second event as a function of the parameters of the first event according to the pattern description. A pattern recognition engine executes the attached first script and the executed script identifies the second event and thereby identifies the pattern.

Abstract: In a method and system for debugging a program, a debugging module is loaded into a normal thread of execution of the program. A user may then send commands to the debugger module from a command console module operating in a safe separate process. The debugger module receives the commands and converts them into function calls to objects that are accessible by the program. This allows the user to interact manually with the objects and achieve substantially the same responses from the object as the program itself would have obtained during its normal execution. Thus the user can effectively debug the program without having to know the internal structure of any of its constituent objects.

Abstract: Identifying a transaction from a real time event stream having latency. A method of the invention receives events from the real time event stream where events define a plurality of transactions to be identified. Each of the transactions includes a first event and a second event; the first event has a first latency relative to the real time event stream and the second event has a second latency relative to the real time event stream. The first event is identified from the received real time event stream, and a time is record when the first event is received. The method determines a time period during which the second event occurs as a function of the first latency, the recorded time of the first event, and the second latency. The transaction having the first and second events is identified based on the determined time period of the second event.