Configurable space-time performance trade-off in multidimensional data base systems
View Patent ↗A multi-dimensional database includes data organized into hierarchical levels. For each level within a dimension, predefined thresholds are set to determine which intersections are precomputed and which are not. The general result is to precompute intersections which take relatively longer to compute at run time, and to not precompute intersections which can be calculated relatively quickly at run time. When multiple dimensions of data are provided, a step-by-step process uses the level threshold for each dimension to determine whether data is to be prestored at an intersection. An odd-even calculation insures that computations performed at run time are relatively efficient. The technique results in good run time response, while not requiring maximum storage or recalculation time for data updates. By adjusting the thresholds at the individual dimension level, response of the multi-dimensional database can be changed as desired.
1. In a multidimensional database in which data is provided in hierarchical levels, a method comprising the steps of:
setting a threshold value for a selected level;
for each member of the selected level that has more descendants than the level threshold value, aggregating a data measure for all descendants of the member, and storing the aggregated value with the member.
2. The method of claim 1 , wherein for members of the selected level having less descendants than the threshold value, not aggregating or storing the data measure with the member.
3. The method of claim 1 , wherein more than one level is assigned a threshold.
4. The method of claim 3 , wherein at least two distinct levels have thresholds set at different values.
5. The method of claim 1 , wherein the step of aggregating the data measure comprises the step of precalculating the data measure for all descendants of the member, and the storing step comprises storing the precalculated data measure with the member.
6. The method of claim 5 , wherein the precalculating step comprises summing the data measure for all descendants of the member.
7. The method of claim 1 , wherein the step of aggregating the data measure comprises summing the data measure for all descendants of the member.
8. The method of claim 1 further comprising the step of, for each member of the database:
defining a count for that member to be 1 if the member has no children;
defining a count for that member to be equal to the sum of counts for all children of the member; and
resetting the count for a member to 1 if its count exceeds the threshold, and contemporaneously aggregating the data measure for all descendants of the member.
9. A database system, comprising:
a multidimensional database having a plurality of database intersections, the intersections having data organized as hierarchical levels having members;
for each member, a count value indicating a number of descendant members required to compute the member, a flag indicating whether the member is stored or not stored, and a value indicating a child level of the member to be accessed;
for each level, a threshold value; and
a procedure for, when count values for a member's children sum to a value greater than the threshold value for the member, storing a precalculated aggregated data measure for the descendants of the member into the member.
10. The system of claim 9 , wherein each level has a threshold value that is independent of the threshold values for the remaining levels.
11. Software for aggregating multidimensional data provided in hierarchical levels, the software embodied in a computer-readable medium and, when executed, operable to:
receive a threshold value for a selected level;
for each member of the selected level that has more descendants than the level threshold value, aggregating a data measure for all descendants of the member, and storing the aggregated value with the member.
12. The software of claim 11 , operable to not aggregate or store the data measure with the member for members of the selected level having less descendants than the threshold value.
13. The software of claim 11 , wherein a threshold value is received for more than one level.
14. The software of claim 13 , wherein at least two distinct levels have thresholds set at different values.
15. The software of claim 11 , wherein:
aggregating the data measure comprises precalculating the data measure for all descendants of the member; and
storing the aggregated value comprises storing the precalculated data measure with the member.
16. The software of claim 15 , wherein precalculating comprises summing the data measure for all descendants of the member.
17. The software of claim 11 , wherein aggregating the data measure comprises summing the data measure for all descendants of the member.
18. The software of claim 11 further operable to, for each member of the database:
define a count for that member to be 1 if the member has no children;
define a count for that member to be equal to the sum of counts for all children of the member; and
reset the count for a member to 1 if its count exceeds the threshold, and contemporaneously aggregating the data measure for all descendants of the member.