Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
An array-based algorithm for simultaneous multidimensional aggregates
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Bottom-up computation of sparse and Iceberg CUBE
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Fast Computation of Sparse Datacubes
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Materialized View Selection for Multidimensional Datasets
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
On the Computation of Multidimensional Aggregates
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
QC-trees: an efficient summary structure for semantic OLAP
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Condensed Cube: An Efficient Approach to Reducing Data Cube Size
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Quotient cube: how to summarize the semantics of a data cube
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
| Hi-index | 0.00 |
The semantic relations among cells in data cube are more important for efficient query and OLAP. Normally the size of a data cube is very huge and relations among cells are very complicated so the semantic data cube is difficult to be realized. Based on quotient cube, Semantic Data Cube (SDC) structure is put forward in this paper. In SDCthe lattice of cells is expressed as tree-hierarchy structure and each cell in lattice is replaced with its upper bound. The SDCdepicts the lattice of cells concisely and preserves all the semantic relations among cells. Applying semantics to query answering and maintaining incrementally in SDC, the time of response and the cost of updating can be reduced greatly. Algorithms of constructing SDC, answering a query and maintaining incrementally in SDCare given. The experimental results show that the SDCis effective.