By Topic

Minimal Condensed Cube: Data Organization, Fast Computation, and Incremental Update

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhuo Wang ; Sch. of Inf. Sci. & Eng., Shenyang Ligong Univ., Shenyang ; Ye Xu

The condensed cube has been proposed to reduce the huge size of data cubes in OLAP system. The intuition of condensed cube is to compress semantically redundant tuples into their representative base single tuples (BSTs). However, previous studies showed that a minimal condensed cube is expensive to compute, and thus mainly concentrated on alternative computation methods for non-minimal condensed cube, which does not guarantee to find and compress all BSTs. In this paper, we focus on the minimal condensed cube and address several practical issues, including physical organization, fast computation, and incremental update. Experiments on both synthetic and real-world datasets show that our proposed algorithms outperform previous methods by a large margin.

Published in:

Internet Computing in Science and Engineering, 2008. ICICSE '08. International Conference on

Date of Conference:

28-29 Jan. 2008