Re: performance on selecting a row in large tables - Mailing list pgsql-admin

From Rainer Spittel
Subject Re: performance on selecting a row in large tables
Date
Msg-id 12B8F225666F99489CEFA8B3F261540CFAAE11@geneva.local.terralink
Whole thread Raw
In response to performance on selecting a row in large tables  ("Rainer Spittel" <rainer.spittel@terralink.co.nz>)
Responses Re: performance on selecting a row in large tables  (Tom Lane <tgl@sss.pgh.pa.us>)
Re: performance on selecting a row in large tables  (Tino Schwarze <postgresql@tisc.de>)
List pgsql-admin
Hi Tom,

  You are right, this query is not the right approach for performance
testing. I thought that this will give an indication about the
performance of a select statement on that table.

  One of those slow queries are running on col02 which has a btree
index. But I use the 'in' expression to get a set of matching rows:

  select * from table where col02 in ('...',[...],'...')

  This query gets sometimes really slow, I guess it depends on the size
of the set used by 'in'.

  Would the query perform better when I cluster the index on col02 and
force to order the set for the in clause?

  Is there a way to disable the caching for testing? Once I ran the
query, the result set seems to be cached and the second run of the query
is fast. This makes a testing a little difficult ;-)

regards.
Rainer

pgsql-admin by date:

Previous
From: Tino Schwarze
Date:
Subject: Re: performance on selecting a row in large tables
Next
From: Tom Lane
Date:
Subject: Re: performance on selecting a row in large tables