Abstract: A computer-implemented method includes receiving a batch processing job. The method identifies multiple access paths for the batch processing job. The method determines one or more runtime costs for each of the multiple access paths. The method determines whether the batch processing job includes comparable access paths. The method responds to the batch processing job not including comparable access paths by receiving a query and selecting a desired access, based on the one or more runtime costs. The method responds to the batch processing job including comparable access paths by determining one or more context costs for each of the one or more access paths, receiving a query, identifying a context for the query, and selecting a desired access path for the query. The desired access path is based on the one or more runtime costs, the one or more context costs, and the context for the query.

Abstract: A computer-implemented method includes receiving a batch processing job. The method identifies multiple access paths for the batch processing job. The method determines one or more runtime costs for each of the multiple access paths. The method determines whether the batch processing job includes comparable access paths. The method responds to the batch processing job not including comparable access paths by receiving a query and selecting a desired access, based on the one or more runtime costs. The method responds to the batch processing job including comparable access paths by determining one or more context costs for each of the one or more access paths, receiving a query, identifying a context for the query, and selecting a desired access path for the query. The desired access path is based on the one or more runtime costs, the one or more context costs, and the context for the query.

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 data driven parallel sorting method includes distributing input data records to n partitions one by one in a circular manner. Each partition corresponds to a parallel sorting process with an allocated memory chunk sized to store m data records. The method also includes sorting, in parallel, current data records in respective memory chunks in respective partitions. The method also includes in response to distribution of data records of ?m/n? rounds, circularly controlling one of the n partitions, and writing data records that have been sorted in the memory chunk of the partition into a mass storage as an ordered data chunk, and emptying the memory chunk. The method also includes in response to all data records being distributed, writing data chunks that have been sorted in respective memory chunks into the mass storage, and performing a merge sort on all ordered data chunks in the mass storage.

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: Aspects of the present disclosure relate to an approach for generating query execution plans for a database query. A computer-implemented method comprises determining whether a size of a file to be generated during execution of a database query is variable in response to obtaining the database query. The method further comprises determining a plurality of ranges for the size of the file in response to determining that the size of the file is variable. The method further comprises generating a plurality of query execution plans corresponding to the plurality of ranges. Accordingly, a plurality of query execution plans corresponding to different file sizes can be generated for the database query, and an efficient and cost effective query execution plan may be selected based on the actual file size during the execution of the database query.

Abstract: A method includes receiving an input from a user, the input including a selection of an object, where the object is contained in a video, identifying, in response to the input, the object in the video, determining an attribute of the object associated with a profile of the user, where the profile contains a preference of the user regarding at least one object to be viewed, and determining, in response to the attribute of the object associated with the profile, a target segment in the video, where the target segment includes the object.

Abstract: A computer-implemented method includes identifying a query, including one or more predicates and one or more branches, wherein one or more branches includes one or more legs. The computer-implemented method further includes, for each branch, in parallel: determining a risk, determining a return row threshold, estimating a number of return rows; terminating access if the return rows exceed the threshold. The computer-implemented method further includes, for each leg, in parallel: determining a leg return row threshold; accessing the leg; fetching one or more return rows into one or more leg return row pages; terminating access if the return rows exceed the threshold; intersecting one or more leg return row pages into one or more intersected leg return row pages; and applying the one or more predicates to the one or more intersected leg return row pages. The method may be embodied in a corresponding computer system or computer program product.

Abstract: List display control method and device are provided. The method may include displaying a plurality of list items in a list display area. The method may also include performing at least one of the following based on an operation of a pointer in the list display area: scrolling up, in response to a first operation of the pointer on any list item of the plurality of list items in a first area of the list display area and scrolling down, in response to a second operation of the pointer on any list item of the plurality of list items in a second area of the list display area which is different from the first area.

Abstract: A computer system 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-implemented method includes identifying a primary database interaction statement and determining one or more intermediate database interaction statements based on the primary database interaction statement. The computer-implemented further includes determining, for each of the one or more intermediate database interaction statements, an intermediate statement transformation indicator. The computer-implemented method further includes determining one or more transformed database interaction statements based on each intermediate statement transformation indicator.

Abstract: Optimization of a multi-index database access at runtime. A processor receives a query. A processor determines a plan and a record identifier (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: A computer-implemented method includes identifying a query, including one or more predicates and one or more branches, wherein one or more branches includes one or more legs. The computer-implemented method further includes, for each branch, in parallel: determining a risk, determining a return row threshold, estimating a number of return rows; terminating access if the return rows exceed the threshold. The computer-implemented method further includes, for each leg, in parallel: determining a leg return row threshold; accessing the leg; fetching one or more return rows into one or more leg return row pages; terminating access if the return rows exceed the threshold; intersecting one or more leg return row pages into one or more intersected leg return row pages; and applying the one or more predicates to the one or more intersected leg return row pages. The method may be embodied in a corresponding computer system or computer program product.

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: A computer-implemented method includes identifying a primary database interaction statement and determining one or more intermediate database interaction statements based on the primary database interaction statement. The computer-implemented further includes determining, for each of the one or more intermediate database interaction statements, an intermediate statement transformation indicator. The computer-implemented method further includes determining one or more transformed database interaction statements based on each intermediate statement transformation indicator. A corresponding computer program product and computer system are also disclosed.

Abstract: A method for dynamically updating database statistics and a plurality of access paths associated with at least one database table is provided. The method may include identifying at least one dynamically changing column associated with the at least one database table. The method may further include determining at least one predicate pattern associated with the identified at least one dynamically changing column. Additionally, the method may include dynamically detecting at least one range change associated with the determined at least one predicate pattern based on at least one record insert. The method may also include updating the plurality of database statistics associated with the identified at least one dynamically changing column based on the dynamically detected at least one range change. The method may further include determining at least one filter factor based on the updated plurality of database statistics associated with the identified at least one dynamically changing column.

Abstract: A method for dynamically updating database statistics and a plurality of access paths associated with at least one database table is provided. The method may include identifying at least one dynamically changing column associated with the at least one database table. The method may further include determining at least one predicate pattern associated with the identified at least one dynamically changing column. Additionally, the method may include dynamically detecting at least one range change associated with the determined at least one predicate pattern based on at least one record insert. The method may also include updating the plurality of database statistics associated with the identified at least one dynamically changing column based on the dynamically detected at least one range change. The method may further include determining at least one filter factor based on the updated plurality of database statistics associated with the identified at least one dynamically changing column.

Abstract: A method includes receiving an input from a user, the input including a selection of an object, where the object is contained in a video, identifying, in response to the input, the object in the video, determining an attribute of the object associated with a profile of the user, where the profile contains a preference of the user regarding at least one object to be viewed, and determining, in response to the attribute of the object associated with the profile, a target segment in the video, where the target segment includes the object.

Abstract: Optimizing query statements in relational databases including determining filtering performance for each of at least two complex predicates in a predetermined layer of the query statement based on a result of a query performed on predetermined data records by using only the complex predicate. The results are ranked based on the filtering performance and re-ordered so that a complex predicate with a higher filtering performance is ranked before a complex predicate with a lower filtering performance. These techniques produce shortened data query response times and improved execution efficiency.