Re: So, is COUNT(*) fast now?
Tom Lane <tgl@sss.pgh.pa.us>
From: Tom Lane <tgl@sss.pgh.pa.us>
To: Andres Freund <andres@anarazel.de>
Cc: pgsql-hackers@postgresql.org, Robert Haas <robertmhaas@gmail.com>
Date: 2011-10-22T15:20:26Z
Lists: pgsql-hackers
Commits
Same data as JSON:
GET /api/v1/messages/:b64id/commits
the thread's linked commits as JSON, with link sources.
API reference →
-
Remove pg_upgrade dependency on the 'postgres' database existing in the
- 51eba98cf459 9.2.0 cited
Andres Freund <andres@anarazel.de> writes: > On Friday, October 21, 2011 08:14:12 PM Robert Haas wrote: >> On Fri, Oct 21, 2011 at 2:08 PM, Tom Lane <tgl@sss.pgh.pa.us> wrote: >>> It's not "touching six times less data". It's touching the exact same >>> number of tuples either way, just index tuples in one case and heap >>> tuples in the other. >> Yeah, but it works out to fewer pages. > But access to those is not sequential. I guess if you measure cache hit ratios > the index scan will come out significantly worse. Huh? In the case he's complaining about, the index is all in RAM. Sequentiality of access is not an issue (at least not at the page level --- within a page I suppose there could be cache-line effects). regards, tom lane