International Business Machines Corporation

Sheng Yan Sun

Shuo Li

Xiaobo Wang

Hong Mei Zhang

Peng Hui Jiang

Meng Wan

Xin Peng Liu

Xiao Xiao Chen

Leilei Li

Jun Su

Hao Feng

Xu Zhao

Hua Wang

Jian Xu

Jing Wang

Xiao Ming Ma

Min Li

Li Cao

Jia Tian Zhong

Yue Wang

Xue Ying Zhang

Jun Li Wang

Jie Ling

Xing Xing Jing

Yu Wang

Ming Wang

Xin Yang

Yi Huang

Yi Bu Li

Bing Jiang Sun

June-Ray Lin

Si Er Han

He Fang Zhang

Xing Xing Shen

Zhi Li Guan

Chun Lei Xu

Shan Jiang

Xiao Feng Meng

Shidong Shan

Ping Wang

Rui Wang

Yan Ma

Frances Hwa Villafuerte

Yue Cui Li

Yu Huang

Akiko Hoshikawa

Xue Bo

Xiao Hui Wang

Ye Tao

Kun Yang

Hao H H Feng

Mei Cai Zeng

Shuo B J Li

Jun Wang

Xuelian Zhang

Ting Ting Wang

Systems and methods are provided to predict connection configurations in a distributed database environment. In embodiments, a method includes: building, by a computing device, a dynamic machine learning predictive model for a first new node connection in a distributed database environment based on configuration data of the first new node connection; determining, by the computing device, a group of nodes in the distributed database environment of a same type of node as the new node connection; federating, by the computing device, the dynamic machine learning predictive model of the first new node connection with other dynamic machine learning predictive models of other nodes in the group of nodes, thereby generating a federated predictive model for the same type of node; and generating, by the computing device, a predicted connection configuration for a second new node connection of the same type of node using the federated predictive model.

Database resource management using predictive models

A computer-implemented method to generate and utilize a hybrid index. The method includes receiving a first query, where the first query is configured to perform a first command. The method further includes generating a hybrid index, where the hybrid index defines a connection between a first table and a second table of a set of tables. The method also includes executing the first query using the hybrid index. The method includes returning a set of results for the first query to a source of the query.

Building cross table index in relational database

A method, computer system, and a computer program product for risk analysis is provided. The present invention may include receiving an access request. The present invention may include analyzing a matrix barcode associated with the access request. The present invention may include validating the matrix barcode. The present invention may include providing a validation status to a user.

Analyzing QR code risk

A method includes receiving, by a computing device, a first transaction from a user device for a first version of a database record; generating, by the computing device, a bit for the database record; receiving, by the computing device, a second transaction from a second user device for a second version of the database record; locking, by the computing device, the database record; determining, by the computing device, a modification between the first version of the database record and the second version of the database record; and updating, by the computing device, the bit in response to the modification.

Database record bit

In several aspects, a computing device analyzes data to determine its characteristics. The computing device selects at least one compression process based on the characteristics. A compression switch and a compression level are dynamically adjusted based on multiple factors including available system resources, desired storage savings and performance requirement. The compression level dynamically varies depending on the data being processed and a workload on a system. Performance of compression and decompression operations are continuously monitored for dynamically adjusting compression parameters to optimize performance.

Adaptive compression/decompression in distributed database application

A system, method, and computer program product are configured to: provide a tablespace comprising an original partition having a lower boundary L, an upper boundary U, a split percentage P, and a split ratio R; and in response to the original partition reaching a fullness of P, automatically split the original partition to a first progeny partition and a second progeny partition, wherein the first progeny partition has a lower boundary Lthat is the same as the lower boundary L of the original partition and an upper boundary Uthat is determined based on whether the insert is a sequential or random insert, and wherein the second progeny partition has an upper boundaries Uthat is the same as the upper boundary U of the original partition and a lower boundary Lthat is determined based on whether the insert is a sequential or random insert.

Self-maintained tablespace

Managing database operations is provided. The method comprises receiving an insert statement for a database and determining if the insert statement is for a batch insert operation or random insert operation. For a batch insert operation, responsive to determining a threshold number of specified leaf pages are missing from a memory buffer pool of the database, the database asynchronously pre-loads missing leaf pages from a corresponding index on disk into the memory buffer pool. For a random insert operation, responsive to determining a threshold number of specified leaf pages are missing from a memory buffer pool of the database, the database builds at least one memory cache index and inserts key values specified in the insert statement in the memory cache index. The memory cache index is merged with a corresponding index on disk.

Database index performance improvement

A computer-implemented method improves the performance of write ahead logging. The method includes generating a set of query data and a set of log data, where the set of log data is configured to create a write ahead log, and the set of query data is configured to make changes to data in a database. The method also includes writing the set of query data to a virtual file system. The method further includes separating the set of log data into a set of control intervals, where each control interval includes an entry. The method includes writing, each entry into a log buffer, where the writing the set of query data to the virtual file system and the writing each entry into the log buffer are performed in parallel. The method also includes combining each entry into a complete log.

Database log performance

A computer implemented method manages a location of database object descriptions in a storage, the computer implemented method. A number of processor units identifies a set of workload groups that are coming up for execution. The number of processor units loads the database object descriptions for the set of workload groups into a highest performance storage in a storage system. The number of processor units manages the location of the database object descriptions in the storage system based on access to database objects by set of workload groups.

Dynamic database object description adjustment

A computer implemented method for managing buffer pool usage includes identifying a database comprising one or more buffer pools and a set of database objects, adding a virtual layer between the set of database objects and the one or more buffer pools, wherein the virtual layer is configured to manage buffer pool resource utilization, managing, using the added virtual layer, buffer pool resource utilization with respect to the set of database objects, wherein the managing comprises defining buffer pool usage corresponding to the set of database objects, dynamically mapping database objects to the buffer pools based, at least in part, on the defined buffer pool usage, analyzing, by one or more processors, queues to identify updated buffer pool usage, and adjusting database object allocation according to the identified updated resource usage. A computer program product and computer system corresponding to the method are also disclosed.

Buffer pool resource allocation

A system collects statistical data for a data page, divides the data page into parts, analyzes the data page and the statistical data, based on compression efficiency of one or more compression methods for each part of each page, to determine a compression method for each part of page, and compresses, based on the analyzing, the parts of the data page.

Partitional data compression

Computer implemented methods, systems, and computer program products include program code executing on a processor(s) to: obtain queries (each query including workload(s)); obtain execution statistics for the one or more workloads; normalize one or more queries. Normalizing includes generating cost analytics, identifying similar cost analytics for query blocks across the queries, and applying a cost model to identify at least one query block for result reuse across. The program code distributes the queries to system resources by assigning the at least one query block (in more than one query/workload) to a first resource to execute (as part of a first workload) against database tables and assigning the at least one query block to a second resource to execute (as part of a first workload) against a shared cache of a heterogenous database system.

Workload performance improvement on heterogeneous systems

Computer implemented methods, systems, and computer program products include program code executing on a processor(s) obtains queries from sources via a query interface. The program code analyzes the queries to obtain attributes of the queries. The program code applies a trained classifier to the attributes to classify the queries into finite categories based on a predicted usage of a given resource type exceeding a pre-determined threshold and an anticipated execution duration for each query. The program code determines, based on the finite categories of the one or more queries and resource configurations of resources comprising the database service, which resource of the resources can efficiently execute each query of the one or more queries. The program code schedules each query of the one or more queries for execution by the determined resources.

High-performance resource and job scheduling

A method for improving a query performance of a query of a database application using rewrite includes introducing a database query into a database application to obtain a query result, analyzing the database query to identify index columns and a predicate column; identifying associated columns by determining if any associations exist between the index columns and the predicate column, calculating a confidence score value for each of the associated columns responsive to the associated columns and the predicate column, generating a list of associated columns with the confidence score values, generating a rewritten query by rewriting the database query based on the list of associated columns and the confidence score values and validating the rewritten query.

Query performance improvement of a query for a database application using rewrite

Embodiments analyze an incoming query for a database, train a query model using machine learning based on the analyzing of the incoming query, determine a model result based on the trained query model; extract a similar information query based on the model result, generate a recommendation for query tuning and a visual impact of the recommendation for the query tuning based on the extracting of the similar information query, and output the recommendation for the query turning and the visual impact of the recommendation for the query tuning.

Recommendations for changes in database query performance

Growing community of inventors

Beijing, China

Sheng Yan Sun