Open access research
publication repository

Diamond dicing [r-libre/195]

Webb, Hazel; Lemire, Daniel, & Kaser, Owen (2013). Diamond dicing. Data & Knowledge Engineering, 86. https://doi.org/10.1016/j.datak.2013.01.001

File(s) available for this item:
[img]  PDF - 1006.3726v3.pdf  
Item Type: Journal Articles
Refereed: Yes
Status: Published
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, or on shops having sales greater than $400,000. 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).
Official URL: http://www.sciencedirect.com/science/article/pii/S...
Depositor: Lemire, Daniel
Owner / Manager: Daniel Lemire
Deposited: 14 Jul 2014 20:13
Last Modified: 16 Jul 2015 00:46

Actions (login required)