From: | Edmund Horner <ejrh00(at)gmail(dot)com> |
---|---|
To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
Cc: | David Rowley <david(dot)rowley(at)2ndquadrant(dot)com>, tomas(dot)vondra(at)2ndquadrant(dot)com, PostgreSQL Developers <pgsql-hackers(at)lists(dot)postgresql(dot)org> |
Subject: | Re: Tid scan improvements |
Date: | 2018-12-21 00:09:25 |
Message-ID: | CAMyN-kAc-rr5GVOL64TET95R3cLPjBzVtY=aH2DEOpymqiRanw@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On Fri, 21 Dec 2018 at 11:21, Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> wrote:
>
> Edmund Horner <ejrh00(at)gmail(dot)com> writes:
> > [ tid scan patches ]
>
> I'm having a hard time wrapping my mind around why you'd bother with
> backwards TID scans. The amount of code needed versus the amount of
> usefulness seems like a pretty bad cost/benefit ratio, IMO. I can
> see that there might be value in knowing that a regular scan has
> "ORDER BY ctid ASC" pathkeys (mainly, that it might let us mergejoin
> on TID without an explicit sort). It does not, however, follow that
> there's any additional value in supporting the DESC case.
I have occasionally found myself running "SELECT MAX(ctid) FROM t"
when I was curious about why a table is so big after vacuuming.
Perhaps that's not a common enough use case to justify the amount of
code, especially the changes to heapam.c and explain.c.
We'd still need the pathkeys to make good use of forward scans. (And
I think the executor still needs to support seeking backward for
cursors.)
From | Date | Subject | |
---|---|---|---|
Next Message | Michael Paquier | 2018-12-21 00:10:29 | Re: Add timeline to partial WAL segments |
Previous Message | Michael Paquier | 2018-12-21 00:01:39 | Re: Remove Deprecated Exclusive Backup Mode |