
Open access research
publication repository
publication repository
Webb, Hazel; Kaser, Owen, & Lemire, Daniel (2008). Pruning Attributes From Data Cubes with Diamond Dicing. In IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications. ACM International Conference Proceeding Series.
File(s) available for this item:PDF - 0805.0747v1.pdf |
|
Item Type: | Papers in Conference Proceedings |
---|---|
Refereed: | Yes |
Status: | Published |
Abstract: | Data stored in a data warehouse are inherently multidimensional, but most data-pruning techniques (such as iceberg and top-k queries) are unidimensional. However, analysts need to issue multidimensional queries. For example, an analyst may need to select not just the most profitable stores or--separately--the most profitable products, but simultaneous sets of stores and products fulfilling some profitability constraints. To fill this need, we propose a new operator, the diamond dice. Because of the interaction between dimensions, the computation of diamonds is challenging. We present the first diamond-dicing experiments on large data sets. Experiments show that we can compute diamond cubes over fact tables containing 100 million facts in less than 35 minutes using a standard PC. |
Depositor: | Lemire, Daniel |
Owner / Manager: | Daniel Lemire |
Deposited: | 24 Jul 2014 18:15 |
Last Modified: | 16 Jul 2015 00:47 |
![]() |
RÉVISER |