Methods and apparatus for aggregating sparse data

• US 6,606,621 B2
• Filed: 05/30/2001
• Issued: 08/12/2003
• Est. Priority Date: 05/30/2001
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Welton, Caleb E., Hicks, Grant E., Hopeman, Albert A.
• Primary Examiner(s): Mizrahi, Diane D.
• Application Number:
  US09/870,271
• Publication Number:
  US 20020194163A1
• Time in Patent Office: 804 Days
• Field of Search: 707/1, 707/2, 707/3, 707/4, 707/100, 707/102, 707/103.R
• US Class Current: 1/1
• CPC Class Codes: G06F 16/24556 Aggregation; Duplicate elimination
• CPC Class Codes: G06F 16/283 Multi-dimensional databases or data warehouses, e.g. MOLAP or ROLAP
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation

Abstract

A method for aggregating sparse data in a multidimensional array by using a composite join hierarchy created by segmenting the data so that each segment of the hierarchy processed is smaller and more likely to fit in memory. The method employs a recursive sub-cubing mechanism wherein an n-dimensional cube is broken into a number of (n−1)-dimensional cubes and each of those cubes are solved as (n−2)-dimensional cubes etc. Within each division, the processing is segmented by hierarchy level so a dimension with three hierarchy levels (for example, month-quarter-year) would form three separate subcubes with one less dimension. This algorithm produces one ‘worklist’ for every combination of hierarchy levels in the cube. Each of these worklists is represented as a bitmap of the cells contained within it and may be used as a basis of generating more aggregate worklists. To minimize the need for input-output data transfers, all the derived worklists of a single worklist are generated at the same time. This is accomplished without keeping more than n-worklists active at any given time to reduce the number of input-output data transfers needed without requiring substantially larger memory space.

Claims

1. A method for creating a composite-join hierarchy for use in aggregating data in a multi-dimensional array of data values, said multi-dimensional array of data values being organized in at least one dimension in accordance with a plurality of hierarchical relationships, said method comprising, in combination, the steps of:

merging said plurality of hierarchical relationships into a single hierarchical relationship,

storing an executable program for subdividing an input data worklist representing a data array of n dimensions into sublists each representing a data array of (n−

1) dimensions forming part of said composite-join hierarchy,

storing an initial worklist containing data representing said multidimensional array of data values,

employing an iterative routine for first executing said program to process said initial worklist into to create result sublists, and to thereafter repeatedly execute said program to process each result sublist produced by said program until no further unprocessed result sublist containing data remains and the creation of said composite-join hierarchy is completed.

2. The method as set forth in claim 1 wherein said input data worklist that is subdivided by said program includes a bitmap representation of the array locations that are occupied by data in said input data worklist.

3. The method as set forth in claim 2 wherein each given one of said sublists produced by said program includes a bitmap representation of the array locations that are occupied by data in said given one of said sublists.

4. A method for creating a composite-join hierarchy for use in aggregating a multi-dimensional array of data values, said multi-dimensional array of data values being organized in at least one dimension in accordance with a plurality of hierarchical relationships, said method comprising, in combination, the steps of:

merging said plurality of hierarchical relationships into a single hierarchical relationship,

storing an executable program for processing the data in an input worklist representing a data array of n dimensions which is organized into hierarchical levels in at least one of those dimensions, said program producing a sublist for every combination of hierarchical levels represented in said data array,

storing an initial worklist containing data representing said multidimensional array of data values,

employing an iterative routine for first executing said program to first process said initial worklist to create result sublists, and to thereafter repeatedly execute said program to complete said composite join hierarchy by processing each result sublist produced by said program until no further unprocessed result sublist that contains data remains.

5. The method as set forth in claim 4 wherein said input data worklist that is subdivided by said program comprises a bitmap representation of the array locations that are occupied by data in said input data worklist.

6. The method as set forth in claim 5 wherein each given one of said sublists produced by said program comprises a bitmap representation of the array locations that are occupied by data in said given one of said sublists.

7. A method for creating a composite-join hierarchy for use in aggregating data in a multi-dimensional array, said multi-dimensional array of data values being organized in at least one dimension in accordance with a plurality of hierarchical relationships, said method comprising, in combination, the steps of:

merging said plurality of hierarchical relationships into a single hierarchical relationship,

storing an executable program for subdividing an input data worklist representing a said data array of n dimensions into sublists each representing a data array of (n−

1) dimensions forming part of said composite-join hierarchy,

storing an initial worklist containing data representing said data in a multi-dimensional array,

employing an iterative routine for first executing said program to first process said initial worklist into to create result sublists, and to thereafter repeatedly execute said program to process each result sublist produced by said program until no further unprocessed result sublist containing data remains to complete the creation of said composite-join hierarchy.

8. The method as set forth in claim 7 wherein said input data worklist that is subdivided by said program includes a bitmap representation of the array locations that are occupied by data in said input data worklist.

9. The method as set forth in claim 8 wherein each given one of said sublists produced by said program includes a bitmap representation of the array locations that are occupied by data in said given one of said sublists.

10. A method for creating a composite-join hierarchy for use in aggregating a multi-dimensional array of data values, said multi-dimensional array of data values being organized in at least one dimension in accordance with a plurality of hierarchical relationships, said method comprising, in combination, the steps of:

merging said plurality of hierarchical relationships into a single hierarchical relationship,

storing an executable program for processing the data in an input worklist representing a data array of n dimensions which is organized into hierarchical levels in at least one of those dimensions, said program producing a sublist for every combination of hierarchical levels represented in said data array,

storing an initial worklist containing data representing said multidimensional array of data values,

employing an iterative routine for first executing said program to first process said initial worklist to create result sublists, and to thereafter repeatedly execute said program to complete said composite join hierarchy by processing each result sublist produced by said program until no further unprocessed result sublist that contains data remains.

11. The method as set forth in claim 10 wherein said input data worklist that is subdivided by said program comprises a bitmap representation of the array locations that are occupied by data in said input data worklist.

12. The method as set forth in claim 11 wherein each given one of said sublists produced by said program comprises a bitmap representation of the array locations that are occupied by data in said given one of said sublists.