JCSE, vol. 1, no. 2, pp.195-210, December, 2007

DOI:

A Clustered Dwarf Structure to Speed up Queries on Data Cubes

Yubin Bao, Fangling Leng, Daling Wang, Ge Yu
School of ISE, Northeastern University, P.R.China

Abstract: Dwarf is a highly compressed structure, which compresses the cube by eliminating the semantic redundancies while computing a data cube. Although it has high compression ratio, Dwarf is slower in querying and more difficult in updating due to its structure characteristics. We all know that the or iginal intention of data cube is to speed up the query performance, so we propose two novel clustering methods for query optimization: the recursion clustering method which clusters the nodes in a recursive manner to speed up point queries and the hierarchical clustering method which clusters the nodes of the same dimension to speed up range queries. To facilitate the implementation, we design a partition strategy and a logical clustering mechanism. Experimental results show our methods can effectively improve the query performance on data cubes, and the recursion clustering method is suitable for both point queries and range queries.

Keyword: No keyword

Full Paper:   150 Downloads, 4470 View