From: | Andres Freund <andres(at)anarazel(dot)de> |
---|---|
To: | pgsql-hackers(at)postgresql(dot)org |
Cc: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, Robert Haas <robertmhaas(at)gmail(dot)com> |
Subject: | Re: So, is COUNT(*) fast now? |
Date: | 2011-10-22 15:54:14 |
Message-ID: | 201110221754.15396.andres@anarazel.de |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On Saturday, October 22, 2011 05:20:26 PM Tom Lane wrote:
> Andres Freund <andres(at)anarazel(dot)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(at)sss(dot)pgh(dot)pa(dot)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).
I was talking about L2/L3 caches...
Andres
From | Date | Subject | |
---|---|---|---|
Next Message | Tom Lane | 2011-10-22 16:19:47 | Re: So, is COUNT(*) fast now? |
Previous Message | Joshua D. Drake | 2011-10-22 15:37:51 | Re: database file encryption. |