The partition model: a deductive database model
ACM Transactions on Database Systems (TODS)
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Quasi-cubes: exploiting approximations in multidimensional databases
ACM SIGMOD Record
Bottom-up computation of sparse and Iceberg CUBE
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions
Journal of the ACM (JACM)
Data mining: concepts and techniques
Data mining: concepts and techniques
Efficient computation of Iceberg cubes with complex measures
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals
Data Mining and Knowledge Discovery
Levelwise Search and Borders of Theories in KnowledgeDiscovery
Data Mining and Knowledge Discovery
Complex Aggregation at Multiple Granularities
EDBT '98 Proceedings of the 6th International Conference on Extending Database Technology: Advances in Database Technology
Fast Computation of Sparse Datacubes
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Computing Iceberg Queries Efficiently
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Decision Tables: Scalable Classification Exploring RDBMS Capabilities
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Mining Multi-Dimensional Constrained Gradients in Data Cubes
Proceedings of the 27th 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
Serving Datacube Tuples from Main Memory
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Extracting Decision Correlation Rules
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
The agree concept lattice for multidimensional database analysis
ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
| Hi-index | 0.00 |
In this paper, we propose a sound approach and an algorithm for computing a condensed representation of either full or iceberg datacubes. A novel characterization of datacubes based on dimensional-measurable partitions is introduced. From such partitions, iceberg cuboids are achieved by using constrained product linearly in the number of tuples. Moreover, our datacube characterization provides a loss-less condensed representation specially suitable when considering the storage explosion problem and the I/O cost. We show that our algorithm CCUBE turns out to an operational solution more efficient than competive proposals. It enforces a lecticwise and recursive traverse of the dimension set lattice and takes into account the critical problem of memory limitation. Our experimental results shows that CCUBE is a promising candidate for scalable computation.