Abstract: A computer-implemented method provides application-based query transformations. The method includes determining an application is initiated. The method includes identifying a set of execution units included in the application. The execution units are based on of a set of queries in the application and a set of actions in the application. The method also includes building a query dependency graph (QDG) comprising a plurality of nodes, wherein each node of the plurality of nodes is correlated to an execution unit, and each node is linked to at least one additional node, the link indicating a relative execution order and a common attribute each node and the additional node. The method includes merging, based on a performance architecture, two or more of the set of execution units into a section. The method includes processing the application according to the QDG.

Abstract: An approach is provided for optimizing a database buffer pool. Based on statistics about read and write operations in a range of pages, the range of pages is determined to be a candidate for a hot read range for which locks and latches are avoided in processing operations in the hot read range. Using an on-time trigger or pre-trigger process, the hot read range is created from the range of pages by marking start and end points in the range of pages. Write operation(s) are determined to be included in the hot read range by marking an object control block. The write operation(s) are added to a write pending list. The read operations in the hot read range are performed without a latch or lock. The write operation(s) are merged from the write pending list to the range of pages and the write operation(s) are performed.

Abstract: An approach is provided for automatically updating a data type of a database column. Based on a database definition, category, and usage, the column is determined to be a candidate for a data type change. For first values in the column values, costs of processing queries using a new data type are determined to be less than other costs of processing the queries using other data types. For exception value(s) in the column values, costs of processing the queries using the original data type are determined to be less than other costs of processing the queries using other data types. The original data type is replaced with the new data type for the first values and the original data type is retained for the exception value(s). The first values are associated with a first schema and the exception value(s) are associated with a second schema.

Abstract: Query content-based data generation includes obtaining a query having an outer query and one or more subqueries, converting predicates of a subquery to be predicates of the outer query, and thereby obtain a transformed query, generate from the transformed query a query block having a list of predicate(s) selected from the transformed query, obtaining column information based on the list of predicate(s) and using the column information to select data for a dataset such that data records from the dataset are produced as results to executing the obtained query against the dataset.

Abstract: Database recovery is based on workload priorities. A database workload is divided into a plurality of workload groups. A workload group of the plurality of workload groups is selected for recovery, in which the selecting is based on a priority of the workload group. One or more recovery actions are performed for the workload group selected for recovery.

Abstract: Systems and methods for pre-allocating and utilizing storage space in a relational database are provided. In embodiments a method includes: obtaining transaction data including data regarding record insertions in a relational database, wherein each record of the record insertions is associated with a key value; identifying a type of each of the record insertions as either a random insertion type or a key range insertion type based on the database transaction data, wherein the random insertion type comprises records associated with respective key values inserted in a random order, and the key range insert type comprises records associated with a range of key values inserted within a certain time period; predicting a new range of key values associated with future record insertions based on the type of each of the record insertions; and pre-allocating page space in one or more pages of the relational database for the future record insertions.

Abstract: A simulated dataset is queried for regression by validating a structured query language (SQL) statement, determining a pattern type of the SQL statement, reconstructing the SQL statement according to a predetermined process for the pattern type, creating a mutated SQL statement for querying a simulated dataset, and validating the mutated SQL statement. The simulated dataset is based on a confidential dataset having the confidential elements removed or replaced.

Abstract: In a computer-implemented method for improving performance of a database optimizer, a processor calculates a first execution time for a database query executing through a first access path of a database system. A processor generates a second access path. A processor determines a second execution time via a simulation of the database query through the second access path. A processor determines that the second execution time is less than the first execution time. A processor, responsive to determining that the second execution time is less than the first execution time, sends the second access path to the database optimizer.

Abstract: A computer-implemented method selects an access path for high cost and/or complex queries. The method includes building a classification model configured to identify a lowest cost access path. The method further includes receiving a query, where the query is configured to retrieve a set of data from a database. The method also includes generating an access map for the query, where the access map includes one or more potential access paths to execute the query. The method includes collecting, for the query, a set of data for each potential access path. The method further includes classifying, by the classification model, the query. The method also includes selecting a first access path of the one or more potential access paths and executing the query.

Abstract: A method of managing a storage system comprises detecting a reference to a first page in the storage system. The method also comprises creating a first candidate block for the first page based on the detecting. The first candidate block may comprise a continuous series of pages that begins with the first page. The method also comprises monitoring subsequent references to pages within the first candidate block. The method also comprises determining that the first candidate block meets a first set of hot-block requirements. The method also comprises relocating the first candidate block to a hot-block space in a buffer pool based on the determining, resulting in a first hot block.

Abstract: Functional verification of a new database feature is provided. A set of SQL query seeds are evolved using information contained in a knowledge map that was generated based on a real SQL query workload of an entity corresponding to a database. Real SQL queries are identified in the database that are similar to the evolved set of sample SQL query seeds. A new feature to be implemented in the database is injected into the real SQL queries that are similar to the evolved set of sample SQL query seeds. Multiple runtime access paths are generated for each of the real SQL queries injected with the new feature for output cross validation. Each of the real SQL queries injected with the new feature is run in a test environment using each of the multiple runtime access paths corresponding to a real SQL query injected with the new feature for functional verification.

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: Query content-based data generation includes obtaining a query having an outer query and one or more subqueries, performing subquery transformation on each subquery, which converts predicates of the subqueries to be predicates of the outer query, and thereby obtain a transformed query, generate from the transformed query block(s) each having a list of predicates selected from the transformed query, processing each query block for column information, including column range information and column relationship information, and generating data and populating a dataset having table(s) and respective column(s) for each of the table(s). Generating the data uses the column range information and the column relationship information to select data for the dataset such that data records from the dataset are produced as results to executing the obtained query against the dataset.

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: 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: 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: 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 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: In an approach for database index optimization, a processor detects a pattern of characters and numeric digits of an index key. The index key provides an access to a database through an index access without a sorting operation. A processor determines a converting format based on the pattern of the index key. The pattern includes a string of the numeric digits. A processor converts the index key into a converted key by converting the string of the numeric digits into an integer. A processor saves the converted key into a storage.

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.