Skip site navigation (1)
Skip section navigation (2)
Peripheral Links
Header And Logo
|
Site Navigation
Re: [PERFORM] A Better External Sort?
- From: Josh Berkus <josh(at)agliodbs(dot)com>
- To: Ron Peacetree <rjpeace(at)earthlink(dot)net>
- Cc: Dann Corbit <DCorbit(at)connx(dot)com>, pgsql-hackers(at)postgresql(dot)org, pgsql-performance(at)postgresql(dot)org
- Subject: Re: [PERFORM] A Better External Sort?
- Date: Tue, 27 Sep 2005 09:15:06 -0700
- Message-id: <4339700A(dot)2030803(at)agliodbs(dot)com>
Ron,I've somehow missed part of this thread, which is a shame since this is an area of primary concern for me.
Your suggested algorithm seems to be designed to relieve I/O load by making more use of the CPU. (if I followed it correctly). However, that's not PostgreSQL's problem; currently for us external sort is a *CPU-bound* operation, half of which is value comparisons. (oprofiles available if anyone cares)
So we need to look, instead, at algorithms which make better use of work_mem to lower CPU activity, possibly even at the expense of I/O.
--Josh Berkus
- References:
- Re: [PERFORM] A Better External Sort?
- From: Ron Peacetree
- Re: [PERFORM] A Better External Sort?
- Prev by Date: Re: Database file compatability
- Next by Date: Re: Making pgxs builds work with a relocated installation
- Previous by thread: Re: [PERFORM] A Better External Sort?
- Next by thread: Re: [PERFORM] A Better External Sort?
- Indexes: