Multidimensional database storage and retrieval system

• US 7,165,065 B1
• Filed: 07/14/2000
• Issued: 01/16/2007
• Est. Priority Date: 07/14/2000
• Status: Expired due to Term

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle Corporation
• Inventors: Welton, Caleb E., Hopeman, Albert A., Goldberg, Andrew H.
• Primary Examiner(s): ALAM, SHAHID AL
• Application Number:
  US09/616,643
• Time in Patent Office: 2,377 Days
• Field of Search: 707 1- 10, 707/100, 707/102, 707/200, 707/205, 707/503, 707/104.1, 707/101, 711/216
• US Class Current: 1/1
• CPC Class Codes: G06F 16/283 Multi-dimensional databases or data warehouses, e.g. MOLAP or ROLAP
• CPC Class Codes: Y10S 707/99932 Access augmentation or optimizing
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface

Abstract

In a multidimensional database, an aggregation operation is performed in an optimal manner by storing the values included in the/aggregation operation on the same disk page. A sparsity manager determines aggregate values that are computed from other data values during the aggregation operation. Each aggregate value is associated with one or more data values that are used during the aggregation operation to compute the aggregate value. The sparsity manager stores the associated data values in proximity to each other, such as on the same disk page, so that multiple disk page fetches may not be required for the same set of data values during the aggregation operation. The data values used in the aggregation operation can therefore be fetched once from a disk page, and thereafter are found in memory, such as on a cache page corresponding to the disk page. In this manner, multiple fetches for the same disk page during the aggregation operation are avoided.

Claims

1. A method of storing data values in a multidimensional database comprising:

identifying a plurality of dimensions, wherein each of the dimensions is indicative of a plurality of storage locations;

identifying a hierarchy of attributes within at least one of the dimensions, wherein the hierarchy is indicative of an association between the attributes;

attributing a plurality of data values to each of the attributes;

storing the data values on a storage medium based on the data values indicated by the hierarchy and stored on the storage medium in proximity to associated data values, wherein the associated data values are attributed to associated attributes as indicated by the hierarchy, the data values further comprising aggregate values and detail values;

aggregating at least one of the dimensions having a hierarchy by traversing each of the aggregate values included in the dimension; and

including, in an aggregation total, the associated data values corresponding to the aggregate value.

2. The method of claim 1 wherein aggregating includes:

traversing, for a first aggregate value on a first level, each of the data values on a second level associated with the aggregate value; and

subsequently traversing each of the other aggregate values on the first level via traversing the data values on a second level associated with the subsequent aggregate value.

3. The method of claim 2 wherein traversing further includes

fetching, from the storage medium, a storage segment having data values corresponding to the aggregate value, wherein each of the corresponding data values are stored in an adjacency.

4. The method of claim 3 wherein the storage segment is a memory cache page.

5. The method of claim 3 wherein the storage segment is a disk page.

6. The method of claim 1 wherein associated values are retrievable by a single fetch.

7. The method of claim 1 further comprising storing related data

values adjacent to corresponding sparse data values in a sparse matrix represented in the multidimensional database.

8. The method of claim 7 further comprising storing values adjacent

to values corresponding to a common dimension of the multidimensional database.

9. A method of storing data values in a multidimensional database comprising:

identifying a plurality of dimensions, wherein each of the dimensions is indicative of a plurality of attributes associated with a data value;

identifying a hierarchy within at least one of the dimensions, wherein the

hierarchy is indicative of an association between the plurality of attributes;

assigning a plurality of data values to each of the plurality of attributes;

storing the data values on a storage medium in proximity to associated data values, wherein the associated data values are assigned to associated attributes as indicated by the hierarchy, the data values further including aggregate values and detail values;

aggregating at least one of the dimensions having a hierarchy by traversing

each of the aggregate values included in the dimension; and

including, in an aggregation total, the associated data values corresponding to the aggregate value.

10. The method of claim 9 wherein the data values further comprise aggregate values and detail values.

11. The method of claim 10 wherein the association is a parent-child association between an aggregate value and at least one child data value.

12. The method of claim 10 wherein the association is between an aggregate value and at least one data value.

13. The method of claim 10 wherein each of the data values associated with an aggregate value are stored proximate to the other data values associated with the same aggregate value as indicated by the hierarchy.

14. The method of claim 10 wherein storing further comprises storing the aggregate value on the storage medium adjacent to the associated data values.

15. The method of claim 9 further comprising storing related data

values adjacent to corresponding sparse data values in a sparse matrix represented in the multidimensional database.

16. The method of claim 15 further comprising storing values adjacent

to values corresponding to a common dimension of the multidimensional database.