Article

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

Authors:

Zhuo Wang,

Ye XuAuthors Info & Claims

ICICSE '08: Proceedings of the 2008 International Conference on Internet Computing in Science and Engineering

Pages 60 - 67

https://doi.org/10.1109/ICICSE.2008.35

Published: 28 January 2008 Publication History

Publisher Site

Abstract

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.

Cited By

View all

Zhao QZhu YWan DTang S(2018)A Closed Frag-Shells Cubing Algorithm on High Dimensional and Non-Hierarchical Data SetsProceedings of the 12th International Conference on Ubiquitous Information Management and Communication10.1145/3164541.3164585(1-8)Online publication date: 5-Jan-2018
https://dl.acm.org/doi/10.1145/3164541.3164585
Tang SWan DZhu YYao J(2017)Frag-shells cube based on hierarchical dimension encoding treeProceedings of the 11th International Conference on Ubiquitous Information Management and Communication10.1145/3022227.3022229(1-9)Online publication date: 5-Jan-2017
https://dl.acm.org/doi/10.1145/3022227.3022229

Index Terms

Minimal Condensed Cube: Data Organization, Fast Computation, and Incremental Update
1. Information systems
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory
      1. Database query processing and optimization (theory)

Recommendations

Condensed Cube: An Efficient Approach to Reducing Data Cube Size
ICDE '02: Proceedings of the 18th International Conference on Data Engineering

Pre-computed data cube facilitates OLAP (On-Line Analytical Processing). It is a well-known fact that data cube computation is an expensive operation, which attracts a lot of attention. While most proposed algorithms devoted themselves to optimizing ...
Graph cube: on warehousing and OLAP multidimensional networks
SIGMOD '11: Proceedings of the 2011 ACM SIGMOD International Conference on Management of data

We consider extending decision support facilities toward large sophisticated networks, upon which multidimensional attributes are associated with network entities, thereby forming the so-called multidimensional networks. Data warehouses and OLAP (Online ...
Semi-closed cube: an effective approach to trading off data cube size and query response time

The results of data cube will occupy huge amount of disk space when the base table is of a large number of attributes. A new type of data cube, compact data cube like condensed cube and quotient cube, was proposed to solve the problem. It compresses ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ICICSE '08: Proceedings of the 2008 International Conference on Internet Computing in Science and Engineering

January 2008

560 pages

ISBN:9780769531120

Publisher

IEEE Computer Society

United States

Publication History

Published: 28 January 2008

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zhao QZhu YWan DTang S(2018)A Closed Frag-Shells Cubing Algorithm on High Dimensional and Non-Hierarchical Data SetsProceedings of the 12th International Conference on Ubiquitous Information Management and Communication10.1145/3164541.3164585(1-8)Online publication date: 5-Jan-2018
https://dl.acm.org/doi/10.1145/3164541.3164585
Tang SWan DZhu YYao J(2017)Frag-shells cube based on hierarchical dimension encoding treeProceedings of the 11th International Conference on Ubiquitous Information Management and Communication10.1145/3022227.3022229(1-9)Online publication date: 5-Jan-2017
https://dl.acm.org/doi/10.1145/3022227.3022229

Abstract

Cited By

Index Terms

Recommendations

Condensed Cube: An Efficient Approach to Reducing Data Cube Size

Graph cube: on warehousing and OLAP multidimensional networks

Semi-closed cube: an effective approach to trading off data cube size and query response time

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations