Re: Tid scan improvements
Edmund Horner <ejrh00@gmail.com>
From: Edmund Horner <ejrh00@gmail.com>
To: Tom Lane <tgl@sss.pgh.pa.us>
Cc: David Rowley <david.rowley@2ndquadrant.com>, tomas.vondra@2ndquadrant.com, PostgreSQL Developers <pgsql-hackers@lists.postgresql.org>
Date: 2018-12-21T00:09:25Z
Lists: pgsql-hackers
On Fri, 21 Dec 2018 at 11:21, Tom Lane <tgl@sss.pgh.pa.us> wrote: > > Edmund Horner <ejrh00@gmail.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.)
Commits
-
Add TID Range Scans to support efficient scanning ranges of TIDs
- bb437f995d47 14.0 landed
-
Improve planner's selectivity estimates for inequalities on CTID.
- f7111f72d2fd 12.0 landed