On Fri, 12 Jul 2002 01:01:31 -0400 (EDT) in message
<[EMAIL PROTECTED]>, Bruce Momjian <[EMAIL PROTECTED]>
wrote:
> Rudi Starcevic wrote:
> > Hello,
> >
> > If I write a query that is inefficient or in an eternal loop how
> > do I stop it without restarting the postmaster ?
> >
> > I can see m
On Wed, 28 Aug 2002 16:12:41 -0400 in message
<[EMAIL PROTECTED]>, george young <[EMAIL PROTECTED]> wrote:
> [postgreql 7.2, linux]
> I have a table T with columns run, wafer, and test:
>T(run text, wafer int, test text)
> Given a run and a set of wafers, I need the set of tests that match
>
> I'm sure there's a better way, but I think a series of union alls would
> do it but be rather computationally expensive.
>
> select cod_var, Year, Month, 1 as Day, RainDay1 as Rain
> where Ten=1
> union all
> select cod_var, Year, Month, 2 as Day, RainDay2 as Rain
> where Ten=1
You could do t
I have a long running process that performs outside actions on the content of a table.
The actions could all be done in parallel (if I had n processors), but I need to
ensure that the process is attempted exactly one time per applicable row.
My current design for one thread is the following (si
I'm having trouble subtracting groups from other groups.
I've got a data model that has the following essential features:
create table contacts (num int, properties);
create table groups (groupNum int, contactNum int);
Where not all contacts will be in a group, some groups will contain mos
> SELECT * ...
> FROM ...
> WHERE NOT IN (SELECT contactnum FROM groups WHERE groupnum='c' or
> groupnum='d' OR ... )
>
> is bound to be _much_ faster!
Yeah, that's an obvious optimization. Unfortunately, due to needing to match semantics
of a previous non-sql version and some pathological g
On Nov 10, 2003, at 1:02 PM, Nick Fankhauser wrote:
Hi-
I'm suffering from a performance problem, but when I look at my query,
I'm
not convinced that there isn't a better way to handle this in SQL. -So
I'm
seeking advice here before I go to the performance list.
An explain analyze would help.
