On 11/04/2019 17:54, Tom Lane wrote:
Ashwin Agrawal <aagra...@pivotal.io> writes:
Thank you for trying it out. Yes, noticed for certain patterns pg_lzcompress()
actually requires much larger output buffers. Like for one 86 len source it
required 2296 len output buffer. Current zedstore code doesn’t handle this case
and errors out. LZ4 for same patterns works fine, would highly recommend using
LZ4 only, as anyways speed is very fast as well with it.
You realize of course that *every* compression method has some inputs that
it makes bigger. If your code assumes that compression always produces a
smaller string, that's a bug in your code, not the compression algorithm.
Of course. The code is not making that assumption, although clearly
there is a bug there somewhere because it throws that error. It's early
days..
In practice it's easy to weasel out of that, by storing the data
uncompressed, if compression would make it longer. Then you need an
extra flag somewhere to indicate whether it's compressed or not. It
doesn't break the theoretical limit because the actual stored length is
then original length + 1 bit, but it's usually not hard to find a place
for one extra bit.
- Heikki
