arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0909.1758cs.DBcs.DScs.PF
收藏

教老大象新把戏

Teaching an Old Elephant New Tricks

Nicolas Bruno

摘要:

近年来,列存储(或简称C-store)已成为一种新的方法来处理读取为主的数据仓库应用程序。实验证据表明,对于某些类型的查询,C-store的新功能导致了传统关系引擎的数量级改进。与此同时,一些C-store的支持者认为,C-store与传统引擎有着根本的不同,因此它们的好处不能被整合到关系引擎中,除非完全重写。在本文中,我们挑战这种说法,并表明,许多好处的C-商店确实可以模拟在传统的引擎没有任何变化。然后,我们确定我们的一些局限性?纯模拟?对于更复杂的查询的情况下的方法。最后,我们预测传统的关系引擎最终将利用C存储的大部分好处,就像目前在其他领域(如XML数据)中发生的那样。

英文摘要:

In recent years, column stores (or C-stores for short) have emerged as a novel approach to deal with read-mostly data warehousing applications. Experimental evidence suggests that, for certain types of queries, the new features of C-stores result in orders of magnitude improvement over traditional relational engines. At the same time, some C-store proponents argue that C-stores are fundamentally different from traditional engines, and therefore their benefits cannot be incorporated into a relational engine short of a complete rewrite. In this paper we challenge this claim and show that many of the benefits of C-stores can indeed be simulated in traditional engines with no changes whatsoever. We then identify some limitations of our ?pure-simulation? approach for the case of more complex queries. Finally, we predict that traditional relational engines will eventually leverage most of the benefits of C-stores natively, as is currently happening in other domains such as XML data.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑