Dynamic query optimization

Abstract

Methods, systems, and computer program products for dynamically adjusting computer resources, as appropriate, in response to predictions of query runtimes as well as for rendering costs of the computer resources actually utilized, which costs are consistent with consumer demands.

Description

CROSS REFERENCES TO RELATED APPLICATIONS [0001] The present invention is related to the following copending and commonly assigned U.S. patent application: ROC920030044US1; commonly filed herewith and incorporated herein by reference and made a part hereof. BACKGROUND OF THE INVENTION [0002] The present invention relates generally to computer-implemented data processing methods, systems, and computer program products. More particularly, it relates to dynamically optimizing database queries, as appropriate, so that query runtimes complete within query governing time boundaries. [0003] In typical database querying using SQL, query governors are mechanisms that perform several functions. Typically, query governors may be configured to allow all queries to run a predefined maximum amount of time, for example several seconds for all queries for all connections, or just the queries for a specific connection. One specific query governor function is to preempt or prevent long-running queries...

AI Technical Summary

Benefits of technology

[0007] The present invention provides improvements in methods, systems, and computer program products for dynamically predicting an appropriate amount of computer resources that should be allocated to have queries complete within predefined query time boundaries which queries would not otherwise complete within such boundaries. Included are improvements for dynamically allocating the appropriate computer resources in accordance with these dynamic predictions without negative effect and that overcome many of the disadvantages of prior art processing arrangements.

Problems solved by technology

While query governors manage queries in the foregoing fashion, there are no known approaches for dynamically predicting the appropriate amount of computer resources needed for fitting otherwise long-running queries within predefined query time boundaries so that the queries are not preempted from running.

Furthermore, no approaches are known for dynamically allocating the appropriate amount of computer resources to fit the otherwise long-running queries within the predefined query time boundaries wherein the allocations are based on the dynamic predictions.

In addition, no approaches are known for use in systems wherein the allocated resources are made available from logically partitioned and / or grid environments for achieving the foregoing tasks.

Moreover, no approaches are known for apportioning costs or fees to customers based on computer resources actually utilized to achieve the foregoing, let alone to satisfy the configurable costs and performance demands of customers.

Accordingly, without such needs being satisfied, the true potential of running queries with query governors will not be easily achieved.

Images