Bottom-up computation of sparse and Iceberg CUBE
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Machine Learning
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals
Data Mining and Knowledge Discovery
Data Mining: Concepts and Techniques
Data Mining: Concepts and Techniques
Stream Cube: An Architecture for Multi-Dimensional Analysis of Data Streams
Distributed and Parallel Databases
Quotient cube: how to summarize the semantics of a data cube
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Emerging cubes for trends analysis in OLAP databases
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
Upper Borders for Emerging Cubes
DaWaK '08 Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery
What Can Formal Concept Analysis Do for Data Warehouses?
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
Exact and Approximate Sizes of Convex Datacubes
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
Emerging cubes for trends analysis in OLAP databases
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
Constrained Cube Lattices for Multidimensional Database Mining
International Journal of Data Warehousing and Mining
| Hi-index | 0.00 |
In various approaches, data cubes are pre-computed in order to efficiently answer Olap queries. Such cubes are also successfully used for multidimensional analysis of data streams. The notion of data cube has been explored in various ways: iceberg cubes, range cubes, differential cubes or emerging cubes. In this paper, we introduce the concept of convex cube which captures all the tuples satisfying a monotone and/or antimonotone constraint combination. It can be represented in a very compact way in order to optimize both computation time and required storage space. The convex cube is not an additional structure appended to the list of cube variants but we propose it as a unifying structure that we use to characterize, in a simple, sound and homogeneous way, the other quoted types of cubes.