Abstract: Applications of different configurations of novel glucagon peptide 1 with fatty acid modification or nonmodification in the treatment of T2D or the pancreas protection are provided. The dimer of the present disclosure is formed by two identical cysteine-containing GLP-1 monomers through a disulfide bond. The H-like GLP-1 homodimer (disulfide bond is inside chains) showed remarkable increase in hypoglycemic duration without reducing specific activity. The GLP-1 dimer provided has an in-vivo effective duration of up to 19 days, which significantly prolonged compared with that of the positive control drug Liraglutide with 3 days of effective duration, or thereby greatly promoting the technical advancement in long-acting GLP-1 drugs and facilitating their clinical applications and business. Meanwhile the U-like homodimer (disulfide bond is at the C-terminus) does not affect blood glucose, but can obviously protect pancreatic exocrine cells such as acini and ducts, and improve pancreas function.

Abstract: A computer implemented method processes a query. A number of processor units processes the query to identify a result set in response to receiving the query from a first client. The number of processor units stores, the result set in a shared cache assigned to a group of clients, wherein result set stored in the shared cache is accessible by the group of clients. The number of processor units returns the result set to a second client in the group of clients from the shared cache in response to receiving the query from the second client in the group of clients.

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

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

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

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

Abstract: Disclosed are techniques for relational database locks based on columns. Database transactions may be targeted to specific columns of one or more records, instead of the entire row for those records, using primary keys. Column locks on specific keys are stored separately than column locks on ranges of keys, which are both checked when requesting a new column lock for either a single key or a range of keys. When a threshold number of columns for a given record, or range of records/keys, have been locked, the column locks for that record, or range of records, can be combined into a single row level lock to reduce resource costs for maintaining multiple concurrent locks.

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

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

Abstract: A system, program product, and method for enhancing automatic multidimensional query processing. The method includes executing a database query including semi-joining a plurality of dimension tables with a fact table. The method also includes identifying for extraction one or more data values from each dimension table of the plurality of dimension tables. The data values from each dimension table of the plurality of dimension tables are associated with a respective record identification (RID), thereby defining one or more RIDs. The method further includes generating a plurality of RID lists. Each RID list of the plurality of RID lists includes a collection of the one or more RIDs for the respective dimension table. The method also includes merging the plurality of RID lists, sorting, subject to the merging, the plurality of RIDs as a function of data location, and fetching the data values from the fact table.

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

Abstract: A method, system, and computer program product for providing data security through database map restructuring are provided. The method identifies related data tables within a set of data tables within a database. The method identifies a set of related data types within the related data tables. A set of similarities is determined among the set of related data types. The related data types are mapped based on the set of similarities. Based on the mapping, method restructures one or more data tables of the set of data tables to generate a restructured data table.

Abstract: A processor may allocate a first buffer segment from a buffer pool. The first buffer segment may be configured with a first contiguous range of memory for a first data partition of a data table. The first data partition comprising a first plurality of data blocks. A processor may store the first plurality of data blocks in order into the first buffer segment. A processor may retrieve the target data block from the first buffer segment in response to a data access request for a target data block of the first plurality of data blocks.

Abstract: Embodiments of the present disclosure relate to a method, system, and computer program product for data management. According to the method, one or more processors divide data into a plurality of partitions. The one or more processors store the plurality of partitions in a plurality of nodes of a mixed distributed database system, wherein a first node of the mixed distributed database system comprises a plurality of databases, and wherein at least a part of the plurality of partitions are shared by the plurality of databases of the first node and being not shared by other of the plurality of nodes.

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

Abstract: Systems and methods for high availability distributed data storage are provided. In embodiments, a method includes: receiving, by a remote direct memory access (RDMA) switch operatively coupled to a computing device, a request to access a page of a database; determining, by the RDMA switch, a validation state of the page; determining, by the RDMA switch, a status of the page; updating, by the RDMA switch, the status of the page based on the validation state and the request; and reporting, by the RDMA switch, the validation state.

Abstract: A supervised similarity measure machine learning method, system, and computer program product that includes generating embeddings by training a supervised deep neural network (DNN) on a feature data to determine which nodes correspond to which clustered learning group of clustered learning groups, performing half-distributed learning by distributing data in a time-series database to the clustered learning groups, and evaluating, based on the embeddings, new tenant data in the clustered learning groups with an upward bow pose.

Abstract: A processor receives an optimization target for a first cluster in a distributed computing environment. A processor trains a neural network based on the optimization target. A processor generates a decision tree based on the neural network. A processor selects a workload executing in the first cluster of the distributed computing environment. A processor identifies a second cluster to relocate the workload. A processor determines a current optimization of the distributed computing environment based on the workload being retained in the first cluster. A processor determines a migration optimization of the distributed computing environment based on the workload being migrated to the second cluster. A processor, in response to the migration optimization improving the current optimization of the distributed computing environment, migrates the workload to the second cluster.

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