| From: | Heikki Linnakangas <heikki(dot)linnakangas(at)enterprisedb(dot)com> |
|---|---|
| To: | decibel <decibel(at)decibel(dot)org> |
| Cc: | Dimitri Fontaine <dfontaine(at)hi-media(dot)com>, Glen Parker <glenebob(at)nwlink(dot)com>, PostgreSQL-development <pgsql-hackers(at)postgresql(dot)org>, Andrew Dunstan <andrew(at)dunslane(dot)net> |
| Subject: | Re: more than one index in a single heap pass? |
| Date: | 2009-07-17 19:15:56 |
| Message-ID: | 4A60CDEC.7080506@enterprisedb.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
decibel wrote:
> Here's an off-the-wall thought... since most of the CPU time is in the
> sort, what about allowing a backend to fork off dedicated sort
> processes? Aside from building multiple indexes at once, that
> functionality could also be useful in general queries.
Sure, that would be cool. And also a lot of work :-). The comparison
operators can be arbitrarily complex, potentially querying other tables
etc, so you would indeed need pretty much all the infrastrucutre you
need to solve the general case.
--
Heikki Linnakangas
EnterpriseDB http://www.enterprisedb.com
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Kevin Grittner | 2009-07-17 19:21:09 | Re: Higher TOAST compression. |
| Previous Message | Joe Conway | 2009-07-17 19:05:46 | commitfest application question |