Re: [HACKERS] [WIP] [B-Tree] Keep indexes sorted by heap physical location - Mailing list pgsql-hackers

From Peter Geoghegan
Subject Re: [HACKERS] [WIP] [B-Tree] Keep indexes sorted by heap physical location
Date
Msg-id CAH2-Wzn4s7hdMD_69gwFW3ER0FsPLgFbqtvJXH9Rf+tQNC2xHA@mail.gmail.com
Whole thread Raw
In response to Re: [HACKERS] [WIP] [B-Tree] Keep indexes sorted by heap physical location  (Claudio Freire <klaussfreire@gmail.com>)
Responses Re: [HACKERS] [WIP] [B-Tree] Keep indexes sorted by heap physical location
List pgsql-hackers
On Mon, Jul 24, 2017 at 9:51 AM, Claudio Freire <klaussfreire@gmail.com> wrote:
> My point was that the TID doesn't have to point to an actual tuple.
>
> It's more of a keyspace thing, so it doesn't need to match real
> tuples, it can just divide the keyspace with an arbitrary cutoff, and
> should be cheapter to maintain without that requirement.

I agree, but unless you're using normalized keys, then I don't see
that you get much useful leeway from using fake or truncated TID
values. Presumably the comparison logic will be based on comparing an
ItemPointerData field, which is impractical to truncate.

-- 
Peter Geoghegan



pgsql-hackers by date:

Previous
From: Claudio Freire
Date:
Subject: Re: [HACKERS] [WIP] [B-Tree] Keep indexes sorted by heap physical location
Next
From: Sokolov Yura
Date:
Subject: Re: [HACKERS] Increase Vacuum ring buffer.