?
Also, what version is this?
--
Álvaro Herrera alvhe...@commandprompt.com
The PostgreSQL Company - Command Prompt, Inc.
PostgreSQL Replication, Consulting, Custom Development, 24x7 support
The version is 9.0.1. I believe the latest version works in the same way.
Thanks,
Li Jie
--
Sent via
Thank you for all your comments.
I think the condition of this optimization is whether the small table can fit
into memory. If not, then it doesn't work since two tables still need to be
written to disk. But if yes, we can save all I/O costs in the hash join
process.
Thanks,
Li Jie
,
Li Jie
--
Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org)
To make changes to your subscription:
http://www.postgresql.org/mailpref/pgsql-hackers
- Original Message -
From: Kenneth Marshall k...@rice.edu
To: Li Jie jay23j...@gmail.com
Cc: pgsql-hackers pgsql-hackers@postgresql.org
Sent: Thursday, December 23, 2010 10:30 PM
Subject: Re: [HACKERS] Why is sorting on two columns so slower thansortingon
one column?
On Thu, Dec 23
the same I/O costs, why should there be so much difference?
Thanks,
Li Jie
- Original Message -
From: Marti Raudsepp ma...@juffo.org
To: Jie Li jay23j...@gmail.com
Cc: pgsql-hackers pgsql-hackers@postgresql.org
Sent: Thursday, December 23, 2010 10:17 PM
Subject: Re: [HACKERS] Why is sorting
so expensive? Does it incur additional I/O? From the cost
model, it seems not, all the cost are the same (575775.45).
Thanks,
Li Jie
- Original Message -
From: Kenneth Marshall k...@rice.edu
To: Jie Li jay23j...@gmail.com
Cc: pgsql-hackers pgsql-hackers@postgresql.org
Sent: Thursday
Hi all,
I'm interested in this parallel project,
http://wiki.postgresql.org/wiki/Parallel_Query_Execution
But I can't find any discussion and current progress in the website, it
seems to stop for nearly a year?
Thanks,
Li Jie
--
Sent via pgsql-hackers mailing list (pgsql-hackers
