Optimal query scheduling according to data freshness requirements

US2022164352A1 · US · A1

Patent metadata
FieldValue
Publication numberUS-2022164352-A1
Application numberUS-202217650690-A
CountryUS
Kind codeA1
Filing dateFeb 11, 2022
Priority dateJan 13, 2020
Publication dateMay 26, 2022
Grant date

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

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

Opening claim text (preview).

What is claimed is: 1 . A computer-implemented method when executed by data processing hardware of an information retrieval data processing system causes the data processing hardware to perform operations comprising: receiving, at the information retrieval data processing system configured to manage queries across multiple different computing devices, a query acceleration request requesting that a query be executed at a time prior to a scheduled time; determining whether executing the query at the time prior to the scheduled time satisfies an execution requirement; when executing the query at the time prior to the scheduled time satisfies the execution requirement, providing a corresponding result for the query executed at the time prior to the scheduled time; and when executing the query at the time prior to the scheduled time does not satisfy the execution requirement, maintaining the scheduled time for executing the query. 2 . The method of claim 1 , wherein the execution requirement is based on an execution cost. 3 . The method of claim 2 , wherein the execution cost of the query is based at least a portion of the query. 4 . The method of claim 3 , wherein the operations further comprise: associating a plurality of query portions of the query to a plurality of known query portions; and looking up, in an execution cost table, the execution cost of each of the plurality of known query portions that are associated to each of the plurality of query portions of the query to determine the execution cost of the query. 5 . The method of claim 1 , wherein the execution requirement is based on a freshness requirement. 6 . The method of claim 5 , wherein the freshness requirement indicates an acceptable update period for data in a database corresponding to one or more fields of the query. 7 . The method of claim 6 , wherein the operations further comprise: retrieving a volatility for the data corresponding to the one or more fields of the query; and determining whether the freshness requirement at the time prior to the scheduled time is satisfied based on the volatility. 8 . The method of claim 6 , wherein the freshness requirement is stored in a freshness table. 9 . The method of claim 1 , wherein the information retrieval data processing system has enough available resources to support executing the query at the time prior to the scheduled time. 10 . The method of claim 1 , wherein the operations further comprise executing the query at both the time prior to the scheduled time and the scheduled time. 11 . An information retrieval data processing system configured to manage queries across multiple different computing devices, the information retrieval data processing system comprising: data processing hardware; and memory hardware in communication with the data processing hardware, the memory hardware storing instructions that when executed on the data processing hardware cause the data processing hardware to perform operations comprising: receiving, at the information retrieval data processing system, a query acceleration request requesting that a query be executed at a time prior to a scheduled time; determining whether executing the query at the time prior to the scheduled time satisfies an execution requirement; when executing the query at the time prior to the scheduled time satisfies the execution requirement, providing a corresponding result for the query executed at the time prior to the scheduled time; and when executing the query at the time prior to the scheduled time does not satisfy the execution requirement, maintaining the scheduled time for executing the query. 12 . The system of claim 11 , wherein the execution requirement is based on an execution cost. 13 . The system of claim 12 , wherein the execution cost of the query is based at least a portion of the query. 14 . The system of claim 13 , wherein the operations further comprise: associating a plurality of query portions of the query to a plurality of known query portions; and looking up, in an execution cost table, the execution cost of each of the plurality of known query portions that are associated to each of the plurality of query portions of the query to determine the execution cost of the query. 15 . The system of claim 11 , wherein the execution requirement is based on a freshness requirement. 16 . The system of claim 15 , wherein the freshness requirement indicates an acceptable update period for data in a database corresponding to one or more fields of the query. 17 . The system of claim 16 , wherein the operations further comprise: retrieving a volatility for the data corresponding to the one or more fields of the query; and determining whether the freshness requirement at the time prior to the scheduled time is satisfied based on the volatility. 18 . The system of claim 16 , wherein the freshness requirement is stored in a freshness table. 19 . The system of claim 11 , wherein the information retrieval data processing system has enough available resources to support executing the query at the time prior to the scheduled time. 20 . The system of claim 11 , wherein the operations further comprise executing the query at both the time prior to the scheduled time and the scheduled time.

Assignees

Inventors

Classifications

  • G06F16/217Primary

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

  • G06F16/245Primary

    Query processing · CPC title

  • of operators · CPC title

  • Query execution · CPC title

  • Temporal data queries · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US2022164352A1 cover?
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 th…
Who is the assignee on this patent?
Google Llc
What technology area does this patent fall under?
Primary CPC classification G06F16/217. Mapped technology areas include Physics.
When was this patent published?
Publication date Thu May 26 2022 00:00:00 GMT+0000 (Coordinated Universal Time) (A1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 12 related publications on this page (citations in our corpus or others sharing the same primary CPC).