An Implementation for Subcube Based Query Processing

Abstract

Data cube materialization is commonly used in reducing OLAP response time. However, materializing a whole data cube requires large disk space as the focus on the interested subjects results in only a small portion of data cubes being frequently accessed. The subcube, a finer partition of a data cube, is proposed. The subcubes are formed from multi-dimensional queries, and the number of subcubes grows when various queries issued by users with different dimension levels and value ranges. The management framework of these subcubes is important. The technique for searching the subcubes directly affects the query performance, and therefore binary trees and linked lists are used to manage the subcubes. For saving the query processing time, an algorithm for searching appropriate subcubes is proposed.