由网友(一生足矣)分享简介：我在寻找一种算法，以数据DECOM preSS块（1K-30K）实时以最小的开销。 COM pression应该preferably是快，但并不像DECOM pression速度一样重要。I'm looking for an algorithm to decompress chunks of data (1k-30k...

我在寻找一种算法，以数据DECOM preSS块（1K-30K）实时以最小的开销。 COM pression应该preferably是快，但并不像DECOM pression速度一样重要。

I'm looking for an algorithm to decompress chunks of data (1k-30k) in real time with minimal overhead. Compression should preferably be fast but isn't as important as decompression speed.

从我能收集LZO1X将是最快的国家之一。我错过了什么？理想的算法是不遵循GPL。

From what I could gather LZO1X would be the fastest one. Have I missed anything? Ideally the algorithm is not under GPL.

感谢。

推荐答案

试用谷歌的斯纳皮。

斯纳皮是一个COM pression / DECOM pression库。它的目的不是获得最大的玉米pression，或兼容任何其他COM pression库;相反，它的目的是为非常高的速度，合理的COM pression。例如，相比的zlib最快的模式，斯纳皮是一个数量级，以适合大多数输入，但所得到的玉米pressed文件是从20％到更大的100％的任何位置。在酷睿i7处理器的64位模式下的单核，在500 MB /秒以上。斯纳皮COM presses在约250 MB /秒以上，DECOM presses

Snappy is a compression/decompression library. It does not aim for maximum compression, or compatibility with any other compression library; instead, it aims for very high speeds and reasonable compression. For instance, compared to the fastest mode of zlib, Snappy is an order of magnitude faster for most inputs, but the resulting compressed files are anywhere from 20% to 100% bigger. On a single core of a Core i7 processor in 64-bit mode, Snappy compresses at about 250 MB/sec or more and decompresses at about 500 MB/sec or more.