The Research on the Partition for Aggregation Range Queries in Data Cube
Shi Zhi · 2007
A range sum query is one of effective tools to analyze data in data cubes. Pre-computing can speed response times of range query through computing and storing the query result on-the-fly. The researches on pre-computing based on MOLAP are mostly based on technologies of prefix sum and partition recently. This paper works on partition scheme and analyzes the methods and capabilities of current technologies of partition. Two new methods of partition are put forward in this paper. They are nesting partition and partition based on the border of prefix region respectively. This paper discusses constitution and characteristic of two methods and it shows that they bring forward the new means to partition in data cube and supplement the current methods of partition.