Re: pgsql: Make heap TID a tiebreaker nbtree index column.

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: Peter Geoghegan <pg(at)bowt(dot)ie>
Cc: pgsql-committers <pgsql-committers(at)lists(dot)postgresql(dot)org>
Subject: Re: pgsql: Make heap TID a tiebreaker nbtree index column.
Date: 2019-03-20 21:44:15
Message-ID: 17604.1553118255@sss.pgh.pa.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-committers

I wrote:
> A preliminary check-world run finds no places where the output changes,
> but I've not tried this with SELinux yet.

After trying it (against yesterday's sources) on my SELinux-capable
machine, I see no evidence that we need any output ordering changes
at all if we go this route. This is probably unsurprising considering
that the old btree code used to provide mostly-reverse-insertion-order
scan order.

regards, tom lane

In response to

Responses

Browse pgsql-committers by date

  From Date Subject
Next Message Peter Geoghegan 2019-03-20 21:47:58 Re: pgsql: Make heap TID a tiebreaker nbtree index column.
Previous Message Alvaro Herrera 2019-03-20 21:19:25 pgsql: Add index_get_partition convenience function