Abstract: A journal optimizer in a computer database system with an adaptive journal mechanism. The adaptive journal mechanism dynamically adjusts adaptive parameters of the journal optimizer to optimize the journal based on one or more journal conditions to more efficiently utilize system resources. The adaptive parameters used to adapt the optimization include aggressiveness parameters and the location of the optimizer, where the aggressiveness parameters specify the intensity of optimization of the journal by the journal optimizer. For example, the adaptive journal mechanism may dynamically adjust an adaptive parameter of the optimizer to increase optimization of the journal when the resource utilization indicates the resources are underutilized and decrease optimization of the journal when the resource utilization indicates resources are strained.

Abstract: A structured query language (SQL) query is configured to present a selected portion of a result set to a user interface. The selected portion of the result set can be based on an offset criteria appended to the SQL query. The offset criteria determines a location of a first presented instance of the selected portion of the result set. The offset criteria is configured to determine the location of the first presented instance of the selected portion of the result set independent of a number of instances appearing between a first instance of the result set and the first presented instance of the selected portion of the result set.

Abstract: A stream application receives a stream of tuples to be processed by a plurality of processing elements operating on one or more compute nodes. Each processing element has one or more stream operators. The stream application assigns one or more processing cycles to one or more segments of software code. The segments of software code are embedded in one or more tuples of the stream of tuples. The stream application determines that a condition is met based on the processing cycles. The stream application performs an operation based on the processing cycles.

Abstract: Aspects include obtaining a pattern that describes an event in a natural language format. The pattern that describes the event is converted into at least one identified pattern key value pair. A database transaction is monitored and converted into a least one database transaction key value pair. A similarity score is calculated by scoring similarities between the identified pattern key value pair(s) and the database transaction key value pair(s). Based on similarity score meeting a threshold, an alert is output to indicate that the database transaction matches the pattern that describes the event.

Abstract: A virtual machine data handling system includes a data handling system, a hypervisor, and a dynamically deployed virtual machine. The data handling system includes a plurality of physical computing resources (e.g., a processor and a memory). The hypervisor is implemented by the processor and the memory and deploys virtual machines from a master image. The dynamically deployed virtual machine is initially deployed by the hypervisor as a Linked Clone of the master image. The dynamically deployed virtual machine is subsequently dynamically deployed by the hypervisor copying a plurality of virtual memory segments from the master image until the dynamically deployed virtual machine is an independent Full Clone of the master image. The hypervisor may copy the plurality of virtual memory segments from the master image if at least one of the physical resources is operating below a utilization threshold.

Abstract: Systems, methods, and computer program products to perform an operation comprising receiving, by a database management system (DBMS) from an application, a request specifying to generate a global temporary table (GTT) of a first format, identifying a first GTT, of a plurality of GTTs stored by the DBMS, that has a second format, different than the first format, modifying the first GTT such that at least a portion of the modified first GTT is of the first format, and providing the modified first GTT to the application.

Abstract: A structured query language (SQL) query is configured to present a selected portion of a result set to a user interface. The selected portion of the result set can be based on an offset criteria appended to the SQL query. The offset criteria determines a location of a first presented instance of the selected portion of the result set. The offset criteria is configured to determine the location of the first presented instance of the selected portion of the result set independent of a number of instances appearing between a first instance of the result set and the first presented instance of the selected portion of the result set.

Abstract: Embodiments presented herein describe techniques for tracking operators of a distributed computing environment (e.g., a streams processing environment) using metadata. During execution of a distributed application of the computing environment, a tracker tool monitors a plurality of operators of the distributed application. Each of the operators stores one or more specified metadata values associated with the operator. For each operator, the tracker tool retrieves the one or more specified metadata values associated with the operator. Upon determining that one of the one or more specified metadata values do not comply with a corresponding expected metadata value, the tracker tool generates an indicator for the operator. The indicator includes information describing the one or more specified metadata values.

Abstract: A method, system, and computer program product to manage a database is disclosed. The method, system, and computer program product may include structuring the database to have a first table having an index and a second table. A first key of the first table may be related to a second key of the second table. The method, system, and computer program product may include creating an entry locator in the index. The method, system, and computer program product may include maintaining an association between the second key of the second table and the entry locator of the index.

Abstract: Aggregating database entry modifications for replay of database changes includes: inserting, in a journal modification table, of database entry modifications, where each database entry is associated with a relative record number; and, for each relative record number: aggregating, in the journal modification table, a plurality of the modifications into a single modification.

Abstract: A method, system, and computer program product to manage a database is disclosed. The method, system, and computer program product may include structuring the database to have a first table having an index and a second table. A first key of the first table may be related to a second key of the second table. The method, system, and computer program product may include creating an entry locator in the index. The method, system, and computer program product may include maintaining an association between the second key of the second table and the entry locator of the index.

Abstract: Aggregating database entry modifications for replay of database changes includes: inserting, in a journal modification table, of database entry modifications, where each database entry is associated with a relative record number; and, for each relative record number: aggregating, in the journal modification table, a plurality of the modifications into a single modification.

Abstract: Each of one or more commit cycles may be associated with a predicted number of updates. A statistics collection time for a database table can be determined by estimating a sum of predicted updates included in one or more commit cycles. Whether the estimated sum of predicted updates is greater than a first threshold may be determined. In addition, a progress point for a first one of the commit cycles can be determined. A time to collect statistics may be selected based on the progress point of the first commit cycle.

Abstract: Each of one or more commit cycles may be associated with a predicted number of updates. A statistics collection time for a database table can be determined by estimating a sum of predicted updates included in one or more commit cycles. Whether the estimated sum of predicted updates is greater than a first threshold may be determined. In addition, a progress point for a first one of the commit cycles can be determined. A time to collect statistics may be selected based on the progress point of the first commit cycle.

Abstract: Techniques are described for re-starting queries based on an expected amount of data to be changed in a database. Embodiments of the present disclosure may generally receive a first query to be executed against a database, and start execution of the first query against the database according to a first access plan. Upon detecting, during execution of the first query, that an amount of data to be changed in one or more tables of the database as a result of a second query satisfies a predetermined condition, embodiments of the present disclosure determine whether to re-start execution of the first query against the database with a second access plan different from the first access plan or wait a predetermined period of time before re-starting execution of the first query against the database with the first access plan.

Abstract: A system for autonomously testing a computing system is disclosed. The system parses data obtained from a variety of sources, and extracts source concepts from the parsed data to generate models for inclusion in a set of agglomerated models. The system interacts with and explores features of a software application being tested by the system. Outputs and information obtained from the interaction are utilized by the system to update the models or generate new models for the set of agglomerated models. The agglomerated models are utilized by the system to execute tests on the application to detect potential defects and conflicts. Detected defects and conflicts may be included in a report for review. Feedback on the defects and conflicts may be utilized to further update the agglomerated models. The agglomerated models are updated recursively as additional data is obtained, further interactions are performed, and further outputs are generated over time.

Abstract: A method, system and computer program product are provided for reorganizing a database table according to a set of queries. More specifically, the table is reorganized such that random I/O is reduced by more tightly grouping together rows in the table associated with each of the referencing queries. This enables more associated rows from a given table relevant to a query to be read into memory for a given I/O operation.

Abstract: A simulation mechanism manages deployment of a simplified computing solution (SCS) and a corresponding simulation model that simulates a scaled multiple of the SCS to allow a deployment configuration for a large scale computing solution to be determined and tested before actually deploying the large scale computing solution.

Abstract: Each of one or more commit cycles may be associated with a predicted number of updates. A statistics collection time for a database table can be determined by estimating a sum of predicted updates included in one or more commit cycles. Whether the estimated sum of predicted updates is greater than a first threshold may be determined. In addition, a progress point for a first one of the commit cycles can be determined. A time to collect statistics may be selected based on the progress point of the first commit cycle.

Abstract: Each of one or more commit cycles may be associated with a predicted number of updates. A statistics collection time for a database table can be determined by estimating a sum of predicted updates included in one or more commit cycles. Whether the estimated sum of predicted updates is greater than a first threshold may be determined. In addition, a progress point for a first one of the commit cycles can be determined. A time to collect statistics may be selected based on the progress point of the first commit cycle.