Efficiently computing iceberg cubes with complex constraints through bounding
From MaRDI portal
Recommendations
Cited in
(7)- An efficient algorithm for generating symmetric ice piles
- Computing full and iceberg datacubes using partitions
- Efficient computation of hierarchical prefixcube
- An iceberg cube algorithm for large compressed data warehouses
- Efficient constraint-based exploratory mining on large data cubes
- scientific article; zbMATH DE number 2101363 (Why is no real title available?)
- scientific article; zbMATH DE number 2112330 (Why is no real title available?)
This page was built for publication: Efficiently computing iceberg cubes with complex constraints through bounding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4424038)