From: Tom Lane <tgl@sss.pgh.pa.us>
To: Ron Peacetree <rjpeace@earthlink.net>
Cc: Dann Corbit <DCorbit@connx.com>
Cc: pgsql-hackers@postgresql.org
Cc: pgsql-performance@postgresql.org
Subject: Re: [PERFORM] A Better External Sort?
Date: Mon, 26 Sep 2005 21:42:18 -0400
Message-ID: <6141.1127785338@sss.pgh.pa.us> (raw)
In-Reply-To: <19483839.1127783447942.JavaMail.root@elwamui-polski.atl.sa.earthlink.net>
References: <19483839.1127783447942.JavaMail.root@elwamui-polski.atl.sa.earthlink.net>
Ron Peacetree <rjpeace@earthlink.net> writes:
> Let's start by assuming that an element is <= in size to a cache line and a
> node fits into L1 DCache. [ much else snipped ]
So far, you've blithely assumed that you know the size of a cache line,
the sizes of L1 and L2 cache, and that you are working with sort keys
that you can efficiently pack into cache lines. And that you know the
relative access speeds of the caches and memory so that you can schedule
transfers, and that the hardware lets you get at that transfer timing.
And that the number of distinct key values isn't very large.
I don't see much prospect that anything we can actually use in a
portable fashion is going to emerge from this line of thought.
regards, tom lane
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Reply to all the recipients using the --to and --cc options:
reply via email
To: pgsql-performance@postgresql.org
Cc: tgl@sss.pgh.pa.us, rjpeace@earthlink.net, DCorbit@connx.com, pgsql-hackers@postgresql.org
Subject: Re: [PERFORM] A Better External Sort?
In-Reply-To: <6141.1127785338@sss.pgh.pa.us>
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
This inbox is served by DDX for PostgreSQL; see mirroring instructions
for how to clone and mirror all data and code used for this inbox