Efficient data aggregation operations using hash tables

Details Efficient data aggregation operations using hash tables Efficient data aggregation operations using hash tables

2005-06-17

2008-12-23

Pham, Khanh B. (Department: 2166)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000, C707S793000, C707S793000

Reexamination Certificate

active

07469241

ABSTRACT:
Hash aggregation operates in two phases. In the first phase, data read from underlying row source is partitioned on GROUP BY keys with on-the-fly aggregation. It is determined into which partition an entry corresponding to the incoming record should be grouped, and whether a matching entry is already present in the partition, using a hash function and a hash table built for the partition. For aggregation operations, if a match is found, then a measure value from the incoming record is aggregated with a measure value for the entry existing in the partition. If there is not enough system volatile memory to complete the first phase, then a partition is selected for storing persistently. Thus, only one partition at a time is stored persistently, as necessary. In the second phase, one persistently stored partition is processed at a time, whereby aggregation of the data in that partition is completed and results are returned.

REFERENCES:
patent: 5515531 (1996-05-01), Fujiwara et al.
patent: 5832475 (1998-11-01), Agrawal et al.
patent: 6226639 (2001-05-01), Lindsay et al.
patent: 7043494 (2006-05-01), Joshi et al.
patent: 7085769 (2006-08-01), Luo et al.
patent: 2002/0099691 (2002-07-01), Lore et al.
patent: 2004/0172400 (2004-09-01), Zarom et al.
patent: 2004/0199516 (2004-10-01), Thames et al.
patent: 2005/0114862 (2005-05-01), Bisdikian et al.
patent: 2007/0083491 (2007-04-01), Walmsley et al.
Lane, Paul, et al., “Oracle Database Data Warehousing Guide, 10g Release 1 (10.1),” Oracle, Dec. 2003, 806 pages. (reference provided on enclosed CD-ROM).
Moore, Valarie, et al., “Oracle Database Performance Tuning Guide, 10g Release 1 (10.1),” Oracle, Dec. 2003, 572 pages. (reference provided on enclosed CD-ROM).
Alexander Chigrik, “SQL Server 7.0: Hash Joins,” Sep. 7, 2000, www.databasejournal.com/features/mssql/article.php/a443301 p. 1-4.
Oracle8/Data Warehousing Guide, Release 2 (8.1.6), Part No. A76994-01, “Parallelism and Partitioning,” Dec. 1999, 17 pages.

Affiliated with

Also associated with

Rating

Efficient data aggregation operations using hash tables does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient data aggregation operations using hash tables, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient data aggregation operations using hash tables will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4034965