The rapid expansion of big data demands compression algorithms that balance efficiency and effectiveness. However, selecting the appropriate algorithm is challenging due to inherent trade-offs between speed and compression ratio, further complicated by varying hardware environments. This paper presents Compression Scope, an interactive system for exploring these trade-offs through benchmarking, visualization, and analysis. The system can run predefined compression tasks on heterogeneous servers, demonstrate results through intuitive charts and highlight Pareto-optimal algorithms for data-driven decision-making, supporting aggregation, trend exploration, and exportable plots. By integrating automated benchmarking with interactive trade-off analysis, it empowers users to identify compression algorithms suited to their specific performance and resource constraints.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Compression Scope: An Interactive Demonstration for Visualizing Performance Trade-Offs of Compression Algorithms

  • Benzhao Tang,
  • Shiyu Yang,
  • Zhitao Shen

摘要

The rapid expansion of big data demands compression algorithms that balance efficiency and effectiveness. However, selecting the appropriate algorithm is challenging due to inherent trade-offs between speed and compression ratio, further complicated by varying hardware environments. This paper presents Compression Scope, an interactive system for exploring these trade-offs through benchmarking, visualization, and analysis. The system can run predefined compression tasks on heterogeneous servers, demonstrate results through intuitive charts and highlight Pareto-optimal algorithms for data-driven decision-making, supporting aggregation, trend exploration, and exportable plots. By integrating automated benchmarking with interactive trade-off analysis, it empowers users to identify compression algorithms suited to their specific performance and resource constraints.