Indexing and incremental updating condensed data cube

Authors:
Jianlin Feng;Hongjie Si;Yucai Feng
Affiliations:
Huazhong Univ. of Sci. & Tech.;Huazhong Univ. of Sci. & Tech.;Huazhong Univ. of Sci. & Tech.
Venue:
SSDBM '03 Proceedings of the 15th International Conference on Scientific and Statistical Database Management
Year:
2003

Citing 0
Cited 4

PrefixCube: prefix-sharing condensed data cube

Proceedings of the 7th ACM international workshop on Data warehousing and OLAP
Supporting the data cube lifecycle: the power of ROLAP

The VLDB Journal — The International Journal on Very Large Data Bases
Compressing multidimensional structures: a case study

ECC'09 Proceedings of the 3rd international conference on European computing conference
Revisiting the cube lifecycle in the presence of hierarchies

The VLDB Journal — The International Journal on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

OLAP(On-Line Analytical Processing) servers usually precompute data cubes to improve the response time of possible aggregate queries over cuboids with different grouping attributes. To reduce the huge size of a sparse data cube, the base single tuples (BSTs) are explored to condense cube tuples aggregated from the same set of source tuples into one tuple, whenever such condensing will not require further aggregate when the cube is used to answer queries. In this paper, we propose the CuboidTree to index the BST condensed cube. Using both synthetic and real world data, we conducted experiments to demonstrate query processing and bulk incremental updating performance of the indexing scheme.