A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf
.
Cross Table Cubing: Mining Iceberg Cubes from Data Warehouses
[chapter]
2005
Proceedings of the 2005 SIAM International Conference on Data Mining
All of the existing (iceberg) cube computation algorithms assume that the data is stored in a single base table, however, in practice, a data warehouse is often organized in a schema of multiple tables, such as star schema and snowflake schema. In terms of both computation time and space, materializing a universal base table by joining multiple tables is often very expensive or even unaffordable in real data warehouses. In this paper, we investigate the problem of computing iceberg cubes from
doi:10.1137/1.9781611972757.41
dblp:conf/sdm/PeiCC05
fatcat:andsaf24ufdp7hh5rdb575uyv4