Re: [HACKERS] A Better External Sort?

From: Josh Berkus <josh(at)agliodbs(dot)com>
To: "Jeffrey W(dot) Baker" <jwbaker(at)acm(dot)org>
Cc: pgsql-hackers(at)postgresql(dot)org, Michael Stone <mstone+postgres(at)mathom(dot)us>, pgsql-performance(at)postgresql(dot)org
Subject: Re: [HACKERS] A Better External Sort?
Date: 2005-10-03 22:03:11
Message-ID: 200510031503.12158.josh@agliodbs.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers pgsql-performance

Jeffrey,

> I guess database reads are different, but I remain unconvinced that they
> are *fundamentally* different. After all, a tab-delimited file (my sort
> workload) is a kind of database.

Unfortunately, they are ... because of CPU overheads. I'm basing what's
"reasonable" for data writes on the rates which other high-end DBs can
make. From that, 25mb/s or even 40mb/s for sorts should be achievable
but doing 120mb/s would require some kind of breakthrough.

> On a single disk you wouldn't notice, but XFS scales much better when
> you throw disks at it. I get a 50MB/sec boost from the 24th disk,
> whereas ext3 stops scaling after 16 disks. For writes both XFS and ext3
> top out around 8 disks, but in this case XFS tops out at 500MB/sec while
> ext3 can't break 350MB/sec.

That would explain it. I seldom get more than 6 disks (and 2 channels) to
test with.

--
--Josh

Josh Berkus
Aglio Database Solutions
San Francisco

In response to

Browse pgsql-hackers by date

  From Date Subject
Next Message mark 2005-10-03 22:07:42 Re: PG Killed by OOM Condition
Previous Message Josh Berkus 2005-10-03 21:59:30 Re: [HACKERS] A Better External Sort?

Browse pgsql-performance by date

  From Date Subject
Next Message Qingqing Zhou 2005-10-03 23:04:50 Re: Query seem to slow if table have more than 200 million rows
Previous Message Josh Berkus 2005-10-03 21:59:30 Re: [HACKERS] A Better External Sort?