钻石切割
Diamond Dicing
摘要:
在OLAP中,分析人员通常会选择一个有趣的数据样本。例如,分析师可能会关注至少带来10万美元收入的产品,或者销售额超过40万美元的商店。然而,目前的系统不允许同时应用这两个阈值,选择满足两个阈值的产品和商店。为此,我们引入了钻石立方体运算符,填补了现有的数据仓库操作之间的差距。由于维度之间的相互作用,金刚石立方体的计算具有挑战性。我们在超过1亿个事实的大数据集上比较和测试各种算法。我们发现,虽然可以在SQL中实现钻石,但效率低下。事实上,我们的自定义实现可以比流行的数据库引擎(包括行存储和列存储)快一百倍。
英文摘要:
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).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。