Method and apparatus for optimizing queries under parametric aggregation constraints -> Monitor Keywords
Fresh Patents
Monitor Patents Patent Organizer File a Provisional Patent Browse Inventors Browse Industry Browse Agents Browse Locations
site info Site News  |  monitor Monitor Keywords  |  monitor archive Monitor Archive  |  organizer Organizer  |  account info Account Info  |  
02/28/08 - USPTO Class 707 |  39 views | #20080052268 | Prev - Next | About this Page  707 rss/xml feed  monitor keywords

Method and apparatus for optimizing queries under parametric aggregation constraints

USPTO Application #: 20080052268
Title: Method and apparatus for optimizing queries under parametric aggregation constraints
Abstract: The present invention relates to a method and apparatus for optimizing queries. The present invention discloses an efficient method for providing answers to queries under parametric aggregation constraints. (end of abstract)



Agent: At&t Corp. - Bedminster, NJ, US
Inventors: NIKOLAOS KOUDAS, Divesh Srivastava, Sudipto Guha, Dimitrios Gunopulos, Michail Vlachos
USPTO Applicaton #: 20080052268 - Class: 707002000 (USPTO)

Related Patent Categories: Data Processing: Database And File Management Or Data Structures, Database Or File Accessing, Access Augmentation Or Optimizing

Method and apparatus for optimizing queries under parametric aggregation constraints description/claims


The Patent Description & Claims data below is from USPTO Patent Application 20080052268, Method and apparatus for optimizing queries under parametric aggregation constraints.

Brief Patent Description - Full Patent Description - Patent Application Claims
  monitor keywords

CROSS-REFERENCE TO RELATED APPLICATIONS

[0001] This application is a divisional of co-pending U.S. patent application Ser. No. 10/828,839, filed Apr. 21, 2004, which claims benefit of U.S. provisional patent application Ser. No. 60/464,256, filed Apr. 21, 2003, each of the above referenced applications is herein incorporated by reference.

BACKGROUND OF THE INVENTION

[0002] 1. Field of the Invention

[0003] Embodiments of the present invention generally relate to a method for optimizing queries. More specifically, the present invention discloses an efficient method for providing answers to queries under parametric aggregation constraints.

[0004] 2. Description of the Related Art

[0005] In today's rapidly changing business landscape, corporations increasingly rely on databases to help organize, manage and monitor every aspect of their business. Databases are deployed at the core of important business operations, including Customer Relationship Management, Supply Chain Management, and Decision Support Systems. The increasing complexity of the ways in which businesses use databases creates an ongoing demand for sophisticated query capabilities.

[0006] Novel types of queries seek to enhance the way information is utilized, while ensuring that they can be easily realized in a relational database environment without the need for significant modifications to the underlying relational engine. However, as the size of databases continues to grow, coupled with the desire by users to formulate complex queries, traditional methods of responding to queries require a tremendous amount of computational cycles. This leads to delay and inefficiencies in the use of databases.

[0007] Therefore, there is a need for a method to efficiently provide answers to complex queries.

SUMMARY OF THE INVENTION

[0008] In one embodiment, the present invention generally relates to a method and apparatus for optimizing queries. The present invention discloses an efficient method for providing answers to queries under parametric aggregation constraints.

[0009] More specifically, the present invention discloses a method that preprocesses relations and constructs indices to efficiently provide answers to queries. e.g., optimization under parametric aggregation (OPAC) queries. The answers returned by the indices are approximate, not exact, (e.g., within an approximation factor) and provide guarantees for their accuracy. Moreover, the indices can be tuned easily to meet desired accuracy levels, providing a graceful tradeoff between answer accuracy and index space.

[0010] For example, a user may submit a query having aggregation constraints, where the user is willing to accept answers within a selectively defined approximation factor. In doing so, the results can be generated quickly without having to solve a multi-attribute knapsack problem from scratch for every query having aggregation constraints.

BRIEF DESCRIPTION OF THE DRAWINGS

[0011] So that the manner in which the above recited features of the present invention can be understood in detail, a more particular description of the invention, briefly summarized above, may be had by reference to embodiments, some of which are illustrated in the appended drawings. It is to be noted, however, that the appended drawings illustrate only typical embodiments of this invention and are therefore not to be considered limiting of its scope, for the invention may admit to other equally effective embodiments.

[0012] FIG. 1 illustrates an example of an .epsilon.-Pareto set;

[0013] FIG. 2 illustrates a method of the present invention for efficiently providing a result to a query having aggregation constraints, e.g., an OPAC query;

[0014] FIG. 3 illustrates a method for preprocessing a relation R;

[0015] FIG. 4 illustrates the preprocessing method of the present invention in pseudo code format;

[0016] FIG. 5 illustrates the operation of GeneratePartitions of the present invention;

[0017] FIG. 6 presents an example of the partitioning generated by algorithm GeneratePartitions of the present invention; and

[0018] FIG. 7 illustrates a block diagram of the present query optimization method being implemented on a general purpose computer.

[0019] To facilitate understanding, identical reference numerals have been used, wherever possible, to designate identical elements that are common to the figures.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

Continue reading about Method and apparatus for optimizing queries under parametric aggregation constraints...
Full patent description for Method and apparatus for optimizing queries under parametric aggregation constraints

Brief Patent Description - Full Patent Description - Patent Application Claims

Click on the above for other options relating to this Method and apparatus for optimizing queries under parametric aggregation constraints patent application.
###
monitor keywords

How KEYWORD MONITOR works... a FREE service from FreshPatents
1. 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 Method and apparatus for optimizing queries under parametric aggregation constraints or other areas of interest.
###


Previous Patent Application:
Estimation and use of access plan statistics
Next Patent Application:
Automatic matching method and automatic matching system
Industry Class:
Data processing: database and file management or data structures

###

FreshPatents.com Support
Thank you for viewing the Method and apparatus for optimizing queries under parametric aggregation constraints patent info.
IP-related news and info


Results in 0.08139 seconds


Other interesting Feshpatents.com categories:
Daimler Chrysler , DirecTV , Exxonmobil Chemical Company , Goodyear , Intel , Kyocera Wireless , 174
filepatents (1K)

* Protect your Inventions
* US Patent Office filing
patentexpress PATENT INFO