Re: Compression and on-disk sorting

From: Hannu Krosing <hannu(at)skype(dot)net>
To: Zeugswetter Andreas DCP SD <ZeugswetterA(at)spardat(dot)at>
Cc: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, Greg Stark <gsstark(at)mit(dot)edu>, Andrew Piskorski <atp(at)piskorski(dot)com>, pgsql-hackers(at)postgresql(dot)org
Subject: Re: Compression and on-disk sorting
Date: 2006-05-17 11:10:07
Message-ID: 1147864208.3830.4.camel@localhost.localdomain
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

Ühel kenal päeval, K, 2006-05-17 kell 12:20, kirjutas Zeugswetter
Andreas DCP SD:
> > Certainly, if you can't prototype a convincing performance win using
> > that algorithm, it's unlikely to be worth anyone's time to
> > look harder.
>
> That should be easily possible with LZO. It would need to be the lib
> that
> we can optionally link to (--with-lzo), since the lib is GPL.
>
> lzo even allows for inplace decompression and overlapping compression.

Does being GPL also automatically imply that it is patent-free, so that
we could re-implement it under BSD license if it gives good results?

------------
Hannu

In response to

Browse pgsql-hackers by date

  From Date Subject
Next Message Zeugswetter Andreas DCP SD 2006-05-17 11:47:17 Re: Compression and on-disk sorting
Previous Message Andrew Dunstan 2006-05-17 10:40:38 Re: PL/pgSQL 'i = i + 1' Syntax