From: | Zeugswetter Andreas SB <ZeugswetterA(at)wien(dot)spardat(dot)at> |
---|---|
To: | "'Bruce Momjian'" <pgman(at)candle(dot)pha(dot)pa(dot)us>, Peter Eisentraut <peter_e(at)gmx(dot)net> |
Cc: | PostgreSQL-development <pgsql-hackers(at)postgresql(dot)org> |
Subject: | AW: AW: pg_index.indislossy |
Date: | 2001-07-10 15:06:12 |
Message-ID: | 11C1E6749A55D411A9670001FA687963368376@sdexcsrv1.f000.d0188.sd.spardat.at |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
> > > > > > > Can someone tell me what we use indislossy for?
> > > >
> > > > Ok, so the interpretation of this field is:
> > > > A match in the index needs to be reevaluated in the heap tuple data,
> > > > since a match in the index does not necessarily mean, that the heap tuple
> > > > matches.
> > > > If the heap tuple data matches, the index must always match.
> >
> > AFAIK, this is true for all indexes in PostgreSQL, because index rows
> > don't store the transactions status. Of course those are two different
> > underlying reasons why a heap lookup is always necessary, but there
> > shouldn't be any functional difference in the current implementation.
>
> Seems it is something they added for the index abstraction and not for
> practical use by PostgreSQL.
Why, you do not need to call the comparison function on the heap data
if the index is not lossy, saves some CPU cycles.
Andreas
From | Date | Subject | |
---|---|---|---|
Next Message | Tom Lane | 2001-07-10 15:47:39 | Re: AW: pg_index.indislossy |
Previous Message | Bruce Momjian | 2001-07-10 14:56:01 | Re: AW: pg_index.indislossy |