Name
Abstract | ||
|---|---|---|
Data stored in a data warehouse are inherently multidimensional, unlike most data-pruning techniques (such as iceberg and top-k queries). 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. Our external memory algorithm avoids potentially expensive random accesses. Experiments show that we can compute diamond cubes over fact tables containing 100 million facts and 500,000 distinct attribute values in less than an hour using a single-core PC. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1145/1451940.1451958 | international database engineering and applications symposium |
Keywords | DocType | Volume |
profitable store,data-pruning technique,diamond-dicing experiment,diamond dice,profitable product,pruning attribute value,data warehouses,diamond cube,data warehouse,large data set,multidimensional query,information retrieval,distinct attribute value,diamond dicing,olap,data cube,algorithms | Conference | abs/0805.0747 |
Citations | PageRank | References |
3 | 0.39 | 27 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hazel Webb | 1 | 3 | 1.40 |
| Owen Kaser | 2 | 325 | 24.02 |
| Daniel Lemire | 3 | 34 | 7.76 |