arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1307.3872cs.ITcs.DSmath.IT
收藏

双准则数据压缩

Bicriteria data compression

Andrea Farruggia, Paolo Ferragina, Antonio Frangioni, Rossano Venturini

摘要:

大规模数据集的出现(以及随之而来的高性能分布式存储系统的设计)重新点燃了科学和工程界对无损数据压缩器的设计的兴趣,这些压缩器可以实现有效的压缩比和非常有效的解压缩速度。Lempel-Ziv的LZ 77算法是这种情况下的实际选择,因为它的解压缩速度和它在解压缩速度与压缩空间效率之间的灵活性。现有的每种实现都在空间占用和解压缩速度之间进行权衡,因此软件工程师必须通过选择更接近其应用程序要求的实现来满足自己。从这些前提出发,并在文献中首次,我们在本文中解决的问题,交易最佳,并在一个原则性的方式,这两个资源的消耗,通过引入Bicriteria LZ 77-解析问题,这正式在一个原则性的方式什么数据压缩器传统上接近的方法,通过语法。我们的目标是确定一个LZ 77解析,它最大限度地减少压缩文件的位空间占用,前提是解压缩时间由一个固定的量限制(反之亦然)。通过这种方式,软件工程师可以设置其空间(或时间)要求,然后导出优化解压缩速度(或空间占用)的LZ 77解析。我们有效地解决了这个问题,在O(n log^2 n)的时间和最佳线性空间内的一个小的,添加剂的近似,通过证明和部署一些特定的结构性质的加权图来自可能的LZ 77-解析的输入文件。初步的实验表明,我们的新方案优于所有高度工程化的竞争对手,因此在理论和实践中提供了一个双赢的局面。

英文摘要:

The advent of massive datasets (and the consequent design of high-performing distributed storage systems) have reignited the interest of the scientific and engineering community towards the design of lossless data compressors which achieve effective compression ratio and very efficient decompression speed. Lempel-Ziv's LZ77 algorithm is the de facto choice in this scenario because of its decompression speed and its flexibility in trading decompression speed versus compressed-space efficiency. Each of the existing implementations offers a trade-off between space occupancy and decompression speed, so software engineers have to content themselves by picking the one which comes closer to the requirements of the application in their hands. Starting from these premises, and for the first time in the literature, we address in this paper the problem of trading optimally, and in a principled way, the consumption of these two resources by introducing the Bicriteria LZ77-Parsing problem, which formalizes in a principled way what data-compressors have traditionally approached by means of heuristics. The goal is to determine an LZ77 parsing which minimizes the space occupancy in bits of the compressed file, provided that the decompression time is bounded by a fixed amount (or vice-versa). This way, the software engineer can set its space (or time) requirements and then derive the LZ77 parsing which optimizes the decompression speed (or the space occupancy, respectively). We solve this problem efficiently in O(n log^2 n) time and optimal linear space within a small, additive approximation, by proving and deploying some specific structural properties of the weighted graph derived from the possible LZ77-parsings of the input file. The preliminary set of experiments shows that our novel proposal dominates all the highly engineered competitors, hence offering a win-win situation in theory&practice.

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

↑