From: | Gokulakannan Somasundaram <gokul007(at)gmail(dot)com> |
---|---|
To: | Jeff Davis <pgsql(at)j-davis(dot)com> |
Cc: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, Greg Stark <stark(at)mit(dot)edu>, pgsql-hackers(at)postgresql(dot)org |
Subject: | Re: An idle thought |
Date: | 2010-03-18 11:11:45 |
Message-ID: | 9362e74e1003180411q154e48a9hf4d7ddba7a0c29e@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
>
>
> I didn't mean that we'd want to compress it to the absolute minimum
> size. I had envisioned that it would be a simple scheme designed only to
> eliminate long runs of identical visibility information (perhaps only
> the frozen and always visible regions would be compressed).
>
> The extra level of indirection would be slower, but if we freeze tuples
> more aggressively (which would be much cheaper if we didn't have to go
> to the heap), there might be a small number of tuples with interesting
> visibility information at any particular time.
>
>
> This should be achievable with current proposal of Heikki, but I think it
is useful only for tables which won't have more concurrent operations and on
databases without any long running queries. So if we have an option to
create a visibiliy map ( on the lines of materialized view ), whenever we
want for a table, it would help a good number of use cases, i suppose.
Thanks,
Gokul.
From | Date | Subject | |
---|---|---|---|
Next Message | Heikki Linnakangas | 2010-03-18 11:45:55 | Re: WIP: shared ispell dictionary |
Previous Message | Gokulakannan Somasundaram | 2010-03-18 11:06:11 | Re: An idle thought |