Re: Reducing overhead for repeat de-TOASTing

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: Jeff <threshar(at)threshar(dot)is-a-geek(dot)com>
Cc: pgsql-hackers(at)postgresql(dot)org
Subject: Re: Reducing overhead for repeat de-TOASTing
Date: 2008-06-17 13:49:15
Message-ID: 19905.1213710555@sss.pgh.pa.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

Jeff <threshar(at)threshar(dot)is-a-geek(dot)com> writes:
> On Jun 16, 2008, at 3:35 PM, Tom Lane wrote:
>> the result of decompressing an inline-compressed datum, because those
>> have no unique ID that could be used for a lookup key. This puts a
>> bit of a

> Wouldn't the tid fit this? or table oid + tid?

No. The killer reason why not is that at the time we need to decompress
a datum, we don't know what row it came from. There are some other
problems too...

regards, tom lane

In response to

Browse pgsql-hackers by date

  From Date Subject
Next Message David Fetter 2008-06-17 14:04:39 sh -> pl
Previous Message Tom Lane 2008-06-17 13:39:35 plan cache vs regclass constants