Patent US5850547A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5850547A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus for parallel processing aggregates using intermediate aggregate values

Assignee: Oracle International Corp
•
Filing: 1997-01-08
•
Granted: 1998-12-15
•
Expires: 2017-01-08
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The present invention performs parallel processing of aggregate functions in a computing system. Partitioned into multiple subsets of data and each of the multiple subsets of data is allocated to one of a plurality of processes. Intermediate aggregations are performed in parallel by the plurality of processes on each of the multiple subsets of data. Each intermediate aggregation yields at least one intermediate value, wherein the at least one intermediate value is represented in an internal type format. The intermediate values from each of the intermediate aggregations are merged into a final aggregation value.

Inventors

  • 👤 William H. Waddington
  • 👤 Jeffrey I. Cohen

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-31 15:24
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/20; G06F16/24; G06F16/245; G06F16/2455; G06F16/24553; G06F16/24554; G06F16/24556; G06F16/2453; G06F16/24532

Claims Analysis

Total Claims: 23
Claim 1
Independent Claim 131 words
A computer-implemented method for parallel processing aggregate functions in a computing system, said aggregate functions being performed on a set of data, the computer-implemented method comprising the steps of: partitioning said set of data stored in an external type format into multiple subsets of data; assigning each of said multiple subsets of data to one of a plurality of processes; said plurality of processes performing intermediate aggregations and conversions in parallel on each of said multiple subsets of data, each of said intermediate aggregations yielding at least one intermediate value, wherein said at least one intermediate value is represented in an internal type format; and merging said at least one intermediate value from each of said imtermediate aggregations and converting into a final aggregation value stored in said external type format.
Claim 2
Dependent Claim 131 words
A computer-implemented method for parallel processing aggregate functions in a computing system, said aggregate functions being performed on a set of data, the computer-implemented method comprising the steps of: partitioning said set of data stored in an external type format into multiple subsets of data; assigning each of said multiple subsets of data to one of a plurality of processes; said plurality of processes performing intermediate aggregations and conversions in parallel on each of said multiple subsets of data, each of said intermediate aggregations yielding at least one intermediate value, wherein said at least one intermediate value is represented in an internal type format; and merging said at least one intermediate value from each of said imtermediate aggregations and converting into a final aggregation value stored in said external type format.
Claim 3
Dependent Claim 35 words
The computer-implemented method of claim 1 wherein said step of performing intermediate aggregations in parallel on each of said multiple subsets of data includes the step of sorting each of said multiple subsets of data.
Claim 4
Dependent Claim 14 words
The computer-implemented method of claim 1 wherein said aggregate functions are linear aggregate functions.
Claim 5
Dependent Claim 39 words
The computer-implemented method of claim 1 wherein said step of performing intermediate aggregations in parallel on each of said multiple subsets of data includes the step of converting each of said multiple subsets of data into an internal representation.
Claim 6
Dependent Claim 23 words
The computer-implemented method of claim 1 wherein said aggregate functions include one or more of MAX, MIN, AVG, SUM, STDDEV, VARIANCE and COUNT.
Claim 7
Dependent Claim 50 words
The computer-implemented method of claim 1 wherein said step of assigning each of said multiple subsets of data to one of said plurality of processes includes the step of assigning each of said multiple subsets of data to one of said plurality of processes according to a predetermined mapping function.
Claim 8
Dependent Claim 15 words
The computer-implemented method of claim 6 wherein said predetermined mapping function is a hash function.
Claim 9
Dependent Claim 137 words
A computer system for parallel processing aggregate functions, said aggregate functions being performed on a set of data stored in an external type format, said computer system comprising: a processor; a plurality of process spawned by the processor; processing logic for, partitioning said set of data into multiple subsets of data; assigning each of said multiple subsets of data to one of said plurality of processes; said plurality of processes performing intermediate aggregations and conversions in parallel on each of said multiple subsets of data, each of said intermediate aggregations yielding at least one intermediate value, wherein said at least one intermediate value is represented in an internal type format; and merging said at least one intermediate value from each of said intermediate aggregations and converting into a final aggregation value stored in said external type format.
Claim 10
Dependent Claim 137 words
A computer system for parallel processing aggregate functions, said aggregate functions being performed on a set of data stored in an external type format, said computer system comprising: a processor; a plurality of process spawned by the processor; processing logic for, partitioning said set of data into multiple subsets of data; assigning each of said multiple subsets of data to one of said plurality of processes; said plurality of processes performing intermediate aggregations and conversions in parallel on each of said multiple subsets of data, each of said intermediate aggregations yielding at least one intermediate value, wherein said at least one intermediate value is represented in an internal type format; and merging said at least one intermediate value from each of said intermediate aggregations and converting into a final aggregation value stored in said external type format.
Claim 11
Dependent Claim 14 words
The computer system of claim 8 wherein said aggregate functions are linear aggregate functions.
Claim 12
Dependent Claim 22 words
The computer system of claim 8 wherein processing logic also converts each of said multiple subsets of data into an internal representation.
Claim 13
Dependent Claim 23 words
The computer system of claim 8 wherein said aggregate functions include one or more or MAX, MIN, AVG, SUM, STDDEV, VARIANCE and COUNT.
Claim 14
Dependent Claim 51 words
The computer system of claim 8 wherein said processor logic for assigning each of said multiple subsets of data to one of said plurality of processes includes processor logic for assigning each of said multiple subsets of data to one of said plurality of processes according to a predetermined mapping function.
Claim 15
Dependent Claim 15 words
The computer system of claim 12 wherein said predetermined mapping function is a hash function.
Claim 16
Dependent Claim 19 words
The computer system of claim 8 wherein said processing logic further sorts each of said multiple subsets of data.
Claim 17
Dependent Claim 130 words
A machine readable medium having stored thereon data representing, sequences of instructions, which when executed by a computer system, cause said computer system to perform the steps of: partitioning a set of data stored in an external type format into multiple subsets of data; assigning each of said multiple subsets of data to one of a plurality of precesses; said plurality of precesses performing intermediate aggregations and conversions in parallel on each of said multiple subsets of data, each of said intermediate aggregations yielding at least one intermediate value, wherein said at least one intermediate value is represented in an internal type format; and merging said at least one intermediate value from each of said intermediate aggregations and converting into a final aggregation value stored in said external type format.
Claim 18
Dependent Claim 130 words
A machine readable medium having stored thereon data representing, sequences of instructions, which when executed by a computer system, cause said computer system to perform the steps of: partitioning a set of data stored in an external type format into multiple subsets of data; assigning each of said multiple subsets of data to one of a plurality of precesses; said plurality of precesses performing intermediate aggregations and conversions in parallel on each of said multiple subsets of data, each of said intermediate aggregations yielding at least one intermediate value, wherein said at least one intermediate value is represented in an internal type format; and merging said at least one intermediate value from each of said intermediate aggregations and converting into a final aggregation value stored in said external type format.
Claim 19
Dependent Claim 40 words
The machine readable medium of claim 15 wherein said step of performing intermediate aggregations in parallel on each of said multiple subsets of data includes the steps of converting each of said multiple subsets of data into an internal representation.
Claim 20
Dependent Claim 24 words
The machine readable medium of claim 15 wherein said aggregate functions include one or more of MAX, MIN, AVG, SUM, STDDEV, VARIANCE and COUNT.
Claim 21
Dependent Claim 16 words
The machine readable medium of claim 15 wherein said predetermined mapping function is a hash function.
Claim 22
Dependent Claim 36 words
The machine readable medium of claim 15 wherein said step of performing intermediate aggregations in parallel on each of said multiple subsets of data includes the step of sorting each of said multiple subsets of data.
Claim 23
Dependent Claim 15 words
The machine readable medium of claim 15 wherein said aggregate functions are linear aggregate functions.

References Cited (Backward Citations)

US5671382A Cited
US5640554A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2001-12-14 2002-06-15 2002-12-15 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2005-12-14 2006-06-15 2006-12-15 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2009-12-14 2010-06-15 2010-12-15 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag