Received: from malur.postgresql.org ([217.196.149.56]) by arkaria.postgresql.org with esmtps (TLS1.2:ECDHE_RSA_AES_256_CBC_SHA1:256) (Exim 4.89) (envelope-from ) id 1h6j6r-0004Oi-OI for pgsql-committers@arkaria.postgresql.org; Wed, 20 Mar 2019 21:50:53 +0000 Received: from localhost ([127.0.0.1] helo=malur.postgresql.org) by malur.postgresql.org with esmtp (Exim 4.89) (envelope-from ) id 1h6j6q-00087k-BN for pgsql-committers@arkaria.postgresql.org; Wed, 20 Mar 2019 21:50:52 +0000 Received: from magus.postgresql.org ([2a02:c0:301:0:ffff::29]) by malur.postgresql.org with esmtps (TLS1.2:ECDHE_RSA_AES_256_CBC_SHA1:256) (Exim 4.89) (envelope-from ) id 1h6j6q-00087d-66 for pgsql-committers@lists.postgresql.org; Wed, 20 Mar 2019 21:50:52 +0000 Received: from sss.pgh.pa.us ([66.207.139.130]) by magus.postgresql.org with esmtps (TLS1.2:ECDHE_RSA_AES_256_CBC_SHA1:256) (Exim 4.89) (envelope-from ) id 1h6j6n-0002UB-32 for pgsql-committers@lists.postgresql.org; Wed, 20 Mar 2019 21:50:51 +0000 Received: from sss1.sss.pgh.pa.us (localhost [127.0.0.1]) by sss.pgh.pa.us (8.14.4/8.14.4) with ESMTP id x2KLojRM017846; Wed, 20 Mar 2019 17:50:45 -0400 From: Tom Lane To: Peter Geoghegan cc: pgsql-committers Subject: Re: pgsql: Make heap TID a tiebreaker nbtree index column. In-reply-to: References: <13999.1553105283@sss.pgh.pa.us> <24277.1553114810@sss.pgh.pa.us> <16667.1553116435@sss.pgh.pa.us> <17604.1553118255@sss.pgh.pa.us> Comments: In-reply-to Peter Geoghegan message dated "Wed, 20 Mar 2019 14:47:58 -0700" MIME-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Content-ID: <17844.1553118645.1@sss.pgh.pa.us> Date: Wed, 20 Mar 2019 17:50:45 -0400 Message-ID: <17845.1553118645@sss.pgh.pa.us> List-Id: List-Help: List-Subscribe: List-Post: List-Owner: List-Archive: Precedence: bulk Peter Geoghegan writes: > On Wed, Mar 20, 2019 at 2:44 PM Tom Lane wrote: >> 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. > That's good. I'm trying to fix it by hand right now, in the way that > Andres suggested. It is both tedious and error-prone. Yeah. Don't do that. After further thought I think I'll go with the alternate solution (separate sortObjectAddresses function) as that could possibly have other uses, and removing the "const" from performMultipleDeletions seems a bit bletcherous. Will push a fix in a few minutes. regards, tom lane