compressing data cube in parallel olap systems
Clicks: 142
ID: 140372
2007
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Popular Article
30.0
/100
142 views
21 readers
AI Quality Assessment
Not analyzed
Readership in this journal
PopularRanked #253 of 292 articles by views in Proceedings of the National Academy of Sciences of the United States of America
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 292 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
This paper proposes an efficient algorithm to compress the cubes in the progress of the parallel data cube generation. This low overhead compression mechanism provides block-by-block and record-by-record compression by using tuple difference coding techniques, thereby maximizing the compression ratio and minimizing the decompression penalty at run-time. The experimental results demonstrate that the typical compression ratio is about 30:1 without sacrificing running time. This paper also demonstrates that the compression method is suitable for Hilbert Space Filling Curve, a mechanism widely used in multi-dimensional indexing.
| Reference Key |
dehne2007datacompressing
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Frank Dehne;Todd Eavis;Boyong Liang |
| Journal | Proceedings of the National Academy of Sciences of the United States of America |
| Year | 2007 |
| DOI |
10.2481/dsj.6.S184
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.