Abstract: In an approach for calculating one or more access paths during bind time, a computer receives a query. The computer identifies one or more access paths for processing the received query, wherein the one or more access paths include steps associated with retrieving data from a database based on the received query. The computer calculates resource costs associated with processing the received query on the one or more identified access paths based on one of more of: resources utilized to perform steps associated with processing the received query, and system statistics associated with the one or more identified access paths.

Abstract: In an approach for calculating one or more access paths during bind time, a computer receives a query. The computer identifies one or more access paths for processing the received query, wherein the one or more access paths include steps associated with retrieving data from a database based on the received query. The computer calculates resource costs associated with processing the received query on the one or more identified access paths based on one of more of: resources utilized to perform steps associated with processing the received query, and system statistics associated with the one or more identified access paths.

Abstract: In an approach for calculating one or more access paths during bind time, a computer receives a query. The computer identifies one or more access paths for processing the received query, wherein the one or more access paths include steps associated with retrieving data from a database based on the received query. The computer calculates resource costs associated with processing the received query on the one or more identified access paths based on one of more of: resources utilized to perform steps associated with processing the received query, and system statistics associated with the one or more identified access paths.

Abstract: In an approach for optimizing query executions a processor receives a request to transfer data from a first table to a second table. A processor detects a relationship between the first table and the second table, wherein the relationship is based on a similarity between the first table and the second table. A processor identifies at least a first access path for transferring the data from the first table to the second table. A processor calculates a first cost of transferring the data from the first table to the second table using the first access path based on the similarity between the first table and the second table, wherein the first cost indicates estimated processor usage to transfer the data.

Abstract: In an approach for optimizing query executions a processor receives a request to transfer data from a first table to a second table. A processor detects a relationship between the first table and the second table, wherein the relationship is based on a similarity between the first table and the second table. A processor identifies at least a first access path for transferring the data from the first table to the second table. A processor calculates a first cost of transferring the data from the first table to the second table using the first access path based on the similarity between the first table and the second table, wherein the first cost indicates estimated processor usage to transfer the data.

Abstract: A method, a computer program product, and a computer system for implementing multiple window based segment prefetch used for data pages that are out of sequence. A computer initiates a buffer for the segment prefetch. The computer builds up windows in the buffer, each of the windows comprising data pages among which neighboring data pages are within a predetermined distance therebetween. The computer determines whether a respective one of the windows exceeds a predetermined window size. The computer triggers the segment prefetch, in response to determining that the respective one of the windows exceeds the predetermined window size. The computer uses an asynchronous I/O to get the data pages in the respective one of the windows.

Abstract: In an approach to determining an access method for a partition in a partition table, a computer receives a query and determines if there is a partition table utilized by the query. When there is a partition table utilized by the query, then the computer determines that a partition in the partition table meets the plurality of conditions of the query. The computer collects a plurality of partition level statistics for the partition that meets the plurality of conditions of the query. Additionally, the computer determines, based, at least in part, on the plurality of partition level statistics, a cost for one or more access methods for the partition that meets the plurality of conditions of the query. Furthermore, the computer determines, based, at least in part, on the cost for each access method, an access method for the partition that meets the plurality of conditions of the query.

Abstract: In an approach to determining an access method for a partition in a partition table, a computer receives a query and determines if there is a partition table utilized by the query. When there is a partition table utilized by the query, then the computer determines that a partition in the partition table meets the plurality of conditions of the query. The computer collects a plurality of partition level statistics for the partition that meets the plurality of conditions of the query. Additionally, the computer determines, based, at least in part, on the plurality of partition level statistics, a cost for one or more access methods for the partition that meets the plurality of conditions of the query. Furthermore, the computer determines, based, at least in part, on the cost for each access method, an access method for the partition that meets the plurality of conditions of the query.

Abstract: A method to optimize a database is provided. A processor determines a frequency of search for a plurality of columns in a table. A processor determines a length of the plurality of columns. A processor determines a rank for the plurality of columns based, at least in part, on both the frequency of search and the length of the plurality of columns. A processor generates a first set of combinations of the plurality of columns. A processor determines an optimization of the first set of combinations of the plurality of columns. A processor selects an optimal combination of the first set of combinations, wherein the optimization of the optimal combination is greater than the optimization for all other combinations in the first set of combinations. A processor moves the plurality of columns excluded from the optimal combination.

Abstract: A computer program product to optimize a database is provided. A processor determines a frequency of search for a plurality of columns in a table. A processor determines a length of the plurality of columns. A processor determines a rank for the plurality of columns based, at least in part, on both the frequency of search and the length of the plurality of columns. A processor generates a first set of combinations of the plurality of columns. A processor determines an optimization of the first set of combinations of the plurality of columns. A processor selects an optimal combination of the first set of combinations, wherein the optimization of the optimal combination is greater than the optimization for all other combinations in the first set of combinations. A processor moves the plurality of columns excluded from the optimal combination.

Abstract: Optimization of a multi-index database access at runtime. A processor receives a query. A processor determines a plan and an RID results threshold for the plan, wherein the plan includes an access to the index. A processor determines a static risk threshold, a static risk for the access, and whether the static risk exceeds the static risk threshold. Responsive to the static risk exceeding the static risk threshold, a processor determines a risk bound for the access, and links the access to the risk bound. A processor accesses the index with the key. Responsive to the access being linked to a risk bound, a processor determines a dynamic risk for the access. A processor receives one or more RID results during the execution of the plan. A processor aborts the execution of the plan if a quantity of the RID results is less than the RID results threshold.

Abstract: Embodiments of the present invention provide systems and methods for dynamically allocating data to multiple nodes. The method includes determining the usage of multiple buffers and the capability factors of multiple servers. Data is then allocated to multiple buffers associated with multiple active servers, based on the determined usage and capability factors, in order to keep the processing load on the multiple servers balanced.

Abstract: Embodiments of the present invention provide systems and methods for dynamically allocating data to multiple nodes. The method includes determining the usage of multiple buffers and the capability factors of multiple servers. Data is then allocated to multiple buffers associated with multiple active servers, based on the determined usage and capability factors, in order to keep the processing load on the multiple servers balanced.

Abstract: Embodiments of the present invention provide a method, computer program product, and computer system for masking indexes. The method may include masking the index if the index contention exceeds a defined threshold. The method may also include configuring the mask type for the index to insert the index without masking. In response to determining that the mask type for the index is configured to insert the index without masking, the index is masked according to a set of rules.

Abstract: Embodiments of the present invention provide a method, computer program product, and computer system for masking indexes. The method may include masking the index if the index contention exceeds a defined threshold. The method may also include configuring the mask type for the index to insert the index without masking. In response to determining that the mask type for the index is configured to insert the index without masking, the index is masked according to a set of rules.

Abstract: In an approach for query processing, a computer receives a query. The computer determines the received query does not correspond to a previously executed query. The computer parses the received query to identify input literals that include one or more of: data values, tables, fields, records, and a parameter included in the received query. The computer determines whether a pattern is associated with the input literals included in the received query. Responsive to determining a pattern is associated with the input literals, the computer determines a future parameter based on the pattern associated with the input literals, wherein the future parameter is a subsequent instance of a parameter of the received query that corresponds to the pattern. The computer creates a future query by incorporating the determined future parameter into the received query.

Abstract: In an approach for query processing, a computer receives a query. The computer determines the received query does not correspond to a previously executed query. The computer parses the received query to identify input literals that include one or more of: data values, tables, fields, records, and a parameter included in the received query. The computer determines whether a pattern is associated with the input literals included in the received query. Responsive to determining a pattern is associated with the input literals, the computer determines a future parameter based on the pattern associated with the input literals, wherein the future parameter is a subsequent instance of a parameter of the received query that corresponds to the pattern. The computer creates a future query by incorporating the determined future parameter into the received query.

Abstract: In a method for managing a data index, one or more processors inserting one or more rows of data sequentially into a data table of a database. The method further includes inserting index entries that correspond to the inserted one or more rows of data sequentially into an index of the data table, wherein an index B-tree structure is not built initially during insertion. The method further includes determining whether one of: (i) a size threshold of index entries inserted into the index and (ii) a time threshold for inserting index entries into the index, is met. The method further includes responsive to determining that one of: (i) a size threshold of index entries inserted into the index and (ii) a time threshold for inserting index entries into the index, is met, building an index-B-tree structure that includes the index entries inserted into the index.

Abstract: In a method for managing a data index, one or more processors inserting one or more rows of data sequentially into a data table of a database. The method further includes inserting index entries that correspond to the inserted one or more rows of data sequentially into an index of the data table, wherein an index B-tree structure is not built initially during insertion. The method further includes determining whether one of: (i) a size threshold of index entries inserted into the index and (ii) a time threshold for inserting index entries into the index, is met. The method further includes responsive to determining that one of: (i) a size threshold of index entries inserted into the index and (ii) a time threshold for inserting index entries into the index, is met, building an index-B-tree structure that includes the index entries inserted into the index.

Abstract: In an approach for calculating one or more access paths during bind time, a computer receives a query. The computer identifies one or more access paths for processing the received query, wherein the one or more access paths include steps associated with retrieving data from a database based on the received query. The computer calculates resource costs associated with processing the received query on the one or more identified access paths based on one of more of: resources utilized to perform steps associated with processing the received query, and system statistics associated with the one or more identified access paths.