International Business Machines Corporation

Other

Meng Wan

Shuo Li

Xiaobo Wang

Xin Yang

Sheng Yan Sun

Hong Mei Zhang

Peng Hui Jiang

Xin Peng Liu

Xiao Di Deng

Chen Xin Yu

Jun Su

Wei Liu

Li Hui Guo

Shu Hua Liu

Xiong Zhao

Chong Yuan Yin

Xian Feng Diao

Wang Liu

Xue Rui Hu

Mei Qin Si

Hong Yan Zhang

Su Liu

Si Bin Fan

Ke Wei Wei

ShengYan Sun

Ping Xiao

Xue Yong Zhang

Shanshan Dai

Shizhu Zhu

Kai Feng

Zhanfeng Ying

One or more computer processors generate a debug chain from one or more similar resource bound breakpoints, wherein the debug chain provides dynamic code flow. The one or more computer processors distribute the generated debug chain to one or more tenants.

Source code repository debug chaining

Described are techniques for predictive microservice activation. The techniques include training a machine learning model using a plurality of sequences of coordinates, where the plurality of sequences of coordinates are respectively based upon a corresponding plurality of series of vectors generated from historical usage data for an application and its associated microservices. The techniques further include inputting a new sequence of coordinates representing a series of application operations to the machine learning model. The techniques further include identifying a predicted microservice for future utilization based on an output vector generated by the machine learning model. The techniques further include activating the predicted microservice prior to the predicted microservice being called by the application.

Predictive microservices activation using machine learning

In an approach for smart test data workload generation, a processor receives a plurality of expected image frames for a user interface application to be tested. The plurality of expected image frames is pre-defined and represents a series of workflows and operations of the user interface application to be expected based on a design requirement. A processor calculates a first set of hash-values for each corresponding expected image frame. A processor samples the user interface application with a frequency to a plurality of testing image frames during a test run on the user interface application. A processor calculates a second set of hash-values for each sampled testing image frame. A processor compares the first set of hash-values to the second set of hash-values. A processor verifies that the second set of hash-values matches the first set of hash-values.

Smart test data workload generation

A computer-implemented method includes: collecting, by a computing device, database activities and database structure information of a database; identifying, by the computing device, related columns in the database; determining, by the computing device, one or more data types for column transference of the identified related columns; generating, by the computing device, a super union column based on the column transference and the identified related columns; and updating, by the computing device, the database with the super union column.

Database query management using a new column type

Provided are techniques for building and using a sparse Time Series Database (TSDB). Time series records are received from a native TSDB, where each of the time series records includes a timestamp and one or more tags. Timeslots are determined for shards for the sparse TSDB based on the timestamp included in each of the time series records. The sparse TSDB is built by creating the shards for the determined timeslots and storing the time series records in the shards, while filling in empty ranges in the shards. A query that specifies at least one of the one or more tags is received. It is determined whether to execute the query against the sparse TSDB, and, in response to a determination to execute the query against the sparse TSDB, the query is executed against the sparse TSDB to generate results that are returned.

Building and using a sparse time series database (TSDB)

An embodiment for analyzing and tracking data flow to determine proper schemas for unstructured data. The embodiment may automatically use a sidecar to collect schema discovery rules during conversion of raw data to unstructured data. The embodiment may automatically generate multiple schemas for different tenants using the collected schema discovery rules. The embodiment may automatically use ETL to export unstructured data to SQL databases with the generated multiple schemas for the different tenants. The embodiment may automatically monitor usage data of the SQL databases and collect the usage data. The embodiment may automatically optimize schema discovery using the collected usage data. The embodiment may automatically discover schemas with hot usage and apply the discovered schemas with hot usage to other tenants for consumption and further monitoring.

Heterogeneous schema discovery for unstructured data

A method, computer system, and a computer program product is provided for computer log management. In one embodiment, in response to receiving a log request from a user, an input content is analyzed and adjusted according to input contents and user's previous activities. A similarity analysis and a fairness analysis is performed to determine similarities between the input content, as adjusted, and a plurality of log records in an object library. The similarity analysis includes analyzing any patterns and attributes. The attributes have a dimension, and each dimension has a predefined weight (W). The fairness analysis ensures that one type of log is not favored over others. A best possible match is then determined, and one or more logs are presented to the user providing the best possible match.

Log content modeling

An embodiment includes generating a partition schema for a distributed database based on historical usage data indicative of usage of the distributed database, where the generating of the partition schema comprises determining a partition range of a partition of the partition schema. The embodiment also includes generating a node identifier for the partition using a hash function and a first weight value assigned to the partition. The embodiment also includes monitoring performance data indicative of a performance of the distributed database, the monitoring comprising detecting a failure of the performance to satisfy a performance threshold. The embodiment also includes initiating, responsive to detecting the failure, a redistribution procedure by changing the node identifier of the partition by replacing the first weight value with a second weight value.

Automated partitioning of a distributed database system

A disclosed database system and enhanced methods implement enhanced mini-plans and dynamically changing a query mini-plan with trustworthy Artificial Intelligence (AI) to improve query execution performance in a database system. An AI cost model evaluates candidate mini-plans for executing a query. AI truth monitors evaluate the execution of the mini-plans, such as predicted input factors and adjusted mini-plans of one or more AI running data models. The AI truth monitors provide feedback to adjust the AI cost model based on evaluating the execution of the mini-plans. The AI truth monitors validate adjusted mini-plans, provide feedback to the AI cost model with improved overall prediction accuracy, and enhanced mini-plans to gain query performance.

Dynamically changing query mini-plan with trustworthy AI

In a computer-implemented method for improving performance of a database, a processor receives batch jobs for a relational database. The batch jobs may include a first member with a first buffer pool, and a second member with a second buffer pool. The processor may also identify a first actual object and an isolation level for the batch jobs, generate related queries based on the first actual object and the isolation level, calculate a cost for the first member and the second member to run the batch jobs based on the related queries, and assign the batch jobs to the first member based on a lower calculated cost.

Efficient job writing for database member

An approach is provided in which the approach segments each one of multiple components corresponding to multiple component levels in an SQL database system into multiple functions. The approach combines a first one of the multiple functions with a second one of the multiple functions into an image, and invokes the image to process an SQL query using the first function and the second function.

Dynamical database system resource balance

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.

Abnormal data detection

Modifying an index for a database is provided. An index tree for the database is traversed by: identifying a next node in the index tree, requesting a lock of the next node in the index tree, responsive to locking of the next node in the index tree, releasing a lock of a current node of the index tree, and making the next node in the index tree the current node of the index tree, until the current node of the index tree is a leaf node of the index tree. Responsive to determining to split the leaf node, the lock of the leaf node is released and, after releasing the lock of the leaf node, a lock of a non-leaf node parent of the leaf node in the index tree is requested.

Database index modification

A lightweight database-management system (DBMS) is based on a dynamic microservices architecture that implements each granular DBMS feature or function as a distinct, independently executable microservice. The DBMS's Parser front-end responds to each incoming query by selecting the first bind-time database feature needed to process the query. The Parser forwards its selection through a Channel-Binding subsystem to an Event Services Activation subsystem that activates a corresponding microservice to perform the selected feature. The first feature then selects the next required bind-time feature for activation, and this process continues sequentially until all required bind-time microservices have been identified, activated, and run. Runtime query-processing features are then sequentially selected in a similar manner. However, each selected runtime microservice is preloaded but not run. Only when all runtime functions have been identified does the Parser send an asynchronous message to the Channel-Binding subsystem directing the DBMS engine to run the preloaded runtime microservices.

Lightweight DBMS based on functional microservices

A tool for combining common processes shared by at least two or more sub-queries within a query is provided. The tool determines whether one or more sub set relationships are shared between the at least two or more sub-queries. Responsive to a determination that one or more sub set relationships are shared between the at least two or more sub-queries, the tool determines an order class for the at least two or more sub-queries based on the one or more sub set relationships, wherein determining the order class includes transforming the query to include one or more differing aspects within the single shared common process, with the one or more differing aspects arranged based, at least in part, on a query style, a query type, and a query function. Responsive to determining an access path for the query, the tool executes the access path during run-time for data accessing.

Growing community of inventors

Beijing, China

Meng Wan