Skip site navigation (1) Skip section navigation (2)

Re: I: About "Our CLUSTER implementation is pessimal" patch

From: Leonardo F <m_lists(at)yahoo(dot)it>
To: Josh Kupershmidt <schmiddy(at)gmail(dot)com>
Cc: pgsql-hackers(at)postgresql(dot)org
Subject: Re: I: About "Our CLUSTER implementation is pessimal" patch
Date: 2010-02-10 18:30:35
Message-ID: (view raw, whole thread or download thread mbox)
Lists: pgsql-hackers
>Perhaps you could supply a .sql file containing a testcase 
> illustrating the performance benefits you tested with your patch


Attached the updated patch (should solve a bug) and a script.
The sql scripts generates a 2M rows table ("orig"); then the
table is copied and the copy clustered using seq + sort (since 
"set enable_seqscan=false;").
Then the table "orig" is copied again, and the copy clustered
using regular index scan (set enable_indexscan=true; set 
Then the same thing is done on a 5M rows table, and on a 10M
rows table.

On my system (Sol10 on a dual Opteron 2.8) single disc:

2M:  seq+sort 11secs; regular index scan: 33secs
5M:  seq+sort 39secs; regular index scan: 105secs
10M:seq+sort 83secs; regular index scan: 646secs

Maybe someone could suggest a better/different test?



Attachment: sorted_cluster20100210.patch
Description: application/octet-stream (26.5 KB)
Attachment: cluster_tests.sql
Description: application/octet-stream (2.8 KB)

In response to


pgsql-hackers by date

Next:From: Teodor SigaevDate: 2010-02-10 18:40:16
Subject: Re: [CFReview] Red-Black Tree
Previous:From: Heikki LinnakangasDate: 2010-02-10 18:15:32
Subject: Re: synchronized snapshots

Privacy Policy | About PostgreSQL
Copyright © 1996-2017 The PostgreSQL Global Development Group