Methods and apparatus for aggregating sparse data
AssigneeOracle International Corporation
InventorsAlbert A. Hopeman, Caleb E. Welton, Grant E. Hicks
Life of this patent
Estimating the term…
Loading patent…
AssigneeOracle International Corporation
InventorsAlbert A. Hopeman, Caleb E. Welton, Grant E. Hicks
Estimating the term…
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.
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:
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:
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:
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:
Dependencies are inferred from the claim text.