On Fri, Jan 31, 2014 at 3:51 AM, Peter Geoghegan wrote:
>> Now, I haven't checked if it's already done. Sorry if it is. I did
>> mock around btree code a lot and don't remember any of this, but I do
>> remember stuff that could be used to achieve it (specifically, all the
>> index-only-scan machin
On Thu, Jan 30, 2014 at 9:26 PM, Claudio Freire wrote:
> Maybe not TOAST compression, but prefix compression.
I've thought about it as well. It's totally feasible, and likely
worthwhile, but a little more tricky.
> I've been wondering lately, whether a format change in the B-Tree
> could be wort
