| Dynamically selecting alternative query access plans -> Monitor Keywords |
|
|
 
Dynamically selecting alternative query access plansRelated Patent Categories: Data Processing: Database And File Management Or Data Structures, Database Or File AccessingDynamically selecting alternative query access plans description/claimsThe Patent Description & Claims data below is from USPTO Patent Application 20050289098, Dynamically selecting alternative query access plans. Brief Patent Description - Full Patent Description - Patent Application Claims
CROSS REFERENCE TO RELATED APPLICATIONS [0001] The present invention is related to the following copending and commonly assigned U.S. patent applications: ROC920030044US1 (Ser. No. 10/787,722); and, ROC920030051US1 (Ser. No. 10/787,639) which are incorporated herein by reference and made a part hereof. BACKGROUND OF THE INVENTION [0002] The present invention relates generally to improved methods, systems, and computer program products for optimizing query processing. More particularly, it relates to optimizing query processing by dynamically selecting alternative query access plans in executing queries. [0003] In typical database querying, query optimizers operate to specify query access or execution plans. Structure Query Language (SQL) queries express what results are requested, but not how the results should be obtained. To implement an SQL statement, a query optimizer is responsible for transforming the SQL statement into a query access or execution plan composed of specific implementations. The query optimizer can select a query access or execution plan for a so-called best method of accessing the data in the database. Typically, this selection is done by generating many different join order strategies, evaluating the processing time of each, and selecting an access plan which can obtain an optimal querying, preferably, within an estimated run time. The access plan would also take into account a combination of optimization data including, but not limited to, an estimated amount of computational overhead, the number of physical Input/Output ("I/O") operations, the execution time, and cost. Known optimizers function to manage query executions in the foregoing fashion. Nevertheless, producing an optimal access plan for any given SQL query statement is a complex problem. [0004] Presently, there are no known approaches for dynamically selecting alternative query access plans based on additional computer resources being available. Moreover, there are no known approaches for dynamically selecting alternative query access plans based on such plans being significantly better than original query access plans as a result of the available additional computing resources. In addition, there are no approaches, whereby such resources to be available are dynamically available from logically partitioned and/or grid environments. [0005] Accordingly, there are needs for methods, systems, and computer program products for dynamically selecting alternative query access plans based on additional computer resources being available. In addition, there are needs for methods, systems, and computer program products for dynamically selecting alternative query access plans based on such plans being significantly better than original query access plans as a result of the available additional computing resources. Furthermore, there are needs for methods, systems, and computer program products, whereby such additional resources are dynamically available from logically partitioned and/or grid environments. [0006] Without such needs being satisfied, the true potential for optimizing query processing will not be entirely satisfied. SUMMARY OF THE INVENTION [0007] The present invention provides enhanced methods, systems, and computer program products for dynamically selecting alternative query access based on the availability of additional computer resources being allocated for running queries without negative effect and that overcome many of the disadvantages of prior art. [0008] The present invention provides improvements in methods, systems, and computer program products for dynamically selecting alternative query access plans based on them being significantly better than original query access plans as a result of the additional computer resources being allocated. [0009] The present invention provides improvements in methods, systems, and computer program products whereby the resources allocated to provide for the significantly better query access plans are dynamically selected from logically partitioned and/or grid environments. [0010] The present invention provides improvements in methods, systems, and computer program products wherein the significantly better query access plans are based on at least a monitored parameter of an alternative query access plan exceeding a monitored parameter of the original query access plan. [0011] These and other features and aspects of the present invention will be more fully understood from the following detailed description of the preferred embodiments, which should be read in light of the accompanying drawings. It should be understood that both the foregoing generalized description and the following detailed description are exemplary, and are not restrictive of the invention. BRIEF DESCRIPTION OF THE DRAWINGS [0012] FIG. 1 is a block diagram of an environment having a provider of computing services through a grid environment, in accordance with the present invention. [0013] FIG. 2 is a block diagram of a computer system in accordance with one of the preferred embodiments. [0014] FIG. 3 is a block diagram illustrating logical components in a logically partitioned computer system. [0015] FIG. 4 represents an exemplary flow diagram illustrating the determining of alternative query access plans. [0016] FIG. 5 represents an exemplary flow diagram for allocating resources to a computer system, according to one embodiment of the present invention. DETAILED DESCRIPTION [0017] The present invention provides enhanced methods, systems, and computer program products for dynamically selecting alternative query access plans. [0018] Referring now to FIG. 1, a data processing environment 100 is illustrated in which the present invention is practiced. Generally, the data processing environment 100 includes a provider computer system 102 and a plurality of one or more computer systems 116.sub.1-116.sub.N (collectively 116). The provider computer system 102 is illustratively embodied as a server computer with respect to the system users' (client) computer systems 116. Although all computers are illustrated as singular entities, in practice the provider computer system 102 and the client computer systems 116 may all be a network of computers configured to perform various functions, including those described herein. Further, the terms "client" and "server" are utilized merely for convenience and not by way of limitation. As such, the users' computer systems 116, which may be clients relative to the provider computer system 102, in some regards, may themselves be servers relative to one or more other clients (not shown). [0019] The provider computer system 102 and the computer systems 116 communicate through a network 106. The provider computer system 102 provides access to a grid computing environment 104. Access to various resources within the grid computing environment may also be provided by different service providers (not shown). The grid environment 104 may contain a plurality of different computing resources 120.sub.1-120.sub.N (collectively 120). The grid computing environment 104 may include parallel and distributed computing systems that enable sharing, selection, and aggregation of geographically distributed resources at runtime depending on their availability, capability, performance, cost, and/or user's quality of service requirements. The grid computing environment 104 may be a network including diverse hardware and/or software computing resources. These resources may be allocated and accessible through a network medium such as, the Internet, to a wide variety of users and may be shared between them. Continue reading about Dynamically selecting alternative query access plans... Full patent description for Dynamically selecting alternative query access plans Brief Patent Description - Full Patent Description - Patent Application Claims Click on the above for other options relating to this Dynamically selecting alternative query access plans patent application. ###  How KEYWORD MONITOR works... a FREE service from FreshPatents1. Sign up (takes 30 seconds). 2. Fill in the keywords to be monitored. 3. Each week you receive an email with patent applications related to your keywords. Start now! - Receive info on patent apps like Dynamically selecting alternative query access plans or other areas of interest. ### Previous Patent Application: Dynamic user interface creation based on user responsibilities and company policies Next Patent Application: Instructing management support software of a first software component to set up a communication channel between the first software component and a second software component Industry Class: Data processing: database and file management or data structures ### FreshPatents.com Support Thank you for viewing the Dynamically selecting alternative query access plans patent info. IP-related news and info Results in 0.12084 seconds Other interesting Feshpatents.com categories: Medical: Surgery , Surgery(2) , Surgery(3) , Drug , Drug(2) , Prosthesis , Dentistry 174 |
 * Protect your Inventions * US Patent Office filing 
PATENT INFO |
|
