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 computer-implemented method masks shard operations in a distributed database. The method includes performing a shard operation on a first table with a first column and a second column, where the shard operation divides the first table into a first shard with the first column and a second shard with the second column. The method also includes receiving a query, where the query is configured to perform at least a first command. The method further includes determining the first command is directed to the first column. The method includes updating the query to access the first shard in place of the first table. The method also includes executing the query and returning a set of results for the query to a source of the query.

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

Abstract: Embodiments of the present disclosure describe an approach for database query processing with database clients. According to the approach, a first set of queries are obtained from a plurality of clients in communication with a database server. A second set of queries are generated by normalizing the first set of queries. A set of access paths corresponding to the second set of queries are determined for retrieving data from at least one of the plurality of clients and the database server. Data is retrieved from at least one of the plurality of clients and the database server based on the set of access paths.

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 computer-implemented method, system and computer program product for improving performance of a distributed database. A query is received to store version data in the distributed database. Upon receiving the query to store the version data, the version data is stored in a row of a data page of a main table of a heap organized table/index organized table of the distributed database, where the row of the data page of the main table of the heap organized table/index organized table of the distributed database contains a pointer pointing to a later/previous version of the version data if the later/previous version of the version data is stored in the data page thereby chaining version data bi-directionally.

Abstract: A method includes receiving, by a computing device, a Structured Query Language (SQL) query from a user; generating, by the computing device, execution structures from the SQL query; generating, by the computing device, test results by running the SQL query with the execution structures; building, by the computing device, logs which record information of the running of the SQL query; generating, by the computing device, a candidate execution structure using the information from the logs; normalizing, by the computing device, the SQL query using the candidate execution structure; running, by the computing device, the normalized SQL query in a database; and comparing, by the computing device, results of the normalized SQL query to the test results.

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

Abstract: A computer-implemented method to estimate computing cost of database queries. The method includes receiving a query. The method also includes generating one or more access plans for the query. The method further includes dynamically generating a learning model based on each of the generated access plans. The method includes estimating, by the learning model and for each of the one or more access plans, a predicted cost to execute the query. The method includes selecting, based on the predicted cost, a first access path associated with a lowest cost of the predicted costs and executing the query according the selected access path.

Abstract: A method, system, and computer program product that are configured to: receive a Structured Query Language (SQL) statement including placeholders; generate sets of predicted values for the placeholders; generate candidate access paths in a database using the sets of predicted values; receive a query including the SQL statement with actual values instead of the placeholders; select one of the candidate access paths based on determining similarities of the actual values to ones of the sets of predicted values; in response to the selected one of the candidate access paths being acceptable, execute the query using the selected one of the candidate access paths; and in response to the selected one of the candidate access paths not being acceptable, generate a new access path in the database using the actual values, and execute the query using the new access path.

Abstract: A dataset is determined to include skewed data and based on determining that the dataset includes skewed data, one or more sparse indexes for the skewed data of the dataset are built. A sparse index of the one or more sparse indexes is for a range of data of the skewed data, and the building the sparse index includes indicating one pointer for a selected record of the range of data and indicating another pointer for another selected record of the range of data. The sparse index is provided to be used in a query of the dataset.

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: In an embodiment, a computer-implemented 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 computer-implemented method dynamically switches access plans for a query during concurrent query execution. The method includes receiving a first query configured to be processed by a database system. The method also includes generating, for the first query, an access plan for each of identified resource sets. The method includes determining a first set of available resources that represent an available capacity for the database system. The method further includes selecting a first resource set of the one or more resource sets, where the selecting is based on the first set of available resources being closest to the first resource set. The method also includes selecting, based on the first set of available resources, a first access plan of the one or more access plans. The method includes executing the first query and returning results of the first query to a source of the first query.

Abstract: A computer-implemented method, including receiving, by a processor set, a query including a query string for a system catalog; identifying, by the processor set, a default index structure of the system catalog; executing, by the processor set, the query based on the default index structure of each index in the system catalog; ranking, by the processor set, a performance of each execution of the query by each index; mapping, by the processor set, a query pattern to a corresponding index of the system catalog; selecting, by the processor set, the index to perform the query using a machine learning (ML) model trained with a knowledge base that includes the ranking and the mapping; executing, by the processor set, the query on the selected index; and in response to executing the query on the selected index, returning, by the processor set, a result of the query.

Abstract: A method, system, and computer program product for recommending an initial database security model. The method may include identifying a plurality of nodes connected to a security network. The method may also include analyzing security characteristics of each node of the plurality of nodes. The method may also include identifying, from the security characteristics, key factors for each node. The method may also include calculating similarities between each node of the plurality of nodes. The method may also include building a self-organized centerless network across the plurality of nodes by grouping nodes with high similarities based on the similarities between each node, where the self-organized centerless network is a centerless network without a central management server, and includes groups of nodes from the plurality of nodes. The method may also include generating federated security models for the groups of nodes.

Abstract: A computer-implemented method dynamically switches access plans for a query during concurrent query execution. The method includes receiving a first query configured to be processed by a database system. The method also includes generating, for the first query, an access plan for each of identified resource sets. The method includes determining a first set of available resources that represent an available capacity for the database system. The method further includes selecting a first resource set of the one or more resource sets, where the selecting is based on the first set of available resources being closest to the first resource set. The method also includes selecting, based on the first set of available resources, a first access plan of the one or more access plans. The method includes executing the first query and returning results of the first query to a source of the first query.

Abstract: Access usage of one or more shards of a set of shards of a database is determined. The set of shards includes a plurality of shards including a primary shard and one or more replica shards of the primary shard. A shard of the plurality of shards is selected based on the access usage, and a set of indexes is built for the shard that is selected. The set of indexes built for the shard that is selected is used for at least multiple shards of the plurality of shards.

Abstract: A computer-implemented method dynamically switches access plans for a query during concurrent query execution. The method includes receiving a first query configured to be processed by a database system. The method also includes generating, for the first query, an access plan for each of identified resource sets. The method includes determining a first set of available resources that represent an available capacity for the database system. The method further includes selecting a first resource set of the one or more resource sets, where the selecting is based on the first set of available resources being closest to the first resource set. The method also includes selecting, based on the first set of available resources, a first access plan of the one or more access plans. The method includes executing the first query and returning results of the first query to a source of the first query.

Abstract: This disclosure provides a method, a computing system, and a computer program product for managing prefetching of pages in a database system. The method comprises obtaining shared information associated with page access, wherein the shared information associated with the page access includes information associated with the page access from a plurality of computing nodes. The method further comprises determining whether to prefetch a number of pages into a global buffer pool based at least on the shared information associated with the page access using a sequential prefetching method.