Constrained Closed Datacubes

@inproceedings{Nedjar2010ConstrainedCD,
  title={Constrained Closed Datacubes},
  author={S{\'e}bastien Nedjar and Alain Casali and Rosine Cicchetti and Lotfi Lakhal},
  booktitle={ICFCA},
  year={2010}
}
This paper focuses on borders and lossless representations for Constrained Datacubes of database relations, which can represent many-valued contexts. The final goal is to optimize both storage space and computation time. First we study the succinct representation through the borders Lower / Upper and Upper$^\sharp$ / Upper. However, these borders are not information-lossless. Therefore, by using the concept of cube closure, from a FCA perspective, we define three new information lossless… 
View via Publisher
page-one.springer.com
2 Citations

2 Citations

Constrained Closed and Quotient Cubes
TLDR
This chapter introduces two new and reduced representations without measure loss for the Constrained Cube, which use the borders, classical in data mining, to support classification tasks and the relationship between the two introduced representations and the one based on the borders.
The Agree Concept Lattice for Multidimensional Database Analysis
TLDR
The proposed structures smartly solve the problem of partial materialization of SKYCUBE with reconstruction guarantee and provide a formal framework which makes it possible to improve computation time, reduce representation and easily navigate through the Hasse diagram.

References

SHOWING 1-10 OF 18 REFERENCES
Exact and Approximate Sizes of Convex Datacubes
TLDR
This paper proposes a sound characterization, based on inclusion-exclusion principle, of the exact size of convex cube as long as an upper bound which can be very quickly yielded and adapts the nearly optimal algorithm HyperLogLog in order to provide a very good approximation.
Closed Cube Lattices
TLDR
The Quotient Cube is a succinct summary of a Data Cube preserving the Rollup/Drilldown semantics and it is shown that the Quo- tient Cube, provided with a closure-based characterization, can be derived from the Closed Cube.
Bottom-up computation of sparse and Iceberg CUBE
TLDR
The pruning in BUC, combined with an efficient sort method, enables BUC to outperform all previous algorithms for sparse CUBEs, even for computing entire CUBes, and to dramatically improve Iceberg-CUBE computation.
Extracting semantics from data cubes using cube transversals and closures
TLDR
The quotient cube is a succinct summary of a datacube preserving the Rollup/Drilldown semantics, and a new characterization of boundary sets which provide a condensed representation of version spaces used to enhance supervised classification.
Convex Cube: Towards a Unified Structure for Multidimensional Databases
TLDR
The concept of convex cube is introduced which captures all the tuples satisfying a monotone and/or antimonotone constraint combination in order to optimize both computation time and required storage space.
Quotient Cube: How to Summarize the Semantics of a Data Cube
Emerging Cubes: Borders, size estimations and lossless reductions
Reduced representations of Emerging Cubes for OLAP database mining
TLDR
Two new and reduced representations without measure loss are introduced: the L-Emerging Closed Cube and Emerging Quotient Cube, and the relationship between the introduced representations is state.
Cube Lattices: A Framework for Multidimensional Data Mining
TLDR
This paper proposes a foundation for various multidimensional data mining problems by introducing a new algebraic structure called cube lattice which characterizes the search space to be explored which takes into consideration monotone and/or antimonotone constraints enforced when mining multiddimensional patterns.
Computing iceberg concept lattices with T
...
...