On 7/9/12 8:18 PM, Valentin Haenel wrote:
> Hi,
>
> I stumbled upon snappy [1][2] today and decided to do some
> back-of-the-envelope benchmarks:
>
>>>> import numpy, snappy, blosc
>>>> s = numpy.linspace(0,1,1e7).tostring()
> 10 loops, best of 3: 199 ms per loop
>>>> %timeit br = blosc.compress(s, 8)
> 10 loops, best of 3: 32.8 ms per loop
>>>> sr = snappy.compress(s)
>>>> len(sr)/float(len(s))
>>>> 0.
9309533375
>>>> br = blosc.compress(s, 8)
>>>> len(br)/float(len(s))
>>>> 0.0885326125
> What do you think. Seems to good to be true?
Well, this specific example is actually true. But that is expected, as
is actually pretty good for blosc. Compressing other data patters will