From: | "Pavan Deolasee" <pavan(dot)deolasee(at)gmail(dot)com> |
---|---|
To: | "Tom Lane" <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
Cc: | "Heikki Linnakangas" <heikki(at)enterprisedb(dot)com>, "Hannu Krosing" <hannu(at)skype(dot)net>, mark(at)mark(dot)mielke(dot)cc, "Simon Riggs" <simon(at)2ndquadrant(dot)com>, pgsql-hackers(at)postgresql(dot)org, "Pavan Deolasee" <pavan(dot)deolasee(at)enterprisedb(dot)com>, "Nikhil S" <nikhil(dot)sontakke(at)enterprisedb(dot)com> |
Subject: | Re: HOT for PostgreSQL 8.3 |
Date: | 2007-02-13 15:37:16 |
Message-ID: | 2e78013d0702130737w70d19fa8l9155ec0b275eaf11@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On 2/13/07, Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> wrote:
>
> Heikki Linnakangas <heikki(at)enterprisedb(dot)com> writes:
> > Hannu Krosing wrote:
> >> Are we actually doing that ? I.E are null bitmaps really allocated in 1
> >> byte steps nowadays ?
>
> > Yes.
>
> Not really; we still have to MAXALIGN at the end of the bitmap. The
> point is that you can get 8 bits in there before paying the first
> additional MAXALIGN increment.
>
> It's all moot anyway since 8 bits isn't enough for a pointer ...
>
>
We could live with 8 bits actually. We can store only the least
significant 8 bits of the pointer. It would point to a set of tuples and
we may need to search within that set to find the required tuple.
This would still be better than scanning the entire page.
But I agree that utilizing those 8 bits would result in a penalty
for tables with few columns.
Thanks,
Pavan
--
EnterpriseDB http://www.enterprisedb.com
From | Date | Subject | |
---|---|---|---|
Next Message | Magnus Hagander | 2007-02-13 15:40:45 | Re: XML changes broke assert-enabled vcbuild |
Previous Message | Heikki Linnakangas | 2007-02-13 15:30:08 | Re: Variable length varlena headers redux |