首个评估多媒体云存储布局的基准,揭示不同组织方式的性能差异。
LayoutBench: Performance Benchmarking of Cloud Storage Layouts for Multimedia Data
- 设计三类存储布局:单对象、tar打包、Parquet列式。
- L2在中小规模查询中延迟最低,但大规模时优势消失;L3大查询最快但数据传输多、内存消耗大。
- 数据传输成本占主导,L3成本比L1/L2高一个数量级,适合大数据集分析场景。
现代多媒体机器学习任务越来越多地将大规模数据集存储于云对象存储服务(如AWS S3)。数据在存储中的物理组织方式(即存储布局)直接影响检索速度与成本。然而,现有基准主要针对数据库引擎和查询处理,缺乏对多媒体数据检索布局的系统评估。本文提出LayoutBench,首个专为此目标设计的基准。它评估三种典型布局策略:将每个样本作为独立对象(L1)、将样本按顺序打包进tar归档(L2)、将样本以列式组织成Parquet文件(L3)。基于ImageNet数据集,在6种AWS EC2实例配置(覆盖不同网络带宽与内存层级)下,使用11种不同结果集大小的查询进行测试。实验表明,L2通过连接复用实现更低延迟,但大规模检索时优势减弱;L3在超大规模检索中最快,但因行组粒度导致数据传输量显著增加,且内存开销大。所有布局中,数据传输成本均占总支出主导地位,其中L3成本为L1或L2的约10倍。
原文摘要 · Abstract (English)
Modern multimedia machine learning workloads increasingly store large-scale datasets in cloud object storage services such as AWS S3. How these samples are physically organized in storage (i.e.,storage layout) directly affects how quickly and cheaply they can be retrieved. Yet the benchmarks used to guide storage decisions today focus on database engines and query processing, and none systematically evaluates how different storage layouts perform for multimedia data retrieval. We present LayoutBench, the first benchmark designed to fill this gap. It evaluates three representative layout strategies: storing each sample as an individual object (L1), sequentially packing samples into tar archives (L2), and organizing samples as columns in Parquet files (L3). We measure retrieval time, data transferred, and monetary cost using 11 queries of varying result-set sizes on ImageNet across six AWS EC2 instance configurations that span different network bandwidth and memory tiers. Our experiments reveal that L2 achieves lower latency than L1 and L3 through connection reuse, but loses this advantage as retrieval sizes become very large. L3 is the fastest for very large retrievals but transfers substantially more data across all query sizes due to row-group granularity, and requires significantly more memory. Across all layouts, data transfer cost dominates total expenditure, with L3 costing an order of magnitude more than L1 or L2.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。