一句话:提出 Fusion,一种面向擦除编码数据查询下推优化的分析型对象存储,通过协同设计纠删码与文件布局降低延迟。
公有云解耦存储使 OLAP 数据库处理大对象上的即席、高选择性查询时延迟升高。将谓词下推到存储层可缓解,但在擦除编码存储中,对象被切分为固定大小块并分散到多节点,查询局部数据仍需跨节点重组,网络延迟显著。Fusion 是面向分析、针对擦除编码数据优化查询下推的对象存储。它协同设计纠删码与文件放置拓扑,结合 Parquet 等格式,提出新的条带构建算法,避免对象内可计算单元碎片化并降低存储开销。在 TPC-H 上中位与尾延迟分别改善 64% 和 81%,真实 SQL 查询最高改善 40% 和 48%,仅比最优多 1.2% 存储开销。
The prevalence of disaggregated storage in public clouds has led to increased latency in modern OLAP cloud databases, particularly when handling ad-hoc and highly-selective queries on large objects. To address this, cloud databases have adopted computation pushdown, executing query predicates closer to the storage layer. However, existing pushdown solutions are inefficient in erasure-coded storage. Cloud storage employs erasure coding that partitions analytics file objects into fixed-sized blocks and distributes them across storage nodes. Consequently, when a specific part of the object is queried, the storage system must reassemble the object across nodes, incurring significant network latency. In this work, we present Fusion, an object store for analytics that is optimized for query pushdown on erasure-coded data. It co-designs its erasure coding and file placement topologies, taking into account popular analytics file formats (e.g., Parquet). Fusion employs a novel stripe construction algorithm that prevents fragmentation of computable units within an object, and minimizes storage overhead during erasure coding. Compared to existing erasure-coded stores, Fusion improves median and tail latency by 64% and 81%, respectively, on TPC-H, and up to 40% and 48% respectively, on real-world SQL queries. Fusion achieves this while incurring a modest 1.2% storage overhead compared to the optimal.