Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1007/3-540-48050-1_28 | ISMIS |
Keywords | Field | DocType |
loss-less condensed representation,computing full,algorithm ccube,critical problem,datacube characterization,condensed representation,storage explosion problem,iceberg datacubes,novel characterization,o cost,iceberg cuboids | Tuple,Computer science,Computer data storage,Algorithm,Formal concept analysis,Data cube,Recursion,Traverse,Scalability,Computation | Conference |
Volume | ISSN | ISBN |
2366 | 0302-9743 | 3-540-43785-1 |
Citations | PageRank | References |
5 | 0.49 | 15 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marc Laporte | 1 | 5 | 0.83 |
| Noel Novelli | 2 | 127 | 37.10 |
| Rosine Cicchetti | 3 | 453 | 175.14 |
| Lotfi Lakhal | 4 | 2245 | 313.14 |