From: | Daniel Farina <daniel(at)heroku(dot)com> |
---|---|
To: | Huchev <hugochevrain(at)gmail(dot)com> |
Cc: | pgsql-hackers(at)postgresql(dot)org |
Subject: | Re: Faster compression, again |
Date: | 2012-04-04 23:09:37 |
Message-ID: | CAAZKuFZ3wUT+3jRWb7ZJmybuvnVA14Hn7RR6c8YhnsNfq53V4Q@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On Tue, Apr 3, 2012 at 7:29 AM, Huchev <hugochevrain(at)gmail(dot)com> wrote:
> For a C implementation, it could interesting to consider LZ4 algorithm, since
> it is written natively in this language. In contrast, Snappy has been ported
> to C by Andy from the original C++ Google code, which lso translate into
> less extensive usage and tests.
From what I can tell, the C implementation of snappy has more tests
than this LZ4 implementation, including a fuzz tester. It's a
maintained part of Linux as well, and used for btrfs --- this is why
it was ported. The high compression version of LZ4 is apparently
LGPL. And, finally, there is the issue of patents: snappy has several
multi-billion dollar companies that can be held liable (originator
Google, as well as anyone connected to Linux), and to the best of my
knowledge, nobody has been held to extortion yet.
Consider me unconvinced as to this line of argument.
--
fdr
From | Date | Subject | |
---|---|---|---|
Next Message | Greg Stark | 2012-04-04 23:22:59 | Re: patch: bytea_agg |
Previous Message | Josh Berkus | 2012-04-04 23:06:54 | Re: patch: improve SLRU replacement algorithm |