Optimal query scheduling according to data freshness requirements

Patent metadata

Field	Value
Publication number	US-11269879-B2
Application number	US-202016741733-A
Country	US
Kind code	B2
Filing date	Jan 13, 2020
Priority date	Jan 13, 2020
Publication date	Mar 8, 2022
Grant date	Mar 8, 2022

Abstract

A process for optimal query scheduling includes receiving in an information retrieval data processing system, a request to accelerate query execution of a specified query to a time prior to a scheduled time. A specific field corresponding to data in a database is then identified in the query and a freshness of data requirement for the specific field retrieved along with a frequency of change the data corresponding to the specific field. Then, if execution of the specific query at the time prior to the scheduled time instead of the scheduled time is determined not to violate the freshness of data requirement based upon the frequency of change of the data corresponding of the specific field, the specific query is scheduled for execution at the time prior to the scheduled time. But otherwise, the scheduled time may be maintained for executing the specific query.

First claim

We claim:

1. A method for optimal query scheduling comprising:
receiving, at an information retrieval data processing system configured to manage queries across multiple different computing devices, a query acceleration request requesting that a query previously scheduled to execute at a scheduled time be accelerated to execute at a time prior to the scheduled time;
identifying a specific field from the previously scheduled query, the specific field corresponding to data in a database;
retrieving a freshness of data requirement for the specific field from the previously scheduled query and a frequency of change of the data corresponding to the specific field from the previously scheduled query;
determining if execution of the previously scheduled query at the time prior to the scheduled time instead of the scheduled time violates the freshness of data requirement based upon the frequency of change of the data corresponding of the specific field; and
on condition that the execution of the previously scheduled query is determined not to violate the freshness of data requirement by scheduling the previously scheduled query at the time prior to the scheduled time, rescheduling the previously scheduled query for execution at the time prior to the scheduled time, but otherwise maintaining the scheduled time for executing the previously scheduled query.

2. The method of claim 1 , wherein the time prior is a time that is under-scheduled with fewer scheduled queries consuming fewer resources of the information retrieval data processing system than available resources of the information retrieval data processing system at the located time and that has enough of the available resources to support execution of the previously scheduled query.

3. The method of claim 1 , further comprising maintaining the scheduled time for executing the previously scheduled query even though the previously scheduled query is determined not to violate the freshness of data requirement on condition that it is determined that the previously scheduled query has an estimated cost of execution that is below a threshold value.

4. The method of claim 3 , wherein the estimated cost of execution is computed by matching at least a portion of each of the previously scheduled query to an entry in a table of queries fragments and corresponding historical execution times.

5. An information retrieval data processing system adapted for optimal query scheduling, the system comprising:
a host computing platform comprising one or more computers each with memory and at least one processor;
a query interface coupled to a database and configured to:
receive, from requesters executing multiple different computing devices over a communications network, requests to schedule queries against the database, and
schedule the queries for execution and returning different results sets responsive to the queries to the requesters; and

an optimal query scheduling module comprising computer program instructions that when executing in the memory of the host computing platform, perform operations comprising:
receiving in an information retrieval data processing system, a query acceleration request requesting that a query previously scheduled to execute at a scheduled time be accelerated to execute at a time prior to the scheduled time;
identifying a specific field from the previously scheduled query, the specific field corresponding to data in a database;
retrieving a freshness of data requirement for the specific field from the previously scheduled query and a frequency of change the data corresponding to the specific field;
determining if execution of the previously scheduled query at the time prior to the scheduled time instead of the scheduled time violates the freshness of data requirement based upon the frequency of change of the data corresponding of the specific field; and
on condition that the execution of the previously scheduled query is determined not to violate the freshness of data requirement by scheduling the previously scheduled query at the time prior to the scheduled time, rescheduling the previously scheduled query for execution at the time prior to the scheduled time, but otherwise maintaining the scheduled time for executing the previously scheduled query.

6. The system of claim 5 , wherein the time prior is a time that is under-scheduled with fewer scheduled queries consuming fewer resources of the information retrieval data processing system than available resources of the information retrieval data processing system at the located time and that has enough of the available resources to support execution of the previously scheduled query.

7. The system of claim 5 , wherein the program instructions are further enabled to maintain the scheduled time for executing the previously scheduled query even though the previously scheduled query is determined not to violate the freshness of data requirement on condition that it is determined that the previously scheduled query has an estimated cost of execution that is below a threshold value.

8. The system of claim 7 , wherein the estimated cost of execution is computed by matching at least a portion of each of the previously scheduled query to an entry in a table of queries fragments and corresponding historical execution times.

9. A computer program product for optimal query scheduling, the computer program product including a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a device to cause the device to perform a method including:
receiving, at an information retrieval data processing system configured to manage queries across multiple different computing devices, a query acceleration request requesting that a query previously scheduled to execute at a scheduled time be accelerated to execute at a time prior to the scheduled time;
identifying a specific field from the previously scheduled query, the specific field corresponding to data in a database;
retrieving a freshness of data requirement for the specific field from the previously scheduled query and a frequency of change the data corresponding to the specific field from the previously scheduled query;
determining if execution of the previously scheduled query at the time prior to the scheduled time instead of the scheduled time violates the freshness of data requirement based upon the frequency of change of the data corresponding of the specific field; and
on condition that the execution of the previously scheduled query is determined not to violate the freshness of data requirement by scheduling the previously scheduled query at the time prior to the scheduled time, rescheduling the previously scheduled query for execution at the time prior to the scheduled time, but otherwise maintaining the scheduled time for executing the previously scheduled query.

10. The computer program product of claim 9 , wherein the time prior is a time that is under-scheduled with fewer scheduled queries consuming fewer resources of the information retrieval data processing system than available resources of the information retrieval data processing system at the located time and that has enough of the available resources to support execution of the previously scheduled query.

11. The computer program product of claim 9 , wherein the method further comprises maintaining the scheduled time for executing the previously scheduled query even though the previously scheduled query is determined not to violate the freshness of data requirement on condition that it is determined that the previously scheduled query has an estimated cost of execution that is below a threshold value.

Assignees

• Google Llc

Inventors

• Cisek Julius
• Kumar Gaurav
• Mistry Shaunak
• Petersen Kalen

Classifications

• G06F16/24537 Primary

  of operators · CPC title

• G06F16/2477

  Temporal data queries · CPC title

• G06F16/2455

  Query execution · CPC title

• G06F16/217 Primary

  Database tuning (G06F16/2282 takes precedence; database performance monitoring G06F11/3409) · CPC title

• G06F16/245 Primary

  Query processing · CPC title