Name
Abstract | ||
|---|---|---|
In OLAP, analysts often select an interesting sample of the data. For example, an analyst might focus on products bringing revenues of at least 100 000 dollars, or on shops having sales greater than 400 000 dollars. However, current systems do not allow the application of both of these thresholds simultaneously, selecting products and shops satisfying both thresholds. For such purposes, we introduce the diamond cube operator, filling a gap among existing data warehouse operations. Because of the interaction between dimensions the computation of diamond cubes is challenging. We compare and test various algorithms on large data sets of more than 100 million facts. We find that while it is possible to implement diamonds in SQL, it is inefficient. Indeed, our custom implementation can be a hundred times faster than popular database engines (including a row-store and a column-store). |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.datak.2013.01.001 | Data Knowl. Eng. |
DocType | Volume | ISSN |
Journal | 86 | Data & Knowledge Engineering, Volume 86, July 2013, Pages 1-18 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hazel Webb | 1 | 3 | 1.40 |
| Daniel Lemire | 2 | 821 | 52.14 |
| Owen Kaser | 3 | 325 | 24.02 |