Re: [SQL] optimizing 2-table join w/millions of rows

From: Herouth Maoz <herouth(at)oumail(dot)openu(dot)ac(dot)il>
To: pgsql-sql(at)postgreSQL(dot)org
Subject: Re: [SQL] optimizing 2-table join w/millions of rows
Date: 1998-11-23 16:36:26
Message-ID: l03110701b27f3f164fd6@[147.233.159.109]
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-sql

At 18:10 +0200 on 23/11/98, Tom Lane wrote:

> Here, indexes on the part number would be stressed. You'd have to
> experiment to see which is faster on your data. (As far as I know,
> the Postgres optimizer will always evaluate your AND clauses left to
> right, which means that the key to performance is to make the leftmost
> clause reject as large a fraction of candidate rows as possible.)

I thought the optimizer canonized the where clause into an ANDing of ORs,
and then sought the best solution. That is, that the order of the clauses
did not matter, because the optimizer would know that comparison to a
literal on an indexed column is better than comparison to a field.

Herouth

--
Herouth Maoz, Internet developer.
Open University of Israel - Telem project
http://telem.openu.ac.il/~herutma

In response to

Browse pgsql-sql by date

  From Date Subject
Next Message Engard Ferenc 1998-11-23 19:20:56 cursor and update + view
Previous Message Tom Lane 1998-11-23 16:10:59 Re: [SQL] optimizing 2-table join w/millions of rows