Abstract: Embodiments are disclosed for a method. The method includes determining demand resource for a batch jobs using a resource machine learning model trained to determine a cloud resource that the batch jobs use more than other resources during execution. The method further includes generating resource estimates for the demand resources. Additionally, the method includes determining a batch rating for a batch run using a batch rating machine learning model that is trained to generate a batch rating number based on features representing a priority of the batch run in reference to parallel execution batch runs. The method also includes generating a purchase recommendation for execution of the batch run on a cloud platform based on the resource estimates and the batch rating.

Abstract: In an approach for improving performance of a batch job running on database servers in an active-active architecture. A processor, responsive to a batch job being ready to be executed on a source database server, sends a first communication to a target database server with a synchronization start point. While executing the batch job, a processor utilizes a pre-lock function, pre-load function, and lock avoidance function to prevent lock conflicts. A processor, responsive to either the source database server or the target database server encountering a commit statement, suspends the respective database server and sends a second communication to ask if the other respective database server is ready to complete the commit statement. A processor, responsive to the other respective database server confirming its ready to complete the commit statement, completes the commit statement on both the source database server and the target database server.

Abstract: Embodiments of the present disclosure relate to process management. In an embodiment, a computer-implemented method is disclosed. The method comprises identifying a theme of a process based on a set of communication information. The set of communication information is generated corresponding to performing the process. The method further comprises determining a plurality of roles in the process at least partly based on the set of communication information. The plurality of roles performs respective actions during performing the process. The method further comprises generating a framework of the process based on the theme and the plurality of roles. The framework comprises one or more branches. In other embodiments, a system and a computer program product are disclosed.

Abstract: A database-management system (DBMS) dynamically adjusts the logical and physical partitioning of data stored in database tables. An artificially intelligent DBMS partition manager draws expert inferences from the DBMS's current workload, execution logs, and data statistics, in order to identify ranges of database key values that are frequently accessed by incoming queries. The ranges are allocated to logical partitions that are then mapped to physical partitions, such that database records identified by a pair of subranges are stored in proximate areas of physical storage. This partitioning reduces the number of physical-storage accesses by populating each physical partition with records likely to be accessed together.

Abstract: Building and using multiple different types of sub-indices to search a database is provided. A plurality of different physical data ranges is generated within the database based on a set of logical hot data ranges and a set of logical non-hot data ranges to form a set of physical hot data ranges and a set of physical non-hot data ranges. A set of sub-index types is built for each respective data range of the plurality of different physical data ranges within the database using a set of selected high-speed sub-index types for the set of physical hot data ranges and another set of selected sub-index types for the set of physical non-hot data ranges to accelerate data availability for query. An index is built for the database using the set of sub-index types built for each respective data range of the plurality of different physical data ranges within the database.

Abstract: A database query processor includes a database join prefetcher that prefetches N next join column values in order to execute the query more efficiently. The prefetched next join column values for an inner table are used to skip rows in an outer table, thereby increasing the performance of executing the query. The number N of prefetches can be dynamically determined and adjusted to improve the performance of executing the query.

Abstract: In an approach for database self-diagnosis and self-healing, a processor receives a problem description related to a database. A processor classifies the problem description into a natural language description portion and a database-know-who content portion. A processor processes the natural language description portion using natural language processing techniques. A processor evaluates the database-know-who content portion. A processor combines a result of processing the natural language description portion and evaluating the database-know-who content portion. A processor identifies a solution based on the problem description and the combined result. A processor solves a problem using the identified solution.

Abstract: A computer-implemented method that includes managing a buffer pool of pages into a ring sub-chain comprising pages linked in a ring, and a linear sub-chain comprising pages linked in a line from a header, and moving a page between the linear sub-chain and the ring sub-chain based on a moving schema evaluating a chain management characteristic.

Abstract: A computer-implemented method that includes receiving an ingestion request to ingest data to a database comprising physical shards and detecting that the ingestion request is directed to a first hotspot shard. The first hotspot shard has a contention level over a threshold value. The method also detects context characteristics within the data and generates a first virtual shard based on a first virtual shard key selected from the detected context characteristics. The first virtual shard virtually duplicates at least a portion of the first hotspot shard. The method also includes ingesting the data to the first virtual shard.

Abstract: A method, system, and computer program product to plan and schedule executions of various utility tasks of a utility command during a maintain window, the method including receiving a utility command. The method may also include identifying possible utility tasks used to execute the utility command. The method may also include determining preferred utility tasks. The method may also include calculating a degree of parallelism for the preferred utility tasks. The method may also include generating a utility execution plan for the utility command. The method may also include analyzing the utility execution plan against resource constraints of a time window and sub time windows of the time window. The method may also include generating a time window execution plan for each sub time window of the sub time windows. The method may also include updating the utility execution plan with the time window execution plans.

Abstract: Embodiments of the present disclosure relate to an approach for database query. According to the approach, a query for a group of data records is received. At least one index is created on at least one field of the data records and comprises index entries for storing and sorting respective values of the at least one field of the data records. It is determined if the query satisfies a predetermined condition. In response to the query satisfying the predetermined condition, a result of the query is determined by skipping at least a part of operations required by the query based on the at least one index.

Abstract: A system, computer program product, and method are provided for driving database reorganizations subject to determined workloads, and, more specifically, to providing an online partial reorganization of a database to improve workload performance. The method includes collecting performance information for one or more performance sensitive workloads associated with one or more portions of a database and analyzing the collected performance information. For each of the one or more performance sensitive workloads, indications of performance declines thereof are determined. Subject to the determined performance declines, at least one of the one or more database portions affected by the determined performance declines are determined. Subject to the database portions determination, the determined performance declines are classified. Subject to the classification of the performance declines, one or more partial reorganizations of the one or more database portions is executed.

Abstract: A computer-implemented method dynamically detects and corrects an error in a query. The method includes identifying an error in a first query. The method further includes generating a set of alternate execution structures for the first query. The method includes running each of the alternate execution structures, including generating a set of results corresponding to each set of alternate execution structure, comparing each of the set of results against each other of the set of results, and storing each of the set of alternate execution structures to include a result of the set of results, for each alternate structure. The method further includes selecting, from the set of alternate execution structures, a first alternate execution structure based on a predetermined criteria, and implementing the first alternate structure in place of the first query.

Abstract: In an approach, a processor obtains a plurality of security policies for managing security of a database, the security policies defining respective sets of items to be monitored. A processor stores, respectively, the sets of items defined by the plurality of security policies in one or more item tables based on a predetermined criterion, the predetermined criterion comprising security policy relevance, security policy structure, and available space in the one or more item tables. A processor creates, for each of the one or more item tables, one or more respective index tables associated with the items in the respective item table. A processor creates, for each of the one or more item tables, a fast traverse block (FTB) associated with the created one or more respective index tables.

Abstract: One or more computer processors match a query pattern to a received query; context information related to the received query; retrieve a set of query records including the same context information as the obtained context information from an index knowledge base, wherein each query record in the set of query records include context information related to a respective history query, the query pattern, an index type associated with the query pattern, and performance information relating to the query pattern and the index type; determine that a subset of the retrieved query records includes one or more query patterns equivalent to the matched query pattern; select a query pattern and an associated index type from the subset of query records based on associated performance information in the set of query records; and perform the received query by applying the selected query pattern and the associated index type.

Abstract: A data structure associated with a sparse index is determined to include a plurality of redundant keys with at least one set of duplicate keys. The at least one set of duplicate keys is ranked, according to a set of criteria. According to the ranking, a first set of duplicate keys from the at least one set is selected. In place of the first set, a first guard node is inserted. The first guard node includes a first key value identical to the first set of duplicate keys and is linked to a first set of field nodes representing a first set of field values associated with the first set of duplicate keys.

Abstract: A computer-implemented method to inject security semantics into database queries. The method includes receiving, by a database system, a query, wherein the query is received from a host and the query is generated by a first user account. The method also includes, generating an access plan for the query. The method further includes, determining a first portion of the access plan matches a first security syntax. The method includes, injecting, in response to determining the first portion of the access plan matches the first security syntax, the first security syntax into the access plan. The method further includes, executing the query. The method includes, returning a set of results of the query to the host.

Abstract: A method, system, and computer program product for abnormal data detection. According to the method, a plurality of data points collected at different time points are classified into a plurality of groups. A plurality of groups of potential abnormal data points are determined from the plurality of groups. Correlations between a first group of the plurality of groups of potential abnormal data points with other groups of potential abnormal data points are determined. In response to the first group of the plurality of groups of potential abnormal data points being uncorrelated to a majority of the other groups of potential abnormal data points based on the correlations, data points in the first group are identified as abnormal data points.

Abstract: Embodiments of the present invention relate to a method, system, and computer program product for multiplexing data operation. In some embodiments, a method is disclosed. A query for at least one table comprising a plurality of data records is received. The query indicating a plurality of data operations to be performed on the plurality of data records. The plurality of data operations are combined into a target data operation. An intermediate result of the query is generated by performing the target data operation on the plurality of data records. A final result of the query is determined based on the intermediate result. In other embodiments, a system and a computer program product are disclosed.

Abstract: A computer-implemented method for managing an index table associated with a data table includes obtaining an index entry associated with a key in the data table. The computer-implemented method further includes determining whether an index page associated with the index entry is in a buffer pool, wherein the buffer pool includes a plurality of index pages loaded from the index table and at least one temp index. The computer-implemented method further includes adding, in response to determining that the index page associated with the index entry is not in the buffer pool, the index entry into the at least one temp index. The computer-implemented method further includes consolidating the at least one temp index into the index table.