Abstract: A method, a system and a computer program for parallel event processing in an event processing network (EPN) are disclosed. The EPN has at least one event processing agent (EPA). The method includes assigning an execution mode for the at least one EPA, the execution mode including a concurrent mode and a sequential mode. The execution mode for the at least one EPA is stored in the EPN metadata. The method also includes loading and initializing the EPN. The method further includes routing the event in the EPN and, when an EPA is encountered, depending on the execution mode of the encountered EPA, further processing of the event. Also disclosed are a system and a computer program for parallel event processing in an event processing network (EPN).

Abstract: A method, a system and a computer program for parallel event processing in an event processing network (EPN) are disclosed. The EPN has at least one event processing agent (EPA). The method includes assigning an execution mode for the at least one EPA, the execution mode including a concurrent mode and a sequential mode. The execution mode for the at least one EPA is stored in the EPN metadata. The method also includes loading and initializing the EPN. The method further includes routing the event in the EPN and, when an EPA is encountered, depending on the execution mode of the encountered EPA, further processing of the event. Also disclosed are a system and a computer program for parallel event processing in an event processing network (EPN).

Abstract: A batch of data records generated by at least one application for persistent storage is cached by a cache management device. At least one of the batch of data records includes at least one foreign key reference that each references one non-existent data record. It is determined that one of a group of batch database storage events has occurred. In response to one of the group of batch database storage events, it is iteratively determined which of the at least one of the batch of data records do not include the at least one foreign key reference that each references the one non-existent data record. Each of the cached batch of data records that do not include the at least one foreign key reference that each references the one non-existent data record is persisted to a database by a batch storage operation.

Abstract: A batch of data records generated by at least one application for persistent storage is cached by a cache management device. At least one of the batch of data records includes at least one foreign key reference that each references one non-existent data record. It is determined that one of a group of batch database storage events has occurred. In response to one of the group of batch database storage events, it is iteratively determined which of the at least one of the batch of data records do not include the at least one foreign key reference that each references the one non-existent data record. Each of the cached batch of data records that do not include the at least one foreign key reference that each references the one non-existent data record is persisted to a database by a batch storage operation.

Abstract: A hybrid event processing network (EPN) having at least one event processing agent (EPA) consists of a first set of EPAs defined declaratively and a second set of EPAs defined dynamically at runtime via an interface. Deploying the hybrid EPN includes loading the hybrid EPN, constructing an EPN structure, and creating indexes of nodes of the EPN structure. Deploying the hybrid EPN further includes representing an event in a hybrid EPN, and, in response to the event occurrence at an event source, receiving a notification from the hybrid EPN based on the event, and publishing the notification in an event channel. Embodiments of the invention includes propagating the event received within the hybrid EPN, determining a subsequent EPA associated with the event within the hybrid EPN, and propagating the event to the subsequent EPA in the hybrid EPN until the last element of the hybrid EPN is reached.

Abstract: A method, a system and a computer program for parallel event processing in an event processing network (EPN) are disclosed. The EPN has at least one event processing agent (EPA). The method includes assigning an execution mode for the at least one EPA, the execution mode including a concurrent mode and a sequential mode. The execution mode for the at least one EPA is stored in the EPN metadata. The method also includes loading and initializing the EPN. The method further includes routing the event in the EPN and, when an EPA is encountered, depending on the execution mode of the encountered EPA, further processing of the event. Also disclosed are a system and a computer program for parallel event processing in an event processing network (EPN).

Abstract: A method is disclosed for indexing and querying XML documents stored in a relational database. A user is allowed to choose columns of a database table for storing XML data of a known structure. The user has to input one or more XML paths for indexed data. Each path is stored in a static index table. In response to the input of the user defined paths, at least one dynamic index table is created for each static index table. The dynamic index table is updated upon data being entered into the database table. When a user's query is intercepted, any XML expression part of the query is processed and converted into one or more rows in the static index table. A new query is generated against the dynamic indexing tables, using the values obtained from the static index table, and executed. The user's query is then rewritten by transforming the XML path part of the user's query expression into a format understood by the database query engine.

Abstract: A method is disclosed for indexing and querying XML documents stored in a relational database. A user is allowed to choose columns of a database table for storing XML data of a known structure. The user has to input one or more XML paths for indexed data. Each path is stored in a static index table. In response to the input of the user defined paths, at least one dynamic index table is created for each static index table. The dynamic index table is updated upon data being entered into the database table. When a user's query is intercepted, any XML expression part of the query is processed and converted into one or more rows in the static index table. A new query is generated against the dynamic indexing tables, using the values obtained from the static index table, and executed. The user's query is then rewritten by transforming the XML path part of the user's query expression into a format understood by the database query engine.