Abstract: A method, system, and computer program product for event detection using roles and relationships of entities are provided in the illustrative embodiments. A training event and a set of entities participating in the training event are identified in a training data. For a first entity in the set of entities, a first role occupied by the entity in the event is determined. A behavior attribute is assigned to the first role. A relationship of the first role with a second role corresponding to a second entity in the set of entities is determined. An event rule is constructed to detect an event corresponding to the training event in new data and comprising a plurality of roles, behavior attributes, and the relationship. The plurality of roles includes the first role and the second role, and the plurality of behavior attributes includes the behavior attribute assigned to the first role.

Abstract: A method, system, and computer program product for event detection using roles and relationships of entities are provided in the illustrative embodiments. A training event and a set of entities participating in the training event are identified in a training data. For a first entity in the set of entities, a first role occupied by the entity in the event is determined. A behavior attribute is assigned to the first role. A relationship of the first role with a second role corresponding to a second entity in the set of entities is determined. An event rule is constructed to detect an event corresponding to the training event in new data and comprising a plurality of roles, behavior attributes, and the relationship. The plurality of roles includes the first role and the second role, and the plurality of behavior attributes includes the behavior attribute assigned to the first role.

Abstract: Embodiments of the invention relate to a multi-level database compression technique to compress table data objects stored in pages. A compact dictionary structure is encoded that represents frequent values of data at any level of granularity. More than one level of compression is provided, wherein input to a finer level of granularity is an output of a coarser level of granularity. Based upon the encoded dictionary structure, a compression technique is applied to a stored page to compress each row on the page. Similarly, a de-compression technique may be applied to decompress the compressed data, utilizing the same dictionary structures at each level of granularity.

Abstract: Embodiments of the invention relate to a multi-level database compression technique to compress table data objects stored in pages. A compact dictionary structure is encoded that represents frequent values of data at any level of granularity. More than one level of compression is provided, wherein input to a finer level of granularity is an output of a coarser level of granularity. Based upon the encoded dictionary structure, a compression technique is applied to a stored page to compress each row on the page. Similarly, a de-compression technique may be applied to decompress the compressed data, utilizing the same dictionary structures at each level of granularity.

Abstract: Techniques are provided for enabling execution of a process employing a cache Method steps can include obtaining a first probability of accessing a given artifact in a state Si, obtaining a second probability of using a predicate from a current state Sc in the state Si, determining a benefit of prefetching the given artifact using the predicate based on at least the first probability and the second probability, and whether and/or when a cache replacement should be conducted, based at least on the benefit determined.

Abstract: Techniques are provided for enabling execution of a process employing a cache Method steps can include obtaining a first probability of accessing a given artifact in a state Si, obtaining a second probability of using a predicate from a current state Sc in the state Si, determining a benefit of prefetching the given artifact using the predicate based on at least the first probability and the second probability, and whether and/or when a cache replacement should be conducted, based at least on the benefit determined.

Abstract: A method for providing ontology management that leaves existing instance data stored in a relational database, while virtualizing the existing instance data for accesses originating from an ontology application, wherein the method includes: submitting an ontology application query to an ontology management system; rewriting the ontology application query with a mapping module into a vertical format mapped query; submitting the vertical format mapped query and view definitions to a database query processor; retrieving relevant existing instance data from the relational database in response to request from the database query processor; and virtualizing the retrieved relevant existing instance data for use by the ontology application.