Re: So, is COUNT(*) fast now?
От | Robert Haas |
---|---|
Тема | Re: So, is COUNT(*) fast now? |
Дата | |
Msg-id | CA+Tgmoaj03w5REVnpwwnhwNEaZFCYDZvMsu3yFAk=-b1vzomkQ@mail.gmail.com обсуждение исходный текст |
Ответ на | Re: So, is COUNT(*) fast now? (Robert Haas <robertmhaas@gmail.com>) |
Ответы |
Re: So, is COUNT(*) fast now?
Re: So, is COUNT(*) fast now? |
Список | pgsql-hackers |
On Fri, Oct 21, 2011 at 3:07 PM, Robert Haas <robertmhaas@gmail.com> wrote: > [ oprofile results ] *grovels through the line-by-line results* Hmm, I guess there is a bit of a hotspot in StoreIndexTuple, which is probably being folded into IndexOnlyNext in the per-function timings: ExecClearTuple(slot); for (i = 0; i < nindexatts; i++) values[i] = index_getattr(itup, i + 1, itupdesc, &isnull[i]); ExecStoreVirtualTuple(slot); If I'm reading these results right, that section is about 3% of the total number of samples. Also, this line is kind of expensive: if (!visibilitymap_test(scandesc->heapRelation, ItemPointerGetBlockNumber(tid), &node->ioss_VMBuffer)) Around 2%. But I don't see any way to avoid that, or even make it cheaper. -- Robert Haas EnterpriseDB: http://www.enterprisedb.com The Enterprise PostgreSQL Company
В списке pgsql-hackers по дате отправления: