| From: | "Luke Lonergan" <llonergan(at)greenplum(dot)com> |
|---|---|
| To: | "Heikki Linnakangas" <hlinnaka(at)iki(dot)fi>, pgsql-hackers(at)postgresql(dot)org |
| Subject: | Re: Dead Space Map |
| Date: | 2006-02-27 18:02:27 |
| Message-ID: | C0287EB3.1DE78%llonergan@greenplum.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
Heikki,
On 2/27/06 9:53 AM, "Heikki Linnakangas" <hlinnaka(at)iki(dot)fi> wrote:
> My current implementation stores a bitmap of 32k bits in the special space
> of every 32k heap pages. Each bit in the bitmap corresponds one heap page.
> The bit is set every time a tuple is updated, and it's cleared by vacuum.
> This is a very simple approach, and doesn't take much space.
>
> Is there something I'm missing? Any ideas?
Sounds great!
> I'm going to have some spare time to hack PostgreSQL in the coming
> months, and I'm thinking of refining this if there's interest. Is anyone
> else working on this?
This idea seems like it could dramatically improve vacuum - commonly a big
issue.
- Luke
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Tom Lane | 2006-02-27 18:17:36 | Re: Dead Space Map |
| Previous Message | Heikki Linnakangas | 2006-02-27 17:53:07 | Dead Space Map |