From: | Heikki Linnakangas <heikki(at)enterprisedb(dot)com> |
---|---|
To: | Gregory Stark <stark(at)enterprisedb(dot)com> |
Cc: | Dawid Kuroczko <qnex42(at)gmail(dot)com>, pgsql-hackers(at)postgresql(dot)org |
Subject: | Re: Index Tuple Compression Approach? |
Date: | 2007-08-16 06:48:00 |
Message-ID: | 46C3F320.1010809@enterprisedb.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
Gregory Stark wrote:
> "Heikki Linnakangas" <heikki(at)enterprisedb(dot)com> writes:
>
>> That general approach of storing a common part leading part just once is
>> called prefix compression. Yeah, it helps a lot on long text fields.
>> Tree structures like file paths in particular.
>
> You kind of want to do avoid both the prefix and the suffix, no?
You're much more likely to find common prefixes than suffixes in an
index page, because of the ordering. I suppose compressing the suffix
would be useful in some cases as well. You might be better off with some
generic compression algorithm at that point, though.
>> It's been discussed before. One big problem is extracting the common
>> leading part. You could only do it for text,
>
> Or for multi-column indexes
Oh yeah, that you could do more easily.
--
Heikki Linnakangas
EnterpriseDB http://www.enterprisedb.com
From | Date | Subject | |
---|---|---|---|
Next Message | Gregory Stark | 2007-08-16 07:48:31 | Re: Index Tuple Compression Approach? |
Previous Message | Decibel! | 2007-08-16 03:52:21 | Re: Another idea for index-only scans |