US 11,989,181 B2
Optimal query scheduling for resource utilization optimization
Julius Cisek, Alameda, CA (US); Gaurav Kumar, Berkeley, CA (US); Shaunak Mistry, Scotts Valley, CA (US); and Kalen Petersen, Olympia, WA (US)
Assigned to Google LLC, Mountain View, CA (US)
Filed by Google LLC, Mountain View, CA (US)
Filed on Mar. 2, 2023, as Appl. No. 18/177,726.
Application 18/177,726 is a continuation of application No. 17/457,450, filed on Dec. 3, 2021, granted, now 11,625,400.
Application 17/457,450 is a continuation of application No. 16/741,723, filed on Jan. 13, 2020, granted, now 11,204,922, issued on Dec. 21, 2021.
Prior Publication US 2023/0205772 A1, Jun. 29, 2023
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 16/245 (2019.01); G06F 16/2453 (2019.01)
CPC G06F 16/24545 (2019.01) 20 Claims
OG exemplary drawing
 
1. A computer-implemented method when executed on data processing hardware causes the data processing hardware to perform operations comprising:
receiving a plurality of requests to schedule execution of a corresponding plurality of queries at a future time;
for each respective query of the corresponding plurality of queries, determining a frequency underlying data associated with the respective query changes;
determining that the frequency the underlying data associated with a respective one of the corresponding plurality of queries changes satisfies a threshold frequency; and
in response to determining that the frequency the underlying data associated with the respective one of the corresponding plurality of queries changes satisfies the threshold frequency, scheduling execution for the respective one of the corresponding plurality of queries at an intermediate time, the intermediate time occurring prior to the future time.