US 11,693,858 B2
Access path optimization
Xiao Xiao Chen, Beijing (CN); Xiaobo Wang, Haidian District (CN); Shuo Li, Beijing (CN); and Sheng Yan Sun, Beijing (CN)
Assigned to International Business Machines Corporation, Armonk, NY (US)
Filed by INTERNATIONAL BUSINESS MACHINES CORPORATION, Armonk, NY (US)
Filed on Jul. 17, 2020, as Appl. No. 16/931,494.
Prior Publication US 2022/0019587 A1, Jan. 20, 2022
Int. Cl. G06F 16/00 (2019.01); G06F 16/2453 (2019.01)
CPC G06F 16/24549 (2019.01) [G06F 16/24545 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A computer-implemented method comprising:
collecting, by one or more processing units, a plurality of real values of an access path factor during a specified time period, one of the real values being generated when a query is executed on a first access path;
generating, by one or more processing units, at least one second access path for the query, based on the plurality of real values of the access path factor, wherein the at least one second access path is calculated based on an average value of a filter factor, an average value of pre-fetch efficiency, and the average value of a buffer pool hit ratio, and wherein the generating further comprises:
dividing, by one or more processing units, the specified time period into a plurality of time segments, based on a frequency distribution of executing the query, wherein a clustering algorithm is applied against the frequency distribution; and
identifying, by one or more processing units, an optimal access path for the query from the first access path and the at least one second access path.