Re: Optimizing Bitmap Heap Scan.
От | Matthew Wakeling |
---|---|
Тема | Re: Optimizing Bitmap Heap Scan. |
Дата | |
Msg-id | alpine.DEB.2.00.0912081440270.25000@aragorn.flymine.org обсуждение исходный текст |
Ответ на | Re: Optimizing Bitmap Heap Scan. (niraj patel <npatel@gridsolv.com>) |
Список | pgsql-performance |
On Tue, 8 Dec 2009, niraj patel wrote: > Thanks very much for the analysis. It does takes 17 sec to execute when > data is not in cache. It sounds like the table is already very much ordered by the workspaceid, otherwise this would have taken much longer. > What I would like to ask can partitioning around workspaceid would help? > Or any sort of selective index would help me. Depends on how many distinct values of workspaceid there are. I would suggest that given how well ordered your table is, and if you aren't doing too many writes, then there would be little benefit, and much hassle. Matthew -- Now, you would have thought these coefficients would be integers, given that we're working out integer results. Using a fraction would seem really stupid. Well, I'm quite willing to be stupid here - in fact, I'm going to use complex numbers. -- Computer Science Lecturer
В списке pgsql-performance по дате отправления: