FlexpushdownDB: rethinking computation pushdown for cloud OLAP DBMSs

Yifei Yang, Xiangyao Yu, Marco Serafini, Ashraf Aboulnaga, Michael Stonebraker
{"title":"FlexpushdownDB: rethinking computation pushdown for cloud OLAP DBMSs","authors":"Yifei Yang, Xiangyao Yu, Marco Serafini, Ashraf Aboulnaga, Michael Stonebraker","doi":"10.1007/s00778-024-00867-8","DOIUrl":null,"url":null,"abstract":"<p>Modern cloud-native OLAP databases adopt a <i>storage-disaggregation</i> architecture that separates the management of computation and storage. A major bottleneck in such an architecture is the network connecting the computation and storage layers. Computation pushdown is a promising solution to tackle this issue, which offloads some computation tasks to the storage layer to reduce network traffic. This paper presents <i>FlexPushdownDB</i> (<i>FPDB</i>), where we revisit the design of computation pushdown in a storage-disaggregation architecture, and then introduce several optimizations to further accelerate query processing. First, FPDB supports <i>hybrid query execution</i>, which combines local computation on cached data and computation pushdown to cloud storage at a fine granularity. Within the cache, FPDB uses a novel <i>Weighted-LFU</i> cache replacement policy that takes into account the cost of pushdown computation. Second, we design <i>adaptive pushdown</i> as a new mechanism to avoid throttling the storage-layer computation during pushdown, which pushes the request back to the computation layer at runtime if the storage-layer computational resource is insufficient. Finally, we derive a general principle to identify pushdown-amenable computational tasks, by summarizing common patterns of pushdown capabilities in existing systems, and further propose two new pushdown operators, namely, <i>selection bitmap</i> and <i>distributed data shuffle</i>. Evaluation on SSB and TPC-H shows each optimization can improve the performance by 2.2<span>\\(\\times \\)</span>, 1.9<span>\\(\\times \\)</span>, and 3<span>\\(\\times \\)</span> respectively.</p>","PeriodicalId":501532,"journal":{"name":"The VLDB Journal","volume":"205 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The VLDB Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s00778-024-00867-8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Modern cloud-native OLAP databases adopt a storage-disaggregation architecture that separates the management of computation and storage. A major bottleneck in such an architecture is the network connecting the computation and storage layers. Computation pushdown is a promising solution to tackle this issue, which offloads some computation tasks to the storage layer to reduce network traffic. This paper presents FlexPushdownDB (FPDB), where we revisit the design of computation pushdown in a storage-disaggregation architecture, and then introduce several optimizations to further accelerate query processing. First, FPDB supports hybrid query execution, which combines local computation on cached data and computation pushdown to cloud storage at a fine granularity. Within the cache, FPDB uses a novel Weighted-LFU cache replacement policy that takes into account the cost of pushdown computation. Second, we design adaptive pushdown as a new mechanism to avoid throttling the storage-layer computation during pushdown, which pushes the request back to the computation layer at runtime if the storage-layer computational resource is insufficient. Finally, we derive a general principle to identify pushdown-amenable computational tasks, by summarizing common patterns of pushdown capabilities in existing systems, and further propose two new pushdown operators, namely, selection bitmap and distributed data shuffle. Evaluation on SSB and TPC-H shows each optimization can improve the performance by 2.2\(\times \), 1.9\(\times \), and 3\(\times \) respectively.

Abstract Image

FlexpushdownDB:重新思考云 OLAP DBMS 的计算下推问题
现代云原生 OLAP 数据库采用存储-分解架构,将计算和存储管理分开。这种架构的一个主要瓶颈是连接计算层和存储层的网络。计算下推是解决这一问题的一个很有前景的方案,它可以将一些计算任务卸载到存储层,从而减少网络流量。本文介绍了 FlexPushdownDB(FPDB),我们重新审视了存储分解架构中计算下推的设计,然后引入了几种优化方法来进一步加速查询处理。首先,FPDB 支持混合查询执行,它结合了缓存数据上的本地计算和细粒度的云存储计算下推。在缓存中,FPDB 使用了一种新颖的加权-LFU 缓存替换策略,该策略考虑了下推计算的成本。其次,我们设计了自适应下推作为一种新机制,以避免在下推过程中对存储层计算的节流,如果存储层计算资源不足,则在运行时将请求推回计算层。最后,我们通过总结现有系统中常见的推送能力模式,得出了识别可推送计算任务的一般原则,并进一步提出了两个新的推送操作符,即选择位图和分布式数据洗牌。在SSB和TPC-H上的评估表明,每种优化都能将性能分别提高2.2(次)、1.9(次)和3(次)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信