Abstract: Disclosed aspects relate to query plan management associated with a shared pool of configurable computing resources. A query, which relates to a set of data located on the shared pool of configurable computing resources, is detected. A virtual machine includes the set of data. With respect to the virtual machine, a set of burden values of performing a set of asset actions is determined. Based on the set of burden values, a query plan to access the set of data is established. Using at least one asset action of the set of asset actions, the query plan is processed.

Abstract: A query is received. Based on statistics for a database, a first query access plan is generated for executing the query on the database. A first result set for the query is obtained by implementing the first query access plan on the database. Based on at least one trend in the statistics, a target time after which implementing the first query access plan will fail a set of criteria is forecasted. In response to the forecasting and based on the statistics, a replacement query access plan is generated prior to the target time. After the target time, a second result set for the query is obtained by implementing the replacement query access plan rather than the first query access plan.

Abstract: Disclosed aspects relate to managing a stream computing environment. The stream computing environment may have a consistent region that includes a set of stream operators for processing a stream of tuples. An operator modification request with respect to the set of stream operators of the consistent region of the stream computing environment may be received. In response to receiving the operator modification request, a set of tuples of the stream of tuples may be detected in the consistent region. Using the operator modification request, a tuple adjustment action for the set of tuples of the stream of tuples in the consistent region may be determined. Based on the operator modification request, the set of stream operators may be modified. The set of tuples may be processed using the tuple adjustment action.

Abstract: A computer-implemented method for determining a query execution plan based on transaction state may include determining that a first set of database values in a database table are in a committed transaction state and that a second set of database values in the database table are in an uncommitted transaction state. In response to the determining, the first set of database values may have a first set of statistics generated and the second set of database values may have a second set of statistics generated. The first and second set of statistics may be for use in determining a query execution plan.

Abstract: Disclosed aspects relate to query plan management associated with a shared pool of configurable computing resources. A query, which relates to a set of data located on the shared pool of configurable computing resources, is detected. A virtual machine includes the set of data. With respect to the virtual machine, a set of burden values of performing a set of asset actions is determined. Based on the set of burden values, a query plan to access the set of data is established. Using at least one asset action of the set of asset actions, the query plan is processed.

Abstract: A system for autonomously delivering software features 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. Over time, additional data from the variety of sources may be utilized to update the set of agglomerated models. The updated agglomerated models may be analyzed by the system to determine whether new features and/or functionality may be added to an application under evaluation by the system. In the event that new features and/or functionality may be added to the application under evaluation, the system may automatically generate code corresponding to the new features and/or functionality and incorporate that features and/or functionality into the application under evaluation.

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 system for optimizing system resources and runtime during a testing procedure is disclosed. During operation, the system may perform hypothesis testing on an application under evaluation, such as performing hypothesis testing on suggested constraints for the application under evaluation, which may result in the creation of new hypotheses yielding improved confidences. This testing may be optimized by simplifying and/or reducing the number of hypothesis tests used during the testing process. To do so, the hypothesis tests may be sorted into sets, and a subset of these sorted hypothesis tests may be executed. Based on the results of this testing, a remaining portion of the hypothesis tests may be skipped, allowing for an optimization of the testing process without reducing the quality of the testing procedure.

Abstract: A stream application receives a stream of tuples to be processed by a plurality of processing elements. The 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 a tuple of the stream of tuples. The software-embedded tuple identifies a set of target tuples based upon operation criteria. The set of target tuples are a part of the stream of tuples. The software-embedded tuple performs an operation based on the set of identified target tuples.

Abstract: A system for providing intelligent part of speech processing of complex natural language is disclosed. The system identifies a multiword concept from an input and replaces the multiword concept with a token to be tagged as a desired part of speech. The system passes the modified text including the token to a part-of-speech tagger to tag each word in the text with the appropriate part-of-speech. The system may replace the token with the original text that the token was utilized to replace so that the original intent of the text is evident. The system may analyze the tagged text to generate analyses and interpretations associated with the input. When multiple multiword concepts are identified, the system may evaluate them by computing scores for each of the multiword concepts that may be replaced with tokens, for each of the modified texts including the tokens, or for any interpretations and analyses thereof.

Abstract: An index shared between a plurality of tables is used to access a data sharing space (DSS) storing a set of rows from a base table having a plurality of rows with stored data. First data values of the index are identified in response to a query for a table. A subset of rows is then retrieved from the DSS using the index elements corresponding to the first data values. Second data values and some of the first data values are then identified in response to a second query for a table. A second subset of rows are then retrieved from the DSS using the index elements corresponding to the second data values and some of the first data values and the query is then applied to the subset of rows.

Abstract: An appliance migration mechanism (AMM) optimizes migration of a live virtual appliance with virtual objects between cloud environments to minimize temporary connections that use significant cloud resources during the migration. The AMM determines a cost of connections of each virtual object in the virtual appliance and produces an order of migration for the virtual objects. The cost of connections of the virtual objects may be determined by the total number of connections and the maximum number of connections. Alternatively the cost of the connections of the virtual objects for migration could be determined by a weighting the costs of the connections where the weighting may consider loading or other factors on the connection.

Abstract: A computer system can generate a materialized query table (MQT) for data from a base table that has a plurality of rows and columns that each contain stored data. The computer system can receive a query to data stored in a row from the base table. The system can identify a column in the row and determine that data from a cell in the row and the column is above a threshold memory size. The system can generate, in response to determining that the data being above the threshold memory size, an MQT that includes data for the row and that includes a reference pointer that points to a location shared with another table.

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 stream application receives a stream of tuples to be processed by a plurality of processing elements. The plurality of processing elements operate on one or more compute nodes. Each processing element has one or more stream operators. Segments of software code are embedded in a tuple of the stream of tuples. The tuple retrieves one or more compute node metrics. The compute node metrics describe one or more resources of a first compute node. The tuple obtains tuple information of one or more tuples of the stream of tuples to be processed by a first stream operator that operates on the one or more resources. The tuple determines a prospective resource disparity related to the first stream operator based on the obtained tuple information and the compute node metrics. The tuple transmits a resource request to the stream application based on the determined prospective resource disparity.

Abstract: System, method, and computer program product to perform an operation comprising determining that a sort sequence of a query specifying to access data in a first column of a shared weight object based on a first selection predicate applied to the first column does not match a sort sequence of the shared weight object, adding a second selection predicate to the query based on the sort sequence of the first selection predicate and the shared weight sort sequence of the first column of the shared weight object, and executing the query by using the second selection predicate as a key selection against the first column in the shared weight object to return a result set, wherein the result set does not include a shared weight data value of a first row of the first column that would have been returned using the shared weight object to process the query.

Abstract: A method is provided for applying tasks. The method can include receiving a plurality of tasks for a plurality of applications, an application of the plurality of applications is hosted by a computing environment utilizing a monitoring agent, and a task is performed for an operation of the application during a first period of time. The method can also include determining a first resource type and a first resource amount from the computing environment for performing the task. The method can also include grouping the plurality of tasks into a set of tasks based on the first resource type, at least two tasks from the set of tasks being performable in parallel during the first period of time. The method can also include determining whether the first resource amount of the first resource type is present in the computing environment during the first period of time.

Abstract: A system for providing intelligent part of speech processing of complex natural language is disclosed. The system identifies a multiword concept from an input and replaces the multiword concept with a token to be tagged as a desired part of speech. The system passes the modified text including the token to a part-of-speech tagger to tag each word in the text with the appropriate part-of-speech. The system may replace the token with the original text that the token was utilized to replace so that the original intent of the text is evident. The system may analyze the tagged text to generate analyses and interpretations associated with the input. When multiple multiword concepts are identified, the system may evaluate them by computing scores for each of the multiword concepts that may be replaced with tokens, for each of the modified texts including the tokens, or for any interpretations and analyses thereof.

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 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.