From: | Richard Huxton <dev(at)archonet(dot)com> |
---|---|
To: | vinita bansal <sagivini(at)hotmail(dot)com> |
Cc: | jd(at)commandprompt(dot)com, pgsql-general(at)postgresql(dot)org |
Subject: | Re: reorder table data |
Date: | 2005-04-20 10:03:19 |
Message-ID: | 426628E7.4080605@archonet.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-general |
vinita bansal wrote:
> Hi,
>
> There is no particular pattern but it is generally the update queries of
> the form "update tableName set colName='something'" that are taking a
> lot of time incase there is a lot of background data.
Well, that query will obviously update the entire table, but if you
can't predict which rows will be changed all you can do is index the
appropriate column(s) you select against.
> Also, I would not
> like to change my application to access data from another schema when
> required. I want this to be handled at database level wherein everything
> in database itself is organised to make access faster.
Not without some pattern to work to - if you can't say which rows will
be accessed next, then how can your database know?
Can you provide an actual example of a query you find too slow, how long
it takes and what it's EXPLAIN ANALYSE is?
--
Richard Huxton
Archonet Ltd
From | Date | Subject | |
---|---|---|---|
Next Message | Devrim GUNDUZ | 2005-04-20 10:31:23 | Re: Postgresql 8.0.2 SLES 9 rpm - libpq.so.3 broken |
Previous Message | Baldur Norddahl | 2005-04-20 09:10:34 | Re: postgresql start/stop/status script |