Partial pre-aggregation in relational database queries

Details Partial pre-aggregation in relational database queries Partial pre-aggregation in relational database queries

2005-03-17

2009-06-30

Rones, Charles (Department: 2164)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000

Reexamination Certificate

active

07555473

ABSTRACT:
A partial pre-aggregation database operation improves processing efficiency of database queries by reducing the number of records input into a subsequent database operation, provided the query includes a final aggregation. A query optimizer is provided to determine when it is economical to partially pre-aggregate data records and when it is not. The partial pre-aggregation creates a record store in memory as input records are received. The record store is then used by another database operator, which saves the other database operator from having to re-create the record store.

REFERENCES:
patent: 5511190 (1996-04-01), Sharma et al.
patent: 5589559 (1996-12-01), Saito et al.
patent: 5598559 (1997-01-01), Chaudhuri
patent: 5781896 (1998-07-01), Dalal
patent: 5832475 (1998-11-01), Agrawal et al.
patent: 6029163 (2000-02-01), Ziauddin
patent: 6032144 (2000-02-01), Srivastava et al.
patent: 6115705 (2000-09-01), Larson
patent: 6199063 (2001-03-01), Colby et al.
patent: 6260037 (2001-07-01), Bestgen et al.
patent: 6282541 (2001-08-01), Hoa et al.
patent: 6397204 (2002-05-01), Liu et al.
patent: 6430550 (2002-08-01), Leo et al.
patent: 6460027 (2002-10-01), Cochrane et al.
patent: 6480836 (2002-11-01), Colby et al.
patent: 6493699 (2002-12-01), Colby et al.
patent: 6496819 (2002-12-01), Bello et al.
patent: 6625593 (2003-09-01), Leung et al.
patent: 2001/0013030 (2001-08-01), Colby et al.
patent: 2002/0077997 (2002-06-01), Colby et al.
Gray et al., “Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals”, Microsoft Research Technical Report MSR-TR-95-22, Feb. 5, 1995.
Chaudhuri, et al., “Including Group-By in Query Optimization,” VLDB Conference 1994, pp. 354-366.
Larson, “Grouping and Duplicate Elimination: Benefits of Early Aggregation,” Technical Report MSR-TR-97-36, 1997, (available at http://www.research.microsoft.com/pubs), pp. 1-25.
O'Neil, et al., “The LRU-K Page Replacement Algorithm For Database Disk Buffering,” SIGMOD 93, 1993, pp. 1-10.
Shatdal, et al., “Adaptive Parallel Aggregation Algorithms,” SIGMOD 1995, pp. 104-114.
Yan, et al., “Eager Aggregation and Lazy Aggregation,” VLDB 95, 1995, pp. 345-357.
Yan, et al., “Performing Group-By before Join,” Proc. 1994 International Conference on Data Engineering, Houston, Texas, 1994, pp. 89-100.
U.S. Appl. No. 11/082,390 Office Action mailed May 16, 2007.
Knuth, “The Art of Computer Programming,” vol. 3, Sorting and Searching, (2nd Ed), Addison-Wesley, 1998.

Affiliated with

Also associated with

Rating

Partial pre-aggregation in relational database queries does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Partial pre-aggregation in relational database queries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Partial pre-aggregation in relational database queries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4064256